25.04/10.86 YES 25.04/10.86 25.04/10.86 Ultimate: Cannot open display: 25.04/10.86 This is Ultimate 0.1.24-8dc7c08-m 25.04/10.86 [2019-03-28 12:13:44,940 INFO L170 SettingsManager]: Resetting all preferences to default values... 25.04/10.86 [2019-03-28 12:13:44,942 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 25.04/10.86 [2019-03-28 12:13:44,953 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 25.04/10.86 [2019-03-28 12:13:44,953 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 25.04/10.86 [2019-03-28 12:13:44,954 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 25.04/10.86 [2019-03-28 12:13:44,956 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 25.04/10.86 [2019-03-28 12:13:44,957 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 25.04/10.86 [2019-03-28 12:13:44,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 25.04/10.86 [2019-03-28 12:13:44,960 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 25.04/10.86 [2019-03-28 12:13:44,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 25.04/10.86 [2019-03-28 12:13:44,961 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 25.04/10.86 [2019-03-28 12:13:44,962 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 25.04/10.86 [2019-03-28 12:13:44,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 25.04/10.86 [2019-03-28 12:13:44,964 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 25.04/10.86 [2019-03-28 12:13:44,964 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 25.04/10.86 [2019-03-28 12:13:44,965 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 25.04/10.86 [2019-03-28 12:13:44,967 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 25.04/10.86 [2019-03-28 12:13:44,968 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 25.04/10.86 [2019-03-28 12:13:44,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 25.04/10.86 [2019-03-28 12:13:44,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 25.04/10.86 [2019-03-28 12:13:44,972 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 25.04/10.86 [2019-03-28 12:13:44,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 25.04/10.86 [2019-03-28 12:13:44,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 25.04/10.86 [2019-03-28 12:13:44,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 25.04/10.86 [2019-03-28 12:13:44,975 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 25.04/10.86 [2019-03-28 12:13:44,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 25.04/10.86 [2019-03-28 12:13:44,976 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 25.04/10.86 [2019-03-28 12:13:44,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 25.04/10.86 [2019-03-28 12:13:44,977 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 25.04/10.86 [2019-03-28 12:13:44,978 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 25.04/10.86 [2019-03-28 12:13:44,979 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 25.04/10.86 [2019-03-28 12:13:44,980 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 25.04/10.86 [2019-03-28 12:13:44,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 25.04/10.86 [2019-03-28 12:13:44,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 25.04/10.86 [2019-03-28 12:13:44,981 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 25.04/10.86 [2019-03-28 12:13:44,981 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 25.04/10.86 [2019-03-28 12:13:44,982 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 25.04/10.86 [2019-03-28 12:13:44,982 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 25.04/10.86 [2019-03-28 12:13:44,983 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 25.04/10.86 [2019-03-28 12:13:44,997 INFO L110 SettingsManager]: Loading preferences was successful 25.04/10.86 [2019-03-28 12:13:44,998 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 25.04/10.86 [2019-03-28 12:13:44,999 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 25.04/10.86 [2019-03-28 12:13:44,999 INFO L133 SettingsManager]: * Rewrite not-equals=true 25.04/10.86 [2019-03-28 12:13:44,999 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 25.04/10.86 [2019-03-28 12:13:44,999 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 25.04/10.86 [2019-03-28 12:13:44,999 INFO L133 SettingsManager]: * Use SBE=true 25.04/10.86 [2019-03-28 12:13:45,000 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 25.04/10.86 [2019-03-28 12:13:45,000 INFO L133 SettingsManager]: * Use old map elimination=false 25.04/10.86 [2019-03-28 12:13:45,000 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 25.04/10.86 [2019-03-28 12:13:45,000 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 25.04/10.86 [2019-03-28 12:13:45,000 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 25.04/10.86 [2019-03-28 12:13:45,000 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 25.04/10.86 [2019-03-28 12:13:45,001 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 25.04/10.86 [2019-03-28 12:13:45,001 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.04/10.86 [2019-03-28 12:13:45,001 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 25.04/10.86 [2019-03-28 12:13:45,001 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 25.04/10.86 [2019-03-28 12:13:45,001 INFO L133 SettingsManager]: * Check division by zero=IGNORE 25.04/10.86 [2019-03-28 12:13:45,001 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 25.04/10.86 [2019-03-28 12:13:45,002 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 25.04/10.86 [2019-03-28 12:13:45,002 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 25.04/10.86 [2019-03-28 12:13:45,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 25.04/10.86 [2019-03-28 12:13:45,002 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 25.04/10.86 [2019-03-28 12:13:45,002 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 25.04/10.86 [2019-03-28 12:13:45,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.04/10.86 [2019-03-28 12:13:45,003 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 25.04/10.86 [2019-03-28 12:13:45,003 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 25.04/10.86 [2019-03-28 12:13:45,003 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 25.04/10.86 [2019-03-28 12:13:45,003 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 25.04/10.86 [2019-03-28 12:13:45,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 25.04/10.86 [2019-03-28 12:13:45,043 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 25.04/10.86 [2019-03-28 12:13:45,047 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 25.04/10.86 [2019-03-28 12:13:45,048 INFO L271 PluginConnector]: Initializing CDTParser... 25.04/10.86 [2019-03-28 12:13:45,049 INFO L276 PluginConnector]: CDTParser initialized 25.04/10.86 [2019-03-28 12:13:45,049 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 25.04/10.86 [2019-03-28 12:13:45,112 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/2ad241610c0c4eb09eaf98bf51e582fa/FLAGb4990b3c7 25.04/10.86 [2019-03-28 12:13:45,459 INFO L307 CDTParser]: Found 1 translation units. 25.04/10.86 [2019-03-28 12:13:45,460 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 25.04/10.86 [2019-03-28 12:13:45,460 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 25.04/10.86 [2019-03-28 12:13:45,467 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/2ad241610c0c4eb09eaf98bf51e582fa/FLAGb4990b3c7 25.04/10.86 [2019-03-28 12:13:45,856 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/2ad241610c0c4eb09eaf98bf51e582fa 25.04/10.86 [2019-03-28 12:13:45,867 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 25.04/10.86 [2019-03-28 12:13:45,869 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 25.04/10.86 [2019-03-28 12:13:45,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 25.04/10.86 [2019-03-28 12:13:45,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 25.04/10.86 [2019-03-28 12:13:45,874 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 25.04/10.86 [2019-03-28 12:13:45,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:13:45" (1/1) ... 25.04/10.86 [2019-03-28 12:13:45,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6faee0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:45, skipping insertion in model container 25.04/10.86 [2019-03-28 12:13:45,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:13:45" (1/1) ... 25.04/10.86 [2019-03-28 12:13:45,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 25.04/10.86 [2019-03-28 12:13:45,905 INFO L176 MainTranslator]: Built tables and reachable declarations 25.04/10.86 [2019-03-28 12:13:46,068 INFO L206 PostProcessor]: Analyzing one entry point: main 25.04/10.86 [2019-03-28 12:13:46,081 INFO L191 MainTranslator]: Completed pre-run 25.04/10.86 [2019-03-28 12:13:46,158 INFO L206 PostProcessor]: Analyzing one entry point: main 25.04/10.86 [2019-03-28 12:13:46,174 INFO L195 MainTranslator]: Completed translation 25.04/10.86 [2019-03-28 12:13:46,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46 WrapperNode 25.04/10.86 [2019-03-28 12:13:46,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 25.04/10.86 [2019-03-28 12:13:46,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 25.04/10.86 [2019-03-28 12:13:46,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 25.04/10.86 [2019-03-28 12:13:46,176 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 25.04/10.86 [2019-03-28 12:13:46,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46" (1/1) ... 25.04/10.86 [2019-03-28 12:13:46,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46" (1/1) ... 25.04/10.86 [2019-03-28 12:13:46,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 25.04/10.86 [2019-03-28 12:13:46,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 25.04/10.86 [2019-03-28 12:13:46,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 25.04/10.86 [2019-03-28 12:13:46,216 INFO L276 PluginConnector]: Boogie Preprocessor initialized 25.04/10.86 [2019-03-28 12:13:46,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46" (1/1) ... 25.04/10.86 [2019-03-28 12:13:46,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46" (1/1) ... 25.04/10.86 [2019-03-28 12:13:46,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46" (1/1) ... 25.04/10.86 [2019-03-28 12:13:46,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46" (1/1) ... 25.04/10.86 [2019-03-28 12:13:46,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46" (1/1) ... 25.04/10.86 [2019-03-28 12:13:46,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46" (1/1) ... 25.04/10.86 [2019-03-28 12:13:46,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46" (1/1) ... 25.04/10.86 [2019-03-28 12:13:46,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 25.04/10.86 [2019-03-28 12:13:46,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 25.04/10.86 [2019-03-28 12:13:46,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... 25.04/10.86 [2019-03-28 12:13:46,237 INFO L276 PluginConnector]: RCFGBuilder initialized 25.04/10.86 [2019-03-28 12:13:46,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46" (1/1) ... 25.04/10.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.04/10.86 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 25.04/10.86 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.04/10.86 [2019-03-28 12:13:46,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 25.04/10.86 [2019-03-28 12:13:46,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 25.04/10.86 [2019-03-28 12:13:46,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 25.04/10.86 [2019-03-28 12:13:46,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 25.04/10.86 [2019-03-28 12:13:46,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 25.04/10.86 [2019-03-28 12:13:46,301 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec 25.04/10.86 [2019-03-28 12:13:46,301 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec 25.04/10.86 [2019-03-28 12:13:46,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 25.04/10.86 [2019-03-28 12:13:46,486 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 25.04/10.86 [2019-03-28 12:13:46,486 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 25.04/10.86 [2019-03-28 12:13:46,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:13:46 BoogieIcfgContainer 25.04/10.86 [2019-03-28 12:13:46,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 25.04/10.86 [2019-03-28 12:13:46,488 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 25.04/10.86 [2019-03-28 12:13:46,489 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 25.04/10.86 [2019-03-28 12:13:46,491 INFO L276 PluginConnector]: BlockEncodingV2 initialized 25.04/10.86 [2019-03-28 12:13:46,491 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:13:46" (1/1) ... 25.04/10.86 [2019-03-28 12:13:46,510 INFO L313 BlockEncoder]: Initial Icfg 21 locations, 23 edges 25.04/10.86 [2019-03-28 12:13:46,511 INFO L258 BlockEncoder]: Using Remove infeasible edges 25.04/10.86 [2019-03-28 12:13:46,512 INFO L263 BlockEncoder]: Using Maximize final states 25.04/10.86 [2019-03-28 12:13:46,513 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 25.04/10.86 [2019-03-28 12:13:46,513 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 25.04/10.86 [2019-03-28 12:13:46,515 INFO L296 BlockEncoder]: Using Remove sink states 25.04/10.86 [2019-03-28 12:13:46,516 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 25.04/10.86 [2019-03-28 12:13:46,516 INFO L179 BlockEncoder]: Using Rewrite not-equals 25.04/10.86 [2019-03-28 12:13:46,534 INFO L185 BlockEncoder]: Using Use SBE 25.04/10.86 [2019-03-28 12:13:46,554 INFO L200 BlockEncoder]: SBE split 6 edges 25.04/10.86 [2019-03-28 12:13:46,559 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.04/10.86 [2019-03-28 12:13:46,561 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.04/10.86 [2019-03-28 12:13:46,581 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 25.04/10.86 [2019-03-28 12:13:46,583 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states 25.04/10.86 [2019-03-28 12:13:46,585 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.04/10.86 [2019-03-28 12:13:46,586 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.04/10.86 [2019-03-28 12:13:46,586 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 25.04/10.86 [2019-03-28 12:13:46,587 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 25.04/10.86 [2019-03-28 12:13:46,587 INFO L313 BlockEncoder]: Encoded RCFG 16 locations, 24 edges 25.04/10.86 [2019-03-28 12:13:46,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:13:46 BasicIcfg 25.04/10.86 [2019-03-28 12:13:46,588 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 25.04/10.86 [2019-03-28 12:13:46,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 25.04/10.86 [2019-03-28 12:13:46,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... 25.04/10.86 [2019-03-28 12:13:46,592 INFO L276 PluginConnector]: TraceAbstraction initialized 25.04/10.86 [2019-03-28 12:13:46,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:13:45" (1/4) ... 25.04/10.86 [2019-03-28 12:13:46,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb91b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:13:46, skipping insertion in model container 25.04/10.86 [2019-03-28 12:13:46,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46" (2/4) ... 25.04/10.86 [2019-03-28 12:13:46,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb91b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:13:46, skipping insertion in model container 25.04/10.86 [2019-03-28 12:13:46,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:13:46" (3/4) ... 25.04/10.86 [2019-03-28 12:13:46,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb91b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:13:46, skipping insertion in model container 25.04/10.86 [2019-03-28 12:13:46,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:13:46" (4/4) ... 25.04/10.86 [2019-03-28 12:13:46,597 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.04/10.86 [2019-03-28 12:13:46,606 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 25.04/10.86 [2019-03-28 12:13:46,614 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. 25.04/10.86 [2019-03-28 12:13:46,631 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. 25.04/10.86 [2019-03-28 12:13:46,660 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.04/10.86 [2019-03-28 12:13:46,661 INFO L382 AbstractCegarLoop]: Interprodecural is true 25.04/10.86 [2019-03-28 12:13:46,661 INFO L383 AbstractCegarLoop]: Hoare is true 25.04/10.86 [2019-03-28 12:13:46,661 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 25.04/10.86 [2019-03-28 12:13:46,662 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 25.04/10.86 [2019-03-28 12:13:46,662 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.04/10.86 [2019-03-28 12:13:46,662 INFO L387 AbstractCegarLoop]: Difference is false 25.04/10.86 [2019-03-28 12:13:46,662 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 25.04/10.86 [2019-03-28 12:13:46,663 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 25.04/10.86 [2019-03-28 12:13:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. 25.04/10.86 [2019-03-28 12:13:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 25.04/10.86 [2019-03-28 12:13:46,684 INFO L394 BasicCegarLoop]: Found error trace 25.04/10.86 [2019-03-28 12:13:46,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 25.04/10.86 [2019-03-28 12:13:46,685 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== 25.04/10.86 [2019-03-28 12:13:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.86 [2019-03-28 12:13:46,690 INFO L82 PathProgramCache]: Analyzing trace with hash 3208906, now seen corresponding path program 1 times 25.04/10.86 [2019-03-28 12:13:46,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.04/10.86 [2019-03-28 12:13:46,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.04/10.86 [2019-03-28 12:13:46,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:46,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:46,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.86 [2019-03-28 12:13:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.04/10.86 [2019-03-28 12:13:46,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.04/10.86 [2019-03-28 12:13:46,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.04/10.86 [2019-03-28 12:13:46,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.04/10.86 [2019-03-28 12:13:46,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.04/10.86 [2019-03-28 12:13:46,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.04/10.86 [2019-03-28 12:13:46,875 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. 25.04/10.86 [2019-03-28 12:13:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.04/10.86 [2019-03-28 12:13:46,967 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. 25.04/10.86 [2019-03-28 12:13:46,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.04/10.86 [2019-03-28 12:13:46,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 25.04/10.86 [2019-03-28 12:13:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.04/10.86 [2019-03-28 12:13:46,979 INFO L225 Difference]: With dead ends: 16 25.04/10.86 [2019-03-28 12:13:46,979 INFO L226 Difference]: Without dead ends: 12 25.04/10.86 [2019-03-28 12:13:46,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.04/10.86 [2019-03-28 12:13:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. 25.04/10.86 [2019-03-28 12:13:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 25.04/10.86 [2019-03-28 12:13:47,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 25.04/10.86 [2019-03-28 12:13:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. 25.04/10.86 [2019-03-28 12:13:47,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 4 25.04/10.86 [2019-03-28 12:13:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. 25.04/10.86 [2019-03-28 12:13:47,021 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 18 transitions. 25.04/10.86 [2019-03-28 12:13:47,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.04/10.86 [2019-03-28 12:13:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. 25.04/10.86 [2019-03-28 12:13:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 25.04/10.86 [2019-03-28 12:13:47,022 INFO L394 BasicCegarLoop]: Found error trace 25.04/10.86 [2019-03-28 12:13:47,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 25.04/10.86 [2019-03-28 12:13:47,022 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== 25.04/10.86 [2019-03-28 12:13:47,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.86 [2019-03-28 12:13:47,022 INFO L82 PathProgramCache]: Analyzing trace with hash 3208908, now seen corresponding path program 1 times 25.04/10.86 [2019-03-28 12:13:47,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.04/10.86 [2019-03-28 12:13:47,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.04/10.86 [2019-03-28 12:13:47,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.86 [2019-03-28 12:13:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.04/10.86 [2019-03-28 12:13:47,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.04/10.86 [2019-03-28 12:13:47,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.04/10.86 [2019-03-28 12:13:47,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.04/10.86 [2019-03-28 12:13:47,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.04/10.86 [2019-03-28 12:13:47,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.04/10.86 [2019-03-28 12:13:47,059 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. Second operand 4 states. 25.04/10.86 [2019-03-28 12:13:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.04/10.86 [2019-03-28 12:13:47,107 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. 25.04/10.86 [2019-03-28 12:13:47,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.04/10.86 [2019-03-28 12:13:47,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 25.04/10.86 [2019-03-28 12:13:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.04/10.86 [2019-03-28 12:13:47,108 INFO L225 Difference]: With dead ends: 13 25.04/10.86 [2019-03-28 12:13:47,109 INFO L226 Difference]: Without dead ends: 12 25.04/10.86 [2019-03-28 12:13:47,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.04/10.86 [2019-03-28 12:13:47,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. 25.04/10.86 [2019-03-28 12:13:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 25.04/10.86 [2019-03-28 12:13:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 25.04/10.86 [2019-03-28 12:13:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. 25.04/10.86 [2019-03-28 12:13:47,113 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 4 25.04/10.86 [2019-03-28 12:13:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. 25.04/10.86 [2019-03-28 12:13:47,113 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. 25.04/10.86 [2019-03-28 12:13:47,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.04/10.86 [2019-03-28 12:13:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. 25.04/10.86 [2019-03-28 12:13:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 25.04/10.86 [2019-03-28 12:13:47,114 INFO L394 BasicCegarLoop]: Found error trace 25.04/10.86 [2019-03-28 12:13:47,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 25.04/10.86 [2019-03-28 12:13:47,115 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== 25.04/10.86 [2019-03-28 12:13:47,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.86 [2019-03-28 12:13:47,115 INFO L82 PathProgramCache]: Analyzing trace with hash 3208909, now seen corresponding path program 1 times 25.04/10.86 [2019-03-28 12:13:47,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.04/10.86 [2019-03-28 12:13:47,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.04/10.86 [2019-03-28 12:13:47,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.86 [2019-03-28 12:13:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.04/10.86 [2019-03-28 12:13:47,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.04/10.86 [2019-03-28 12:13:47,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.04/10.86 [2019-03-28 12:13:47,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.04/10.86 [2019-03-28 12:13:47,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.04/10.86 [2019-03-28 12:13:47,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.04/10.86 [2019-03-28 12:13:47,150 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 3 states. 25.04/10.86 [2019-03-28 12:13:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.04/10.86 [2019-03-28 12:13:47,182 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. 25.04/10.86 [2019-03-28 12:13:47,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.04/10.86 [2019-03-28 12:13:47,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 25.04/10.86 [2019-03-28 12:13:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.04/10.86 [2019-03-28 12:13:47,183 INFO L225 Difference]: With dead ends: 12 25.04/10.86 [2019-03-28 12:13:47,183 INFO L226 Difference]: Without dead ends: 11 25.04/10.86 [2019-03-28 12:13:47,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.04/10.86 [2019-03-28 12:13:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. 25.04/10.86 [2019-03-28 12:13:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 25.04/10.86 [2019-03-28 12:13:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 25.04/10.86 [2019-03-28 12:13:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. 25.04/10.86 [2019-03-28 12:13:47,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 4 25.04/10.86 [2019-03-28 12:13:47,187 INFO L84 Accepts]: Finished accepts. word is rejected. 25.04/10.86 [2019-03-28 12:13:47,187 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 16 transitions. 25.04/10.86 [2019-03-28 12:13:47,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.04/10.86 [2019-03-28 12:13:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. 25.04/10.86 [2019-03-28 12:13:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 25.04/10.86 [2019-03-28 12:13:47,188 INFO L394 BasicCegarLoop]: Found error trace 25.04/10.86 [2019-03-28 12:13:47,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 25.04/10.86 [2019-03-28 12:13:47,188 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== 25.04/10.86 [2019-03-28 12:13:47,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.86 [2019-03-28 12:13:47,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1106378170, now seen corresponding path program 1 times 25.04/10.86 [2019-03-28 12:13:47,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.04/10.86 [2019-03-28 12:13:47,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.04/10.86 [2019-03-28 12:13:47,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.86 [2019-03-28 12:13:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.04/10.86 [2019-03-28 12:13:47,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.04/10.86 [2019-03-28 12:13:47,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.04/10.86 [2019-03-28 12:13:47,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 25.04/10.86 [2019-03-28 12:13:47,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.04/10.86 [2019-03-28 12:13:47,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 25.04/10.86 [2019-03-28 12:13:47,233 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 5 states. 25.04/10.86 [2019-03-28 12:13:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.04/10.86 [2019-03-28 12:13:47,291 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. 25.04/10.86 [2019-03-28 12:13:47,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 25.04/10.86 [2019-03-28 12:13:47,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 25.04/10.86 [2019-03-28 12:13:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.04/10.86 [2019-03-28 12:13:47,292 INFO L225 Difference]: With dead ends: 11 25.04/10.86 [2019-03-28 12:13:47,292 INFO L226 Difference]: Without dead ends: 10 25.04/10.86 [2019-03-28 12:13:47,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 25.04/10.86 [2019-03-28 12:13:47,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. 25.04/10.86 [2019-03-28 12:13:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 25.04/10.86 [2019-03-28 12:13:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 25.04/10.86 [2019-03-28 12:13:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. 25.04/10.86 [2019-03-28 12:13:47,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 7 25.04/10.86 [2019-03-28 12:13:47,296 INFO L84 Accepts]: Finished accepts. word is rejected. 25.04/10.86 [2019-03-28 12:13:47,296 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. 25.04/10.86 [2019-03-28 12:13:47,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 25.04/10.86 [2019-03-28 12:13:47,297 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. 25.04/10.86 [2019-03-28 12:13:47,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 25.04/10.86 [2019-03-28 12:13:47,297 INFO L394 BasicCegarLoop]: Found error trace 25.04/10.86 [2019-03-28 12:13:47,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 25.04/10.86 [2019-03-28 12:13:47,297 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== 25.04/10.86 [2019-03-28 12:13:47,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.86 [2019-03-28 12:13:47,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1106378172, now seen corresponding path program 1 times 25.04/10.86 [2019-03-28 12:13:47,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.04/10.86 [2019-03-28 12:13:47,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.04/10.86 [2019-03-28 12:13:47,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.86 [2019-03-28 12:13:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.04/10.86 [2019-03-28 12:13:47,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.04/10.86 [2019-03-28 12:13:47,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 25.04/10.86 [2019-03-28 12:13:47,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 25.04/10.86 [2019-03-28 12:13:47,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 25.04/10.86 [2019-03-28 12:13:47,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 25.04/10.86 [2019-03-28 12:13:47,395 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 7 states. 25.04/10.86 [2019-03-28 12:13:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.04/10.86 [2019-03-28 12:13:47,480 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. 25.04/10.86 [2019-03-28 12:13:47,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 25.04/10.86 [2019-03-28 12:13:47,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 25.04/10.86 [2019-03-28 12:13:47,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.04/10.86 [2019-03-28 12:13:47,481 INFO L225 Difference]: With dead ends: 15 25.04/10.86 [2019-03-28 12:13:47,482 INFO L226 Difference]: Without dead ends: 14 25.04/10.86 [2019-03-28 12:13:47,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 25.04/10.86 [2019-03-28 12:13:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 25.04/10.86 [2019-03-28 12:13:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. 25.04/10.86 [2019-03-28 12:13:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 25.04/10.86 [2019-03-28 12:13:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. 25.04/10.86 [2019-03-28 12:13:47,487 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 25.04/10.86 [2019-03-28 12:13:47,488 INFO L84 Accepts]: Finished accepts. word is rejected. 25.04/10.86 [2019-03-28 12:13:47,488 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. 25.04/10.86 [2019-03-28 12:13:47,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 25.04/10.86 [2019-03-28 12:13:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. 25.04/10.86 [2019-03-28 12:13:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 25.04/10.86 [2019-03-28 12:13:47,489 INFO L394 BasicCegarLoop]: Found error trace 25.04/10.86 [2019-03-28 12:13:47,489 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.04/10.86 [2019-03-28 12:13:47,489 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== 25.04/10.86 [2019-03-28 12:13:47,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.86 [2019-03-28 12:13:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash -678559379, now seen corresponding path program 1 times 25.04/10.86 [2019-03-28 12:13:47,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.04/10.86 [2019-03-28 12:13:47,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.04/10.86 [2019-03-28 12:13:47,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.86 [2019-03-28 12:13:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.04/10.86 [2019-03-28 12:13:47,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.04/10.86 [2019-03-28 12:13:47,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 25.04/10.86 [2019-03-28 12:13:47,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 25.04/10.86 [2019-03-28 12:13:47,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 25.04/10.86 [2019-03-28 12:13:47,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 25.04/10.86 [2019-03-28 12:13:47,619 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 8 states. 25.04/10.86 [2019-03-28 12:13:47,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.04/10.86 [2019-03-28 12:13:47,749 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. 25.04/10.86 [2019-03-28 12:13:47,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 25.04/10.86 [2019-03-28 12:13:47,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 25.04/10.86 [2019-03-28 12:13:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.04/10.86 [2019-03-28 12:13:47,750 INFO L225 Difference]: With dead ends: 23 25.04/10.86 [2019-03-28 12:13:47,750 INFO L226 Difference]: Without dead ends: 12 25.04/10.86 [2019-03-28 12:13:47,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 25.04/10.86 [2019-03-28 12:13:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. 25.04/10.86 [2019-03-28 12:13:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 25.04/10.86 [2019-03-28 12:13:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 25.04/10.86 [2019-03-28 12:13:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. 25.04/10.86 [2019-03-28 12:13:47,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 11 25.04/10.86 [2019-03-28 12:13:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. 25.04/10.86 [2019-03-28 12:13:47,755 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. 25.04/10.86 [2019-03-28 12:13:47,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 25.04/10.86 [2019-03-28 12:13:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. 25.04/10.86 [2019-03-28 12:13:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 25.04/10.86 [2019-03-28 12:13:47,756 INFO L394 BasicCegarLoop]: Found error trace 25.04/10.86 [2019-03-28 12:13:47,756 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.04/10.86 [2019-03-28 12:13:47,756 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== 25.04/10.86 [2019-03-28 12:13:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.86 [2019-03-28 12:13:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1661126904, now seen corresponding path program 1 times 25.04/10.86 [2019-03-28 12:13:47,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.04/10.86 [2019-03-28 12:13:47,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.04/10.86 [2019-03-28 12:13:47,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.86 [2019-03-28 12:13:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.04/10.86 [2019-03-28 12:13:47,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.04/10.86 [2019-03-28 12:13:47,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.04/10.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.04/10.86 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.04/10.86 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.04/10.86 [2019-03-28 12:13:48,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.86 [2019-03-28 12:13:48,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 22 conjunts are in the unsatisfiable core 25.04/10.86 [2019-03-28 12:13:48,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.04/10.86 [2019-03-28 12:13:48,087 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 25.04/10.86 [2019-03-28 12:13:48,087 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.04/10.86 [2019-03-28 12:13:48,094 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.04/10.86 [2019-03-28 12:13:48,094 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 25.04/10.86 [2019-03-28 12:13:48,094 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 25.04/10.86 [2019-03-28 12:13:48,118 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 25.04/10.86 [2019-03-28 12:13:48,118 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.04/10.86 [2019-03-28 12:13:48,122 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.04/10.86 [2019-03-28 12:13:48,122 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 25.04/10.86 [2019-03-28 12:13:48,123 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 25.04/10.86 [2019-03-28 12:13:48,208 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 25.04/10.86 [2019-03-28 12:13:48,209 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 25.04/10.86 [2019-03-28 12:13:48,213 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 25.04/10.86 [2019-03-28 12:13:48,221 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.04/10.86 [2019-03-28 12:13:48,222 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 25.04/10.86 [2019-03-28 12:13:48,223 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 25.04/10.86 [2019-03-28 12:13:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.04/10.86 [2019-03-28 12:13:48,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.04/10.86 [2019-03-28 12:13:48,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 25.04/10.86 [2019-03-28 12:13:48,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 25.04/10.86 [2019-03-28 12:13:48,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 25.04/10.86 [2019-03-28 12:13:48,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 25.04/10.86 [2019-03-28 12:13:48,331 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 17 states. 25.04/10.86 [2019-03-28 12:13:48,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.04/10.86 [2019-03-28 12:13:48,934 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. 25.04/10.86 [2019-03-28 12:13:48,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 25.04/10.86 [2019-03-28 12:13:48,935 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 11 25.04/10.86 [2019-03-28 12:13:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.04/10.86 [2019-03-28 12:13:48,936 INFO L225 Difference]: With dead ends: 22 25.04/10.86 [2019-03-28 12:13:48,936 INFO L226 Difference]: Without dead ends: 21 25.04/10.86 [2019-03-28 12:13:48,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 25.04/10.86 [2019-03-28 12:13:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 25.04/10.86 [2019-03-28 12:13:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. 25.04/10.86 [2019-03-28 12:13:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 25.04/10.86 [2019-03-28 12:13:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. 25.04/10.86 [2019-03-28 12:13:48,941 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 11 25.04/10.86 [2019-03-28 12:13:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. 25.04/10.86 [2019-03-28 12:13:48,941 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. 25.04/10.86 [2019-03-28 12:13:48,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 25.04/10.86 [2019-03-28 12:13:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. 25.04/10.86 [2019-03-28 12:13:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 25.04/10.86 [2019-03-28 12:13:48,942 INFO L394 BasicCegarLoop]: Found error trace 25.04/10.86 [2019-03-28 12:13:48,942 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.04/10.86 [2019-03-28 12:13:48,943 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== 25.04/10.86 [2019-03-28 12:13:48,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.86 [2019-03-28 12:13:48,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1661126903, now seen corresponding path program 1 times 25.04/10.86 [2019-03-28 12:13:48,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.04/10.86 [2019-03-28 12:13:48,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.04/10.86 [2019-03-28 12:13:48,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:48,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:48,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.86 [2019-03-28 12:13:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.04/10.86 [2019-03-28 12:13:48,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.04/10.86 [2019-03-28 12:13:48,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.04/10.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.04/10.86 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.04/10.86 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.04/10.86 [2019-03-28 12:13:49,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.86 [2019-03-28 12:13:49,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core 25.04/10.86 [2019-03-28 12:13:49,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.04/10.86 [2019-03-28 12:13:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.04/10.86 [2019-03-28 12:13:49,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 25.04/10.86 [2019-03-28 12:13:49,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 25.04/10.86 [2019-03-28 12:13:49,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 25.04/10.86 [2019-03-28 12:13:49,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 25.04/10.86 [2019-03-28 12:13:49,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 25.04/10.86 [2019-03-28 12:13:49,062 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 8 states. 25.04/10.86 [2019-03-28 12:13:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.04/10.86 [2019-03-28 12:13:49,122 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. 25.04/10.86 [2019-03-28 12:13:49,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 25.04/10.86 [2019-03-28 12:13:49,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 25.04/10.86 [2019-03-28 12:13:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.04/10.86 [2019-03-28 12:13:49,124 INFO L225 Difference]: With dead ends: 18 25.04/10.86 [2019-03-28 12:13:49,124 INFO L226 Difference]: Without dead ends: 17 25.04/10.86 [2019-03-28 12:13:49,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 25.04/10.86 [2019-03-28 12:13:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 25.04/10.86 [2019-03-28 12:13:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. 25.04/10.86 [2019-03-28 12:13:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 25.04/10.86 [2019-03-28 12:13:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. 25.04/10.86 [2019-03-28 12:13:49,128 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 25.04/10.86 [2019-03-28 12:13:49,128 INFO L84 Accepts]: Finished accepts. word is rejected. 25.04/10.86 [2019-03-28 12:13:49,129 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. 25.04/10.86 [2019-03-28 12:13:49,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 25.04/10.86 [2019-03-28 12:13:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. 25.04/10.86 [2019-03-28 12:13:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 25.04/10.86 [2019-03-28 12:13:49,129 INFO L394 BasicCegarLoop]: Found error trace 25.04/10.86 [2019-03-28 12:13:49,130 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 25.04/10.86 [2019-03-28 12:13:49,130 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== 25.04/10.86 [2019-03-28 12:13:49,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.86 [2019-03-28 12:13:49,130 INFO L82 PathProgramCache]: Analyzing trace with hash -595318504, now seen corresponding path program 1 times 25.04/10.86 [2019-03-28 12:13:49,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.04/10.86 [2019-03-28 12:13:49,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.04/10.86 [2019-03-28 12:13:49,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:49,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:49,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.86 [2019-03-28 12:13:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.04/10.86 [2019-03-28 12:13:49,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 25.04/10.86 [2019-03-28 12:13:49,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.04/10.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.04/10.86 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 25.04/10.86 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 25.04/10.86 [2019-03-28 12:13:49,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.86 [2019-03-28 12:13:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.86 [2019-03-28 12:13:49,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 26 conjunts are in the unsatisfiable core 25.04/10.86 [2019-03-28 12:13:49,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.04/10.86 [2019-03-28 12:13:49,430 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 25.04/10.86 [2019-03-28 12:13:49,431 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.04/10.86 [2019-03-28 12:13:49,434 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.04/10.86 [2019-03-28 12:13:49,435 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 25.04/10.86 [2019-03-28 12:13:49,435 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 25.04/10.86 [2019-03-28 12:13:49,439 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 25.04/10.86 [2019-03-28 12:13:49,439 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.04/10.86 [2019-03-28 12:13:49,441 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.04/10.86 [2019-03-28 12:13:49,441 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 25.04/10.86 [2019-03-28 12:13:49,442 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 25.04/10.86 [2019-03-28 12:13:49,502 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 25.04/10.86 [2019-03-28 12:13:49,503 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 25.04/10.86 [2019-03-28 12:13:49,504 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 25.04/10.86 [2019-03-28 12:13:49,511 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.04/10.86 [2019-03-28 12:13:49,511 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 25.04/10.86 [2019-03-28 12:13:49,511 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 25.04/10.86 [2019-03-28 12:13:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 25.04/10.86 [2019-03-28 12:13:49,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 25.04/10.86 [2019-03-28 12:13:49,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 25.04/10.86 [2019-03-28 12:13:49,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states 25.04/10.86 [2019-03-28 12:13:49,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 25.04/10.86 [2019-03-28 12:13:49,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 25.04/10.86 [2019-03-28 12:13:49,582 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 16 states. 25.04/10.86 [2019-03-28 12:13:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.04/10.86 [2019-03-28 12:13:50,491 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. 25.04/10.86 [2019-03-28 12:13:50,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 25.04/10.86 [2019-03-28 12:13:50,491 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 25.04/10.86 [2019-03-28 12:13:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.04/10.86 [2019-03-28 12:13:50,492 INFO L225 Difference]: With dead ends: 33 25.04/10.86 [2019-03-28 12:13:50,492 INFO L226 Difference]: Without dead ends: 0 25.04/10.86 [2019-03-28 12:13:50,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=279, Invalid=1127, Unknown=0, NotChecked=0, Total=1406 25.04/10.86 [2019-03-28 12:13:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 25.04/10.86 [2019-03-28 12:13:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 25.04/10.86 [2019-03-28 12:13:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 25.04/10.86 [2019-03-28 12:13:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 25.04/10.86 [2019-03-28 12:13:50,494 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 25.04/10.86 [2019-03-28 12:13:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. 25.04/10.86 [2019-03-28 12:13:50,495 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 25.04/10.86 [2019-03-28 12:13:50,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. 25.04/10.86 [2019-03-28 12:13:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 25.04/10.86 [2019-03-28 12:13:50,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 25.04/10.86 [2019-03-28 12:13:50,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 25.04/10.86 [2019-03-28 12:13:50,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:50,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 25.04/10.86 [2019-03-28 12:13:51,154 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 55 25.04/10.86 [2019-03-28 12:13:51,158 INFO L444 ceAbstractionStarter]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (and (<= 1 ULTIMATE.start_main_~length1~0) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= ULTIMATE.start_main_~nondetString1~0.offset 0) (= ULTIMATE.start_main_~length1~0 .cse0) (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse0 (- 1))) 0))) 25.04/10.86 [2019-03-28 12:13:51,158 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. 25.04/10.86 [2019-03-28 12:13:51,158 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 25.04/10.86 [2019-03-28 12:13:51,158 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 16) no Hoare annotation was computed. 25.04/10.86 [2019-03-28 12:13:51,158 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 25.04/10.86 [2019-03-28 12:13:51,158 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 25.04/10.86 [2019-03-28 12:13:51,158 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 25.04/10.86 [2019-03-28 12:13:51,159 INFO L448 ceAbstractionStarter]: For program point strlen_recFINAL(lines 5 10) no Hoare annotation was computed. 25.04/10.86 [2019-03-28 12:13:51,159 INFO L444 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: (let ((.cse6 (select |#length| strlen_rec_~p.base)) (.cse3 (select |#memory_int| |strlen_rec_#in~p.base|)) (.cse4 (select |#length| |strlen_rec_#in~p.base|))) (let ((.cse0 (not (= |strlen_rec_#in~p.offset| 0))) (.cse1 (not (= (select |#valid| |strlen_rec_#in~p.base|) 1))) (.cse5 (not (= (select .cse3 (+ .cse4 (- 1))) 0))) (.cse2 (not (<= 1 .cse4))) (.cse8 (= 1 (select |#valid| strlen_rec_~p.base))) (.cse7 (= (select (select |#memory_int| strlen_rec_~p.base) (+ .cse6 (- 1))) 0))) (and (or .cse0 .cse1 .cse2 (not (= 0 (select .cse3 |strlen_rec_#in~p.offset|)))) (or (not (<= (+ |strlen_rec_#in~p.offset| 1) .cse4)) .cse1 (not (<= 1 |strlen_rec_#in~p.offset|)) .cse5 (and (<= (+ strlen_rec_~p.offset 2) .cse6) (<= 1 strlen_rec_~p.offset) .cse7 .cse8)) (or .cse0 .cse1 .cse5 .cse2 (and (and (= 0 strlen_rec_~p.offset) (let ((.cse9 (+ strlen_rec_~p.offset 1))) (and (not (= .cse6 .cse9)) (<= .cse9 .cse6) .cse8))) .cse7))))) 25.04/10.87 [2019-03-28 12:13:51,159 INFO L451 ceAbstractionStarter]: At program point strlen_recENTRY(lines 5 10) the Hoare annotation is: true 25.04/10.87 [2019-03-28 12:13:51,159 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. 25.04/10.87 [2019-03-28 12:13:51,159 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. 25.04/10.87 [2019-03-28 12:13:51,160 INFO L448 ceAbstractionStarter]: For program point L6-1(lines 6 9) no Hoare annotation was computed. 25.04/10.87 [2019-03-28 12:13:51,160 INFO L448 ceAbstractionStarter]: For program point strlen_recErr0REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. 25.04/10.87 [2019-03-28 12:13:51,160 INFO L448 ceAbstractionStarter]: For program point strlen_recEXIT(lines 5 10) no Hoare annotation was computed. 25.04/10.87 [2019-03-28 12:13:51,160 INFO L448 ceAbstractionStarter]: For program point strlen_recErr1REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. 25.04/10.87 [2019-03-28 12:13:51,160 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 25.04/10.87 [2019-03-28 12:13:51,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:13:51 BasicIcfg 25.04/10.87 [2019-03-28 12:13:51,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 25.04/10.87 [2019-03-28 12:13:51,164 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 25.04/10.87 [2019-03-28 12:13:51,164 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 25.04/10.87 [2019-03-28 12:13:51,167 INFO L276 PluginConnector]: BuchiAutomizer initialized 25.04/10.87 [2019-03-28 12:13:51,168 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.04/10.87 [2019-03-28 12:13:51,168 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:13:45" (1/5) ... 25.04/10.87 [2019-03-28 12:13:51,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ff14106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:13:51, skipping insertion in model container 25.04/10.87 [2019-03-28 12:13:51,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.04/10.87 [2019-03-28 12:13:51,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:13:46" (2/5) ... 25.04/10.87 [2019-03-28 12:13:51,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ff14106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:13:51, skipping insertion in model container 25.04/10.87 [2019-03-28 12:13:51,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.04/10.87 [2019-03-28 12:13:51,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:13:46" (3/5) ... 25.04/10.87 [2019-03-28 12:13:51,170 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ff14106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:13:51, skipping insertion in model container 25.04/10.87 [2019-03-28 12:13:51,170 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.04/10.87 [2019-03-28 12:13:51,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:13:46" (4/5) ... 25.04/10.87 [2019-03-28 12:13:51,170 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ff14106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:13:51, skipping insertion in model container 25.04/10.87 [2019-03-28 12:13:51,171 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.04/10.87 [2019-03-28 12:13:51,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:13:51" (5/5) ... 25.04/10.87 [2019-03-28 12:13:51,172 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.04/10.87 [2019-03-28 12:13:51,194 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.04/10.87 [2019-03-28 12:13:51,194 INFO L374 BuchiCegarLoop]: Interprodecural is true 25.04/10.87 [2019-03-28 12:13:51,195 INFO L375 BuchiCegarLoop]: Hoare is true 25.04/10.87 [2019-03-28 12:13:51,195 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 25.04/10.87 [2019-03-28 12:13:51,195 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 25.04/10.87 [2019-03-28 12:13:51,195 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.04/10.87 [2019-03-28 12:13:51,195 INFO L379 BuchiCegarLoop]: Difference is false 25.04/10.87 [2019-03-28 12:13:51,195 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 25.04/10.87 [2019-03-28 12:13:51,195 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 25.04/10.87 [2019-03-28 12:13:51,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. 25.04/10.87 [2019-03-28 12:13:51,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 25.04/10.87 [2019-03-28 12:13:51,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.04/10.87 [2019-03-28 12:13:51,205 INFO L119 BuchiIsEmpty]: Starting construction of run 25.04/10.87 [2019-03-28 12:13:51,209 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 25.04/10.87 [2019-03-28 12:13:51,210 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 25.04/10.87 [2019-03-28 12:13:51,210 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 25.04/10.87 [2019-03-28 12:13:51,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. 25.04/10.87 [2019-03-28 12:13:51,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 25.04/10.87 [2019-03-28 12:13:51,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.04/10.87 [2019-03-28 12:13:51,212 INFO L119 BuchiIsEmpty]: Starting construction of run 25.04/10.87 [2019-03-28 12:13:51,212 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 25.04/10.87 [2019-03-28 12:13:51,212 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 25.04/10.87 [2019-03-28 12:13:51,218 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue [75] ULTIMATE.startENTRY-->L14: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_12| 0 0) |v_#valid_11|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, #valid=|v_#valid_11|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString1~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 17#L14true [56] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 13#L14-2true [63] L14-2-->L18: Formula: (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc3.offset] 6#L18true [35] L18-->L18-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int] 4#L18-1true [34] L18-1-->strlen_recENTRY: Formula: (and (= |v_strlen_rec_#in~p.baseInParam_1| v_ULTIMATE.start_main_~nondetString1~0.base_7) (= |v_strlen_rec_#in~p.offsetInParam_1| v_ULTIMATE.start_main_~nondetString1~0.offset_6)) InVars {ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7} OutVars{strlen_rec_#in~p.offset=|v_strlen_rec_#in~p.offsetInParam_1|, strlen_rec_#in~p.base=|v_strlen_rec_#in~p.baseInParam_1|} AuxVars[] AssignedVars[strlen_rec_#in~p.offset, strlen_rec_#in~p.base]< 3#strlen_recENTRYtrue 25.04/10.87 [2019-03-28 12:13:51,218 INFO L796 eck$LassoCheckResult]: Loop: 3#strlen_recENTRYtrue [33] strlen_recENTRY-->L6: Formula: (and (= v_strlen_rec_~p.offset_1 |v_strlen_rec_#in~p.offset_1|) (= v_strlen_rec_~p.base_1 |v_strlen_rec_#in~p.base_1|)) InVars {strlen_rec_#in~p.offset=|v_strlen_rec_#in~p.offset_1|, strlen_rec_#in~p.base=|v_strlen_rec_#in~p.base_1|} OutVars{strlen_rec_~p.base=v_strlen_rec_~p.base_1, strlen_rec_#in~p.offset=|v_strlen_rec_#in~p.offset_1|, strlen_rec_~p.offset=v_strlen_rec_~p.offset_1, strlen_rec_#in~p.base=|v_strlen_rec_#in~p.base_1|} AuxVars[] AssignedVars[strlen_rec_~p.offset, strlen_rec_~p.base] 11#L6true [42] L6-->L6-1: Formula: (and (= 1 (select |v_#valid_9| v_strlen_rec_~p.base_2)) (<= (+ v_strlen_rec_~p.offset_2 1) (select |v_#length_5| v_strlen_rec_~p.base_2)) (= |v_strlen_rec_#t~mem0_1| (select (select |v_#memory_int_3| v_strlen_rec_~p.base_2) v_strlen_rec_~p.offset_2)) (<= 0 v_strlen_rec_~p.offset_2)) InVars {#memory_int=|v_#memory_int_3|, strlen_rec_~p.base=v_strlen_rec_~p.base_2, #length=|v_#length_5|, strlen_rec_~p.offset=v_strlen_rec_~p.offset_2, #valid=|v_#valid_9|} OutVars{strlen_rec_#t~mem0=|v_strlen_rec_#t~mem0_1|, strlen_rec_~p.offset=v_strlen_rec_~p.offset_2, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, strlen_rec_~p.base=v_strlen_rec_~p.base_2, #length=|v_#length_5|} AuxVars[] AssignedVars[strlen_rec_#t~mem0] 12#L6-1true [73] L6-1-->L9: Formula: (> |v_strlen_rec_#t~mem0_5| 0) InVars {strlen_rec_#t~mem0=|v_strlen_rec_#t~mem0_5|} OutVars{strlen_rec_#t~mem0=|v_strlen_rec_#t~mem0_4|} AuxVars[] AssignedVars[strlen_rec_#t~mem0] 15#L9true [49] L9-->strlen_recENTRY: Formula: (and (= |v_strlen_rec_#in~p.baseInParam_2| v_strlen_rec_~p.base_6) (= |v_strlen_rec_#in~p.offsetInParam_2| (+ v_strlen_rec_~p.offset_5 1))) InVars {strlen_rec_~p.offset=v_strlen_rec_~p.offset_5, strlen_rec_~p.base=v_strlen_rec_~p.base_6} OutVars{strlen_rec_#in~p.offset=|v_strlen_rec_#in~p.offsetInParam_2|, strlen_rec_#in~p.base=|v_strlen_rec_#in~p.baseInParam_2|} AuxVars[] AssignedVars[strlen_rec_#in~p.offset, strlen_rec_#in~p.base]< 3#strlen_recENTRYtrue 25.04/10.87 [2019-03-28 12:13:51,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.87 [2019-03-28 12:13:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash 99623184, now seen corresponding path program 1 times 25.04/10.87 [2019-03-28 12:13:51,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.04/10.87 [2019-03-28 12:13:51,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.04/10.87 [2019-03-28 12:13:51,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.87 [2019-03-28 12:13:51,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.87 [2019-03-28 12:13:51,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.87 [2019-03-28 12:13:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.04/10.87 [2019-03-28 12:13:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.04/10.87 [2019-03-28 12:13:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.87 [2019-03-28 12:13:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1949298, now seen corresponding path program 1 times 25.04/10.87 [2019-03-28 12:13:51,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.04/10.87 [2019-03-28 12:13:51,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.04/10.87 [2019-03-28 12:13:51,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.87 [2019-03-28 12:13:51,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.87 [2019-03-28 12:13:51,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.87 [2019-03-28 12:13:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.04/10.87 [2019-03-28 12:13:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.04/10.87 [2019-03-28 12:13:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.87 [2019-03-28 12:13:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1609089025, now seen corresponding path program 1 times 25.04/10.87 [2019-03-28 12:13:51,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.04/10.87 [2019-03-28 12:13:51,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.04/10.87 [2019-03-28 12:13:51,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.87 [2019-03-28 12:13:51,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.04/10.87 [2019-03-28 12:13:51,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.04/10.87 [2019-03-28 12:13:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.04/10.87 [2019-03-28 12:13:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.04/10.87 [2019-03-28 12:13:51,574 INFO L216 LassoAnalysis]: Preferences: 25.04/10.87 [2019-03-28 12:13:51,576 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.04/10.87 [2019-03-28 12:13:51,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.04/10.87 [2019-03-28 12:13:51,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.04/10.87 [2019-03-28 12:13:51,577 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.04/10.87 [2019-03-28 12:13:51,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.04/10.87 [2019-03-28 12:13:51,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.04/10.87 [2019-03-28 12:13:51,577 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.04/10.87 [2019-03-28 12:13:51,577 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 25.04/10.87 [2019-03-28 12:13:51,577 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.04/10.87 [2019-03-28 12:13:51,578 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.04/10.87 [2019-03-28 12:13:51,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.04/10.87 [2019-03-28 12:13:51,858 INFO L300 LassoAnalysis]: Preprocessing complete. 25.04/10.87 [2019-03-28 12:13:51,864 INFO L497 LassoAnalysis]: Using template 'affine'. 25.04/10.87 [2019-03-28 12:13:51,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.04/10.87 Termination analysis: LINEAR_WITH_GUESSES 25.04/10.87 Number of strict supporting invariants: 0 25.04/10.87 Number of non-strict supporting invariants: 1 25.04/10.87 Consider only non-deceasing supporting invariants: true 25.04/10.87 Simplify termination arguments: true 25.04/10.87 Simplify supporting invariants: trueOverapproximate stem: false 25.04/10.87 [2019-03-28 12:13:51,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.04/10.87 [2019-03-28 12:13:51,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.04/10.87 [2019-03-28 12:13:51,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.04/10.87 [2019-03-28 12:13:51,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.04/10.87 [2019-03-28 12:13:51,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.04/10.87 [2019-03-28 12:13:51,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.04/10.87 [2019-03-28 12:13:51,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.04/10.87 [2019-03-28 12:13:51,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.04/10.87 [2019-03-28 12:13:51,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.04/10.87 Termination analysis: LINEAR_WITH_GUESSES 25.04/10.87 Number of strict supporting invariants: 0 25.04/10.87 Number of non-strict supporting invariants: 1 25.04/10.87 Consider only non-deceasing supporting invariants: true 25.04/10.87 Simplify termination arguments: true 25.04/10.87 Simplify supporting invariants: trueOverapproximate stem: false 25.04/10.87 [2019-03-28 12:13:51,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.04/10.87 [2019-03-28 12:13:51,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.04/10.87 [2019-03-28 12:13:51,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.04/10.87 [2019-03-28 12:13:51,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.04/10.87 [2019-03-28 12:13:51,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.04/10.87 [2019-03-28 12:13:51,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.04/10.87 [2019-03-28 12:13:51,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.04/10.87 [2019-03-28 12:13:51,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.04/10.87 [2019-03-28 12:13:51,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.04/10.87 Termination analysis: LINEAR_WITH_GUESSES 25.04/10.87 Number of strict supporting invariants: 0 25.04/10.87 Number of non-strict supporting invariants: 1 25.04/10.87 Consider only non-deceasing supporting invariants: true 25.04/10.87 Simplify termination arguments: true 25.04/10.87 Simplify supporting invariants: trueOverapproximate stem: false 25.04/10.87 [2019-03-28 12:13:51,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.04/10.87 [2019-03-28 12:13:51,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.04/10.87 [2019-03-28 12:13:51,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.04/10.87 [2019-03-28 12:13:51,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.04/10.87 [2019-03-28 12:13:51,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.04/10.87 [2019-03-28 12:13:51,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.04/10.87 [2019-03-28 12:13:51,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.04/10.87 [2019-03-28 12:13:51,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.04/10.87 [2019-03-28 12:13:51,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.04/10.87 Termination analysis: LINEAR_WITH_GUESSES 25.04/10.87 Number of strict supporting invariants: 0 25.04/10.87 Number of non-strict supporting invariants: 1 25.04/10.87 Consider only non-deceasing supporting invariants: true 25.04/10.87 Simplify termination arguments: true 25.04/10.87 Simplify supporting invariants: trueOverapproximate stem: false 25.04/10.87 [2019-03-28 12:13:51,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.04/10.87 [2019-03-28 12:13:51,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.04/10.87 [2019-03-28 12:13:51,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.04/10.87 [2019-03-28 12:13:51,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.04/10.87 [2019-03-28 12:13:51,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.04/10.87 [2019-03-28 12:13:51,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.04/10.87 [2019-03-28 12:13:51,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.04/10.87 [2019-03-28 12:13:51,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.04/10.87 [2019-03-28 12:13:51,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.04/10.87 Termination analysis: LINEAR_WITH_GUESSES 25.04/10.87 Number of strict supporting invariants: 0 25.04/10.87 Number of non-strict supporting invariants: 1 25.04/10.87 Consider only non-deceasing supporting invariants: true 25.04/10.87 Simplify termination arguments: true 25.04/10.87 Simplify supporting invariants: trueOverapproximate stem: false 25.04/10.87 [2019-03-28 12:13:51,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.04/10.87 [2019-03-28 12:13:51,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.04/10.87 [2019-03-28 12:13:51,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.04/10.87 [2019-03-28 12:13:51,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.04/10.87 [2019-03-28 12:13:51,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.04/10.87 [2019-03-28 12:13:51,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.04/10.87 [2019-03-28 12:13:51,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.04/10.87 [2019-03-28 12:13:51,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.04/10.87 [2019-03-28 12:13:51,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.04/10.87 Termination analysis: LINEAR_WITH_GUESSES 25.04/10.87 Number of strict supporting invariants: 0 25.04/10.87 Number of non-strict supporting invariants: 1 25.04/10.87 Consider only non-deceasing supporting invariants: true 25.04/10.87 Simplify termination arguments: true 25.04/10.87 Simplify supporting invariants: trueOverapproximate stem: false 25.04/10.87 [2019-03-28 12:13:51,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.04/10.87 [2019-03-28 12:13:51,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.04/10.87 [2019-03-28 12:13:51,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.04/10.87 [2019-03-28 12:13:51,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.04/10.87 [2019-03-28 12:13:51,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.04/10.87 [2019-03-28 12:13:51,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.04/10.87 [2019-03-28 12:13:51,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.04/10.87 [2019-03-28 12:13:51,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.04/10.87 [2019-03-28 12:13:51,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.04/10.87 Termination analysis: LINEAR_WITH_GUESSES 25.04/10.87 Number of strict supporting invariants: 0 25.04/10.87 Number of non-strict supporting invariants: 1 25.04/10.87 Consider only non-deceasing supporting invariants: true 25.04/10.87 Simplify termination arguments: true 25.04/10.87 Simplify supporting invariants: trueOverapproximate stem: false 25.04/10.87 [2019-03-28 12:13:51,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.04/10.87 [2019-03-28 12:13:51,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.04/10.87 [2019-03-28 12:13:51,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.04/10.87 [2019-03-28 12:13:51,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.04/10.87 [2019-03-28 12:13:51,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.04/10.87 [2019-03-28 12:13:51,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.04/10.87 [2019-03-28 12:13:51,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.04/10.87 [2019-03-28 12:13:51,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.04/10.87 Termination analysis: LINEAR_WITH_GUESSES 25.04/10.87 Number of strict supporting invariants: 0 25.04/10.87 Number of non-strict supporting invariants: 1 25.04/10.87 Consider only non-deceasing supporting invariants: true 25.04/10.87 Simplify termination arguments: true 25.04/10.87 Simplify supporting invariants: trueOverapproximate stem: false 25.04/10.87 [2019-03-28 12:13:51,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.04/10.87 [2019-03-28 12:13:51,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.04/10.87 [2019-03-28 12:13:51,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.04/10.87 [2019-03-28 12:13:51,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.04/10.87 [2019-03-28 12:13:51,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.04/10.87 [2019-03-28 12:13:51,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.04/10.87 [2019-03-28 12:13:51,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.04/10.87 [2019-03-28 12:13:51,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.04/10.87 [2019-03-28 12:13:51,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.04/10.87 Termination analysis: LINEAR_WITH_GUESSES 25.04/10.87 Number of strict supporting invariants: 0 25.04/10.87 Number of non-strict supporting invariants: 1 25.04/10.87 Consider only non-deceasing supporting invariants: true 25.04/10.87 Simplify termination arguments: true 25.04/10.87 Simplify supporting invariants: trueOverapproximate stem: false 25.04/10.87 [2019-03-28 12:13:51,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.04/10.87 [2019-03-28 12:13:51,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.04/10.87 [2019-03-28 12:13:51,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.04/10.87 [2019-03-28 12:13:51,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.04/10.87 [2019-03-28 12:13:51,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.04/10.87 [2019-03-28 12:13:51,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.04/10.87 [2019-03-28 12:13:51,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.04/10.87 [2019-03-28 12:13:51,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.04/10.87 Termination analysis: LINEAR_WITH_GUESSES 25.04/10.87 Number of strict supporting invariants: 0 25.04/10.87 Number of non-strict supporting invariants: 1 25.04/10.87 Consider only non-deceasing supporting invariants: true 25.04/10.87 Simplify termination arguments: true 25.04/10.87 Simplify supporting invariants: trueOverapproximate stem: false 25.04/10.87 [2019-03-28 12:13:51,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.04/10.87 [2019-03-28 12:13:51,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.04/10.87 [2019-03-28 12:13:51,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.04/10.87 [2019-03-28 12:13:51,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.04/10.87 [2019-03-28 12:13:51,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.04/10.87 [2019-03-28 12:13:51,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.04/10.87 [2019-03-28 12:13:51,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.04/10.87 [2019-03-28 12:13:51,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.04/10.87 Termination analysis: LINEAR_WITH_GUESSES 25.04/10.87 Number of strict supporting invariants: 0 25.04/10.87 Number of non-strict supporting invariants: 1 25.04/10.87 Consider only non-deceasing supporting invariants: true 25.04/10.87 Simplify termination arguments: true 25.04/10.87 Simplify supporting invariants: trueOverapproximate stem: false 25.04/10.87 [2019-03-28 12:13:51,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.04/10.87 [2019-03-28 12:13:51,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.04/10.87 [2019-03-28 12:13:51,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.04/10.87 [2019-03-28 12:13:51,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.04/10.87 [2019-03-28 12:13:51,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.04/10.87 [2019-03-28 12:13:51,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.04/10.87 [2019-03-28 12:13:51,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.04/10.87 [2019-03-28 12:13:51,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.04/10.87 [2019-03-28 12:13:51,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.04/10.87 Termination analysis: LINEAR_WITH_GUESSES 25.04/10.87 Number of strict supporting invariants: 0 25.04/10.87 Number of non-strict supporting invariants: 1 25.04/10.87 Consider only non-deceasing supporting invariants: true 25.04/10.87 Simplify termination arguments: true 25.04/10.87 Simplify supporting invariants: trueOverapproximate stem: false 25.04/10.87 [2019-03-28 12:13:51,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.04/10.87 [2019-03-28 12:13:51,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.04/10.87 [2019-03-28 12:13:51,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.04/10.87 [2019-03-28 12:13:51,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.04/10.87 [2019-03-28 12:13:51,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.04/10.87 [2019-03-28 12:13:51,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.04/10.87 [2019-03-28 12:13:51,935 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.04/10.87 [2019-03-28 12:13:51,952 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 25.04/10.87 [2019-03-28 12:13:51,952 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. 25.04/10.87 [2019-03-28 12:13:51,954 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.04/10.87 [2019-03-28 12:13:51,956 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.04/10.87 [2019-03-28 12:13:51,956 INFO L518 LassoAnalysis]: Proved termination. 25.04/10.87 [2019-03-28 12:13:51,957 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.04/10.87 Ranking function f(v_rep(select #length strlen_rec_#in~p.base)_1, strlen_rec_#in~p.offset) = 1*v_rep(select #length strlen_rec_#in~p.base)_1 - 1*strlen_rec_#in~p.offset 25.04/10.87 Supporting invariants [] 25.04/10.87 [2019-03-28 12:13:51,961 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed 25.04/10.87 [2019-03-28 12:13:51,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.04/10.87 [2019-03-28 12:13:51,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.04/10.87 [2019-03-28 12:13:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.87 [2019-03-28 12:13:52,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core 25.04/10.87 [2019-03-28 12:13:52,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.04/10.87 [2019-03-28 12:13:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.04/10.87 [2019-03-28 12:13:52,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core 25.04/10.87 [2019-03-28 12:13:52,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.04/10.87 [2019-03-28 12:13:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.04/10.87 [2019-03-28 12:13:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.04/10.87 [2019-03-28 12:13:52,072 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 25.04/10.87 [2019-03-28 12:13:52,072 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 25.04/10.87 [2019-03-28 12:13:52,075 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 25.04/10.87 [2019-03-28 12:13:52,076 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states. Second operand 4 states. 25.04/10.87 [2019-03-28 12:13:52,182 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states.. Second operand 4 states. Result 49 states and 69 transitions. Complement of second has 15 states. 25.04/10.87 [2019-03-28 12:13:52,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 25.04/10.87 [2019-03-28 12:13:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 25.04/10.87 [2019-03-28 12:13:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. 25.04/10.87 [2019-03-28 12:13:52,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. 25.04/10.87 [2019-03-28 12:13:52,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.04/10.87 [2019-03-28 12:13:52,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. 25.04/10.87 [2019-03-28 12:13:52,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.04/10.87 [2019-03-28 12:13:52,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. 25.04/10.87 [2019-03-28 12:13:52,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.04/10.87 [2019-03-28 12:13:52,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 69 transitions. 25.04/10.87 [2019-03-28 12:13:52,202 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.04/10.87 [2019-03-28 12:13:52,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. 25.04/10.87 [2019-03-28 12:13:52,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 25.04/10.87 [2019-03-28 12:13:52,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 25.04/10.87 [2019-03-28 12:13:52,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 25.04/10.87 [2019-03-28 12:13:52,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.04/10.87 [2019-03-28 12:13:52,205 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.04/10.87 [2019-03-28 12:13:52,205 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.04/10.87 [2019-03-28 12:13:52,205 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.04/10.87 [2019-03-28 12:13:52,205 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 25.04/10.87 [2019-03-28 12:13:52,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 25.04/10.87 [2019-03-28 12:13:52,205 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.04/10.87 [2019-03-28 12:13:52,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 25.04/10.87 [2019-03-28 12:13:52,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:13:52 BasicIcfg 25.04/10.87 [2019-03-28 12:13:52,211 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 25.04/10.87 [2019-03-28 12:13:52,212 INFO L168 Benchmark]: Toolchain (without parser) took 6343.70 ms. Allocated memory was 649.6 MB in the beginning and 764.4 MB in the end (delta: 114.8 MB). Free memory was 558.4 MB in the beginning and 489.8 MB in the end (delta: 68.6 MB). Peak memory consumption was 183.5 MB. Max. memory is 50.3 GB. 25.04/10.87 [2019-03-28 12:13:52,213 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.04/10.87 [2019-03-28 12:13:52,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.39 ms. Allocated memory was 649.6 MB in the beginning and 674.2 MB in the end (delta: 24.6 MB). Free memory was 558.4 MB in the beginning and 637.9 MB in the end (delta: -79.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 25.04/10.87 [2019-03-28 12:13:52,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.49 ms. Allocated memory is still 674.2 MB. Free memory was 637.9 MB in the beginning and 636.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 25.04/10.87 [2019-03-28 12:13:52,214 INFO L168 Benchmark]: Boogie Preprocessor took 20.75 ms. Allocated memory is still 674.2 MB. Free memory was 636.8 MB in the beginning and 634.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 25.04/10.87 [2019-03-28 12:13:52,215 INFO L168 Benchmark]: RCFGBuilder took 251.16 ms. Allocated memory is still 674.2 MB. Free memory was 634.7 MB in the beginning and 618.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 50.3 GB. 25.04/10.87 [2019-03-28 12:13:52,215 INFO L168 Benchmark]: BlockEncodingV2 took 99.66 ms. Allocated memory is still 674.2 MB. Free memory was 618.0 MB in the beginning and 611.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 25.04/10.87 [2019-03-28 12:13:52,216 INFO L168 Benchmark]: TraceAbstraction took 4574.17 ms. Allocated memory was 674.2 MB in the beginning and 764.4 MB in the end (delta: 90.2 MB). Free memory was 611.5 MB in the beginning and 652.4 MB in the end (delta: -40.9 MB). Peak memory consumption was 324.4 MB. Max. memory is 50.3 GB. 25.04/10.87 [2019-03-28 12:13:52,217 INFO L168 Benchmark]: BuchiAutomizer took 1047.64 ms. Allocated memory is still 764.4 MB. Free memory was 652.4 MB in the beginning and 489.8 MB in the end (delta: 162.6 MB). Peak memory consumption was 162.6 MB. Max. memory is 50.3 GB. 25.04/10.87 [2019-03-28 12:13:52,221 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 25.04/10.87 --- Results --- 25.04/10.87 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 25.04/10.87 - StatisticsResult: Initial Icfg 25.04/10.87 21 locations, 23 edges 25.04/10.87 - StatisticsResult: Encoded RCFG 25.04/10.87 16 locations, 24 edges 25.04/10.87 * Results from de.uni_freiburg.informatik.ultimate.core: 25.04/10.87 - StatisticsResult: Toolchain Benchmarks 25.04/10.87 Benchmark results are: 25.04/10.87 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.04/10.87 * CACSL2BoogieTranslator took 305.39 ms. Allocated memory was 649.6 MB in the beginning and 674.2 MB in the end (delta: 24.6 MB). Free memory was 558.4 MB in the beginning and 637.9 MB in the end (delta: -79.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 25.04/10.87 * Boogie Procedure Inliner took 39.49 ms. Allocated memory is still 674.2 MB. Free memory was 637.9 MB in the beginning and 636.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 25.04/10.87 * Boogie Preprocessor took 20.75 ms. Allocated memory is still 674.2 MB. Free memory was 636.8 MB in the beginning and 634.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 25.04/10.87 * RCFGBuilder took 251.16 ms. Allocated memory is still 674.2 MB. Free memory was 634.7 MB in the beginning and 618.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 50.3 GB. 25.04/10.87 * BlockEncodingV2 took 99.66 ms. Allocated memory is still 674.2 MB. Free memory was 618.0 MB in the beginning and 611.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 25.04/10.87 * TraceAbstraction took 4574.17 ms. Allocated memory was 674.2 MB in the beginning and 764.4 MB in the end (delta: 90.2 MB). Free memory was 611.5 MB in the beginning and 652.4 MB in the end (delta: -40.9 MB). Peak memory consumption was 324.4 MB. Max. memory is 50.3 GB. 25.04/10.87 * BuchiAutomizer took 1047.64 ms. Allocated memory is still 764.4 MB. Free memory was 652.4 MB in the beginning and 489.8 MB in the end (delta: 162.6 MB). Peak memory consumption was 162.6 MB. Max. memory is 50.3 GB. 25.04/10.87 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 25.04/10.87 - GenericResult: Unfinished Backtranslation 25.04/10.87 unknown boogie variable #length 25.04/10.87 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 25.04/10.87 - PositiveResult [Line: 18]: pointer dereference always succeeds 25.04/10.87 For all program executions holds that pointer dereference always succeeds at this location 25.04/10.87 - PositiveResult [Line: 18]: pointer dereference always succeeds 25.04/10.87 For all program executions holds that pointer dereference always succeeds at this location 25.04/10.87 - PositiveResult [Line: 6]: pointer dereference always succeeds 25.04/10.87 For all program executions holds that pointer dereference always succeeds at this location 25.04/10.87 - PositiveResult [Line: 6]: pointer dereference always succeeds 25.04/10.87 For all program executions holds that pointer dereference always succeeds at this location 25.04/10.87 - AllSpecificationsHoldResult: All specifications hold 25.04/10.87 4 specifications checked. All of them hold 25.04/10.87 - StatisticsResult: Ultimate Automizer benchmark data 25.04/10.87 CFG has 2 procedures, 16 locations, 4 error locations. SAFE Result, 4.5s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 104 SDslu, 162 SDs, 0 SdLazy, 615 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 27 PreInvPairs, 39 NumberOfFragments, 179 HoareAnnotationTreeSize, 27 FomulaSimplifications, 5569 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1965 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 8237 SizeOfPredicates, 18 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 6/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 25.04/10.87 - StatisticsResult: Constructed decomposition of program 25.04/10.87 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[p] + -1 * p and consists of 5 locations. 25.04/10.87 - StatisticsResult: Timing statistics 25.04/10.87 BüchiAutomizer plugin needed 1.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 49 SDslu, 10 SDs, 0 SdLazy, 39 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp93 ukn63 mio100 lsp54 div100 bol100 ite100 ukn100 eq162 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 25.04/10.87 - TerminationAnalysisResult: Termination proven 25.04/10.87 Buchi Automizer proved that your program is terminating 25.04/10.87 RESULT: Ultimate proved your program to be correct! 25.04/10.87 !SESSION 2019-03-28 12:13:42.591 ----------------------------------------------- 25.04/10.87 eclipse.buildId=unknown 25.04/10.87 java.version=1.8.0_181 25.04/10.87 java.vendor=Oracle Corporation 25.04/10.87 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 25.04/10.87 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.04/10.87 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.04/10.87 25.04/10.87 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:13:52.457 25.04/10.87 !MESSAGE The workspace will exit with unsaved changes in this session. 25.04/10.87 Received shutdown request... 25.04/10.87 Ultimate: 25.04/10.87 GTK+ Version Check 25.04/10.87 EOF