./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 36c66c6ef3a2f9350719139a100a5a7260c2a075 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:08:15,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:15,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:15,206 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:15,206 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:15,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:15,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:15,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:15,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:15,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:15,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:15,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:15,214 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:15,215 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:15,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:15,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:15,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:15,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:15,222 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:15,223 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:15,231 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:15,233 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:15,234 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:15,235 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:15,235 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:15,236 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:15,240 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:15,241 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:15,242 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:15,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:15,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:15,247 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:15,249 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:15,249 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:15,250 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:15,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:15,254 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:08:15,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:15,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:15,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:15,271 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:15,271 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:15,271 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:15,271 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:15,271 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:15,271 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:15,272 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:15,272 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:15,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:15,273 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:15,273 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:15,273 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:15,274 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:15,274 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:15,274 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:15,274 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:15,274 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:15,274 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:15,275 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:15,275 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:15,275 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:15,275 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:15,275 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:15,275 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:15,276 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:15,276 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36c66c6ef3a2f9350719139a100a5a7260c2a075 [2018-10-27 06:08:15,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:15,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:15,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:15,327 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:15,327 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:15,328 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:08:15,391 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/data/e6ae1388c/11e42a7f4d494245891bb4a5e2b6b645/FLAGb453179b8 [2018-10-27 06:08:15,821 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:15,822 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:08:15,832 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/data/e6ae1388c/11e42a7f4d494245891bb4a5e2b6b645/FLAGb453179b8 [2018-10-27 06:08:15,845 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/data/e6ae1388c/11e42a7f4d494245891bb4a5e2b6b645 [2018-10-27 06:08:15,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:15,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:15,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:15,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:15,854 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:15,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:15" (1/1) ... [2018-10-27 06:08:15,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad8fa87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:15, skipping insertion in model container [2018-10-27 06:08:15,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:15" (1/1) ... [2018-10-27 06:08:15,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:15,903 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:16,154 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:16,164 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:16,202 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:16,246 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:16,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:16 WrapperNode [2018-10-27 06:08:16,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:16,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:16,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:16,248 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:16,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:16" (1/1) ... [2018-10-27 06:08:16,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:16" (1/1) ... [2018-10-27 06:08:16,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:16,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:16,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:16,365 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:16,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:16" (1/1) ... [2018-10-27 06:08:16,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:16" (1/1) ... [2018-10-27 06:08:16,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:16" (1/1) ... [2018-10-27 06:08:16,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:16" (1/1) ... [2018-10-27 06:08:16,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:16" (1/1) ... [2018-10-27 06:08:16,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:16" (1/1) ... [2018-10-27 06:08:16,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:16" (1/1) ... [2018-10-27 06:08:16,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:16,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:16,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:16,395 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:16,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:16,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:16,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:16,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:16,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:16,989 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:16,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:16 BoogieIcfgContainer [2018-10-27 06:08:16,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:16,991 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:16,991 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:16,995 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:16,997 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:16,997 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:15" (1/3) ... [2018-10-27 06:08:16,998 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@613db4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:16, skipping insertion in model container [2018-10-27 06:08:16,998 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:16,998 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:16" (2/3) ... [2018-10-27 06:08:16,999 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@613db4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:16, skipping insertion in model container [2018-10-27 06:08:16,999 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:16,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:16" (3/3) ... [2018-10-27 06:08:17,002 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.01-no-inv-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:08:17,063 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:17,064 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:17,064 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:17,064 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:17,064 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:17,065 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:17,065 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:17,065 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:17,065 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:17,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-10-27 06:08:17,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-10-27 06:08:17,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:17,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:17,116 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:17,116 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:17,116 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:17,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-10-27 06:08:17,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-10-27 06:08:17,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:17,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:17,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:17,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:17,129 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 10#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 11#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 21#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 24#L555-3true [2018-10-27 06:08:17,130 INFO L795 eck$LassoCheckResult]: Loop: 24#L555-3true assume true; 5#L555true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7#L555-1true assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 18#L556true SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 14#L557-9true assume !true; 16#L557-10true SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 30#L560true SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 31#L560-1true havoc test_fun_#t~mem11; 24#L555-3true [2018-10-27 06:08:17,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:17,139 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-10-27 06:08:17,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:17,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:17,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:17,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:17,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1654332729, now seen corresponding path program 1 times [2018-10-27 06:08:17,303 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:17,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:17,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:17,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:08:17,351 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:17,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:08:17,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:08:17,369 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-10-27 06:08:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:17,376 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-10-27 06:08:17,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:08:17,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2018-10-27 06:08:17,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-10-27 06:08:17,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 23 states and 25 transitions. [2018-10-27 06:08:17,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-10-27 06:08:17,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-10-27 06:08:17,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-10-27 06:08:17,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:17,387 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-10-27 06:08:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-10-27 06:08:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 06:08:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:08:17,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-10-27 06:08:17,416 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-10-27 06:08:17,416 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-10-27 06:08:17,416 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:17,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2018-10-27 06:08:17,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-10-27 06:08:17,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:17,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:17,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:17,418 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:17,419 INFO L793 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 81#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 82#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 87#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 83#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 84#L555-3 [2018-10-27 06:08:17,419 INFO L795 eck$LassoCheckResult]: Loop: 84#L555-3 assume true; 76#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 77#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 74#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 66#L557-9 assume true; 67#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 72#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 75#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 78#L557-3 assume !test_fun_#t~short9; 79#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 70#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 71#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 88#L560-1 havoc test_fun_#t~mem11; 84#L555-3 [2018-10-27 06:08:17,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:17,419 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-10-27 06:08:17,420 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:17,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:17,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:17,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1053711549, now seen corresponding path program 1 times [2018-10-27 06:08:17,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:17,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:17,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:17,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1010161117, now seen corresponding path program 1 times [2018-10-27 06:08:17,509 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:17,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:17,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:17,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:17,886 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-10-27 06:08:18,957 WARN L179 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-10-27 06:08:19,106 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-10-27 06:08:19,139 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:19,140 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:19,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:19,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:19,141 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:19,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:19,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:19,141 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:19,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-10-27 06:08:19,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:19,142 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:19,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:19,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:19,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:19,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:19,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:19,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:19,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:19,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:19,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:19,904 WARN L179 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-10-27 06:08:20,067 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-27 06:08:20,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:20,314 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-27 06:08:20,762 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:20,766 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:20,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:20,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:20,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:20,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:20,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:20,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:20,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:20,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:20,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:20,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:20,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:20,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:20,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,852 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,853 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:20,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,856 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:20,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,954 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:20,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,958 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:20,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,975 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:20,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,976 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:20,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:20,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:20,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:20,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:20,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:20,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:20,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:20,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:20,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:21,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:21,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:21,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:21,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:21,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:21,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:21,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:21,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:21,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:21,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:21,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:21,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:21,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:21,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:21,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:21,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:21,053 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:21,073 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:21,077 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:08:21,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:21,082 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:21,082 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:21,083 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2018-10-27 06:08:21,188 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-10-27 06:08:21,196 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:21,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:21,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:21,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:21,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-10-27 06:08:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:21,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:21,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:08:21,496 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:21,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:21,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-10-27 06:08:21,582 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:21,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-10-27 06:08:21,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-10-27 06:08:21,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:21,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:21,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:21,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:31 [2018-10-27 06:08:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:21,766 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:08:21,767 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-10-27 06:08:21,933 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 3. Second operand 9 states. Result 84 states and 94 transitions. Complement of second has 14 states. [2018-10-27 06:08:21,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:08:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2018-10-27 06:08:21,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 5 letters. Loop has 13 letters. [2018-10-27 06:08:21,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:21,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 18 letters. Loop has 13 letters. [2018-10-27 06:08:21,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:21,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 5 letters. Loop has 26 letters. [2018-10-27 06:08:21,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:21,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 94 transitions. [2018-10-27 06:08:21,944 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2018-10-27 06:08:21,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 67 states and 75 transitions. [2018-10-27 06:08:21,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-10-27 06:08:21,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-10-27 06:08:21,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 75 transitions. [2018-10-27 06:08:21,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:21,946 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-10-27 06:08:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 75 transitions. [2018-10-27 06:08:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2018-10-27 06:08:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-27 06:08:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-10-27 06:08:21,950 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-10-27 06:08:21,951 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-10-27 06:08:21,951 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:21,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 57 transitions. [2018-10-27 06:08:21,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-10-27 06:08:21,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:21,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:21,956 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:21,956 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:21,956 INFO L793 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 381#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 382#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 391#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 385#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 386#L555-3 assume true; 389#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 375#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 376#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 401#L557-9 assume true; 400#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 366#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 367#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 373#L557-3 assume !test_fun_#t~short9; 377#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 355#L558 [2018-10-27 06:08:21,956 INFO L795 eck$LassoCheckResult]: Loop: 355#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 356#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 363#L558-2 havoc test_fun_#t~mem10; 351#L557-9 assume true; 352#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 361#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 399#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 396#L557-3 assume !test_fun_#t~short9; 395#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 355#L558 [2018-10-27 06:08:21,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:21,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1810087763, now seen corresponding path program 1 times [2018-10-27 06:08:21,957 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:21,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:21,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:21,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:21,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:22,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:22,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:08:22,019 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:22,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1676281584, now seen corresponding path program 1 times [2018-10-27 06:08:22,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:22,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:22,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:08:22,082 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:22,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:22,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:22,083 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-10-27 06:08:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:22,131 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-10-27 06:08:22,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:22,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 59 transitions. [2018-10-27 06:08:22,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:08:22,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 53 states and 58 transitions. [2018-10-27 06:08:22,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-10-27 06:08:22,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-10-27 06:08:22,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 58 transitions. [2018-10-27 06:08:22,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:22,134 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-10-27 06:08:22,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 58 transitions. [2018-10-27 06:08:22,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-10-27 06:08:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 06:08:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-10-27 06:08:22,143 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:08:22,143 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:08:22,143 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:22,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-10-27 06:08:22,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:08:22,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:22,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:22,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:22,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:22,145 INFO L793 eck$LassoCheckResult]: Stem: 496#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 491#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 497#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 492#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 493#L555-3 assume true; 481#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 482#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 476#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 463#L557-9 assume true; 464#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 473#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 478#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 485#L557-3 assume test_fun_#t~short9; 487#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 494#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 502#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 467#L558 [2018-10-27 06:08:22,145 INFO L795 eck$LassoCheckResult]: Loop: 467#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 468#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 475#L558-2 havoc test_fun_#t~mem10; 480#L557-9 assume true; 511#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 510#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 509#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 508#L557-3 assume test_fun_#t~short9; 507#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 500#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 501#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 467#L558 [2018-10-27 06:08:22,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,145 INFO L82 PathProgramCache]: Analyzing trace with hash -32712208, now seen corresponding path program 1 times [2018-10-27 06:08:22,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,192 INFO L82 PathProgramCache]: Analyzing trace with hash 293739379, now seen corresponding path program 1 times [2018-10-27 06:08:22,192 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:22,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:22,225 INFO L82 PathProgramCache]: Analyzing trace with hash -671283676, now seen corresponding path program 1 times [2018-10-27 06:08:22,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:22,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:22,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:22,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:22,408 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-10-27 06:08:22,774 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 120 [2018-10-27 06:08:22,910 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-10-27 06:08:22,912 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:22,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:22,912 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:22,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:22,913 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:22,913 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:22,913 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:22,913 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:22,913 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-10-27 06:08:22,913 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:22,913 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:22,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:22,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:23,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:23,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:23,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:23,464 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2018-10-27 06:08:23,579 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2018-10-27 06:08:23,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:23,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:23,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:24,159 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:24,159 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:24,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,219 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,222 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:24,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:24,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:24,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,229 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,241 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:24,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,243 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:24,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,254 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:24,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,255 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:24,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,262 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:24,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:24,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:24,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:24,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:24,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:24,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:24,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:24,303 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:24,318 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:08:24,319 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:08:24,319 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:24,321 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-10-27 06:08:24,321 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:24,321 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1 >= 0] [2018-10-27 06:08:24,976 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:08:25,005 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:25,005 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:25,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:25,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:25,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:25,532 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:25,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-27 06:08:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:25,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:25,695 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:25,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 57 [2018-10-27 06:08:25,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-10-27 06:08:25,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:25,771 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:25,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 51 [2018-10-27 06:08:25,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-10-27 06:08:25,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-27 06:08:25,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-10-27 06:08:25,925 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:164 [2018-10-27 06:08:26,384 WARN L179 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 36 [2018-10-27 06:08:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:26,629 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-10-27 06:08:26,629 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 7 Second operand 9 states. [2018-10-27 06:08:27,226 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 7. Second operand 9 states. Result 85 states and 93 transitions. Complement of second has 16 states. [2018-10-27 06:08:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:08:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2018-10-27 06:08:27,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 17 letters. Loop has 11 letters. [2018-10-27 06:08:27,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:27,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 28 letters. Loop has 11 letters. [2018-10-27 06:08:27,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:27,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 17 letters. Loop has 22 letters. [2018-10-27 06:08:27,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:27,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 93 transitions. [2018-10-27 06:08:27,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:08:27,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 80 states and 88 transitions. [2018-10-27 06:08:27,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-10-27 06:08:27,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-10-27 06:08:27,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 88 transitions. [2018-10-27 06:08:27,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:27,237 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-10-27 06:08:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 88 transitions. [2018-10-27 06:08:27,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-10-27 06:08:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-27 06:08:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-10-27 06:08:27,241 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-10-27 06:08:27,241 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-10-27 06:08:27,242 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:27,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 82 transitions. [2018-10-27 06:08:27,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:08:27,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:27,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:27,243 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:27,244 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:27,244 INFO L793 eck$LassoCheckResult]: Stem: 869#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 862#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 863#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 873#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 867#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 868#L555-3 assume true; 896#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 895#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 894#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 893#L557-9 assume true; 892#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 891#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 889#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 887#L557-3 assume test_fun_#t~short9; 885#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 883#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 880#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 878#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 835#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 901#L558-2 havoc test_fun_#t~mem10; 900#L557-9 assume true; 842#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 843#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 849#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 853#L557-3 assume !test_fun_#t~short9; 859#L557-7 [2018-10-27 06:08:27,246 INFO L795 eck$LassoCheckResult]: Loop: 859#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 838#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 839#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 874#L560-1 havoc test_fun_#t~mem11; 871#L555-3 assume true; 855#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 856#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 851#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 830#L557-9 assume true; 831#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 899#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 898#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 897#L557-3 assume !test_fun_#t~short9; 859#L557-7 [2018-10-27 06:08:27,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:27,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1833143579, now seen corresponding path program 1 times [2018-10-27 06:08:27,246 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:27,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:27,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:27,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:27,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:27,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:27,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2059817839, now seen corresponding path program 2 times [2018-10-27 06:08:27,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:27,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:27,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:27,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:27,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:27,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:27,300 INFO L82 PathProgramCache]: Analyzing trace with hash 651866891, now seen corresponding path program 1 times [2018-10-27 06:08:27,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:27,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:27,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:27,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:27,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:27,692 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-10-27 06:08:28,260 WARN L179 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 137 [2018-10-27 06:08:28,424 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-10-27 06:08:28,427 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:28,427 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:28,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:28,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:28,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:28,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:28,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:28,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:28,428 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-10-27 06:08:28,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:28,428 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:28,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:28,905 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2018-10-27 06:08:29,422 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:29,422 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:29,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:29,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:29,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:29,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:29,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:29,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:29,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:29,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:29,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:29,440 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:29,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:29,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:29,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:29,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:29,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:29,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:29,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:29,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:29,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:29,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:29,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:29,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:29,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:29,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:29,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,549 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:29,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,550 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:29,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,554 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:29,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,555 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:29,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,577 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:29,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:29,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:29,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:29,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:29,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:29,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:29,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:29,604 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:29,624 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-10-27 06:08:29,624 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-10-27 06:08:29,624 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:29,625 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:29,625 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:29,625 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-10-27 06:08:29,886 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-10-27 06:08:29,888 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:29,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:29,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:29,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:29,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-10-27 06:08:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:29,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:29,967 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:29,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:29,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:08:29,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:29,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:08:30,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:30,172 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:30,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:30,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:30,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:30,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-10-27 06:08:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:30,214 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:08:30,214 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 82 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-10-27 06:08:30,371 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 82 transitions. cyclomatic complexity: 11. Second operand 9 states. Result 210 states and 234 transitions. Complement of second has 11 states. [2018-10-27 06:08:30,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:08:30,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2018-10-27 06:08:30,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 25 letters. Loop has 13 letters. [2018-10-27 06:08:30,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:30,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 38 letters. Loop has 13 letters. [2018-10-27 06:08:30,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:30,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 25 letters. Loop has 26 letters. [2018-10-27 06:08:30,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:30,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 234 transitions. [2018-10-27 06:08:30,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2018-10-27 06:08:30,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 155 states and 171 transitions. [2018-10-27 06:08:30,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-10-27 06:08:30,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-10-27 06:08:30,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 171 transitions. [2018-10-27 06:08:30,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:30,384 INFO L705 BuchiCegarLoop]: Abstraction has 155 states and 171 transitions. [2018-10-27 06:08:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 171 transitions. [2018-10-27 06:08:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-10-27 06:08:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-27 06:08:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2018-10-27 06:08:30,395 INFO L728 BuchiCegarLoop]: Abstraction has 153 states and 169 transitions. [2018-10-27 06:08:30,395 INFO L608 BuchiCegarLoop]: Abstraction has 153 states and 169 transitions. [2018-10-27 06:08:30,395 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:08:30,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 169 transitions. [2018-10-27 06:08:30,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2018-10-27 06:08:30,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:30,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:30,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:30,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:30,401 INFO L793 eck$LassoCheckResult]: Stem: 1393#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 1387#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1397#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 1391#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1392#L555-3 assume true; 1376#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1377#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 1365#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1366#L557-9 assume true; 1443#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1442#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1441#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1440#L557-3 assume test_fun_#t~short9; 1439#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1438#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1436#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 1432#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1430#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1428#L558-2 havoc test_fun_#t~mem10; 1426#L557-9 assume true; 1424#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1422#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1420#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1417#L557-3 assume test_fun_#t~short9; 1413#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1414#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1409#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 1356#L557-10 [2018-10-27 06:08:30,401 INFO L795 eck$LassoCheckResult]: Loop: 1356#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 1357#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 1403#L560-1 havoc test_fun_#t~mem11; 1406#L555-3 assume true; 1434#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1383#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 1384#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1427#L557-9 assume true; 1425#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1423#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1421#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1418#L557-3 assume test_fun_#t~short9; 1416#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1411#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1412#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 1356#L557-10 [2018-10-27 06:08:30,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash -671283678, now seen corresponding path program 1 times [2018-10-27 06:08:30,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:30,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:30,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:30,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:30,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:30,551 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:30,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:30,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:30,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:30,632 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:30,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:30,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:30,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:30,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:08:30,724 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:30,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:30,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:08:30,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:30,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:30,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:30,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:08:30,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:08:30,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-27 06:08:30,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:30,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:30,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:30,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:9 [2018-10-27 06:08:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:30,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:30,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-27 06:08:30,816 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:30,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:30,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1170910682, now seen corresponding path program 1 times [2018-10-27 06:08:30,816 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:30,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:30,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:30,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:31,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:31,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:08:31,221 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:31,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:08:31,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:08:31,221 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-10-27 06:08:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:31,302 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2018-10-27 06:08:31,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:08:31,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 202 transitions. [2018-10-27 06:08:31,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2018-10-27 06:08:31,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 181 states and 196 transitions. [2018-10-27 06:08:31,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2018-10-27 06:08:31,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2018-10-27 06:08:31,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 196 transitions. [2018-10-27 06:08:31,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:31,307 INFO L705 BuchiCegarLoop]: Abstraction has 181 states and 196 transitions. [2018-10-27 06:08:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 196 transitions. [2018-10-27 06:08:31,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151. [2018-10-27 06:08:31,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-27 06:08:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2018-10-27 06:08:31,319 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 166 transitions. [2018-10-27 06:08:31,319 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 166 transitions. [2018-10-27 06:08:31,319 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:08:31,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 166 transitions. [2018-10-27 06:08:31,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2018-10-27 06:08:31,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:31,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:31,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:31,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:31,325 INFO L793 eck$LassoCheckResult]: Stem: 1836#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1828#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 1829#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1837#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 1830#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1831#L555-3 assume true; 1817#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1818#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 1891#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1889#L557-9 assume true; 1887#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1885#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1883#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1881#L557-3 assume test_fun_#t~short9; 1879#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1878#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1877#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 1875#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1872#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1870#L558-2 havoc test_fun_#t~mem10; 1868#L557-9 assume true; 1866#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1864#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1862#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1860#L557-3 assume test_fun_#t~short9; 1855#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1856#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1851#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 1799#L557-10 [2018-10-27 06:08:31,325 INFO L795 eck$LassoCheckResult]: Loop: 1799#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 1800#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 1845#L560-1 havoc test_fun_#t~mem11; 1848#L555-3 assume true; 1852#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1824#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 1807#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1808#L557-9 assume true; 1890#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1888#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1886#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1884#L557-3 assume test_fun_#t~short9; 1882#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1880#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1876#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 1873#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1871#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1869#L558-2 havoc test_fun_#t~mem10; 1867#L557-9 assume true; 1865#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1863#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1861#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1859#L557-3 assume test_fun_#t~short9; 1858#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1853#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1854#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 1799#L557-10 [2018-10-27 06:08:31,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash -671283678, now seen corresponding path program 2 times [2018-10-27 06:08:31,326 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:31,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:31,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:31,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:31,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:31,588 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-27 06:08:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:31,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:31,909 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:31,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:31,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:31,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:31,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:31,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:31,992 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:31,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:31,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:08:32,021 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:32,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:32,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:08:32,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:32,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:08:32,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:08:32,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-27 06:08:32,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:32,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:9 [2018-10-27 06:08:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:32,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:32,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-27 06:08:32,091 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:32,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,091 INFO L82 PathProgramCache]: Analyzing trace with hash -885930314, now seen corresponding path program 1 times [2018-10-27 06:08:32,092 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:32,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:32,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:32,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:32,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:32,238 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:32,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:32,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:32,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:32,263 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:32,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:08:32,282 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:32,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:32,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:08:32,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:32,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:08:32,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:08:32,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-27 06:08:32,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:32,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:32,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:9 [2018-10-27 06:08:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:32,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:32,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-27 06:08:32,397 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:32,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:08:32,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:08:32,397 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. cyclomatic complexity: 21 Second operand 10 states. [2018-10-27 06:08:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:32,879 INFO L93 Difference]: Finished difference Result 252 states and 271 transitions. [2018-10-27 06:08:32,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 06:08:32,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 271 transitions. [2018-10-27 06:08:32,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2018-10-27 06:08:32,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 252 states and 271 transitions. [2018-10-27 06:08:32,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2018-10-27 06:08:32,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2018-10-27 06:08:32,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 271 transitions. [2018-10-27 06:08:32,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:32,885 INFO L705 BuchiCegarLoop]: Abstraction has 252 states and 271 transitions. [2018-10-27 06:08:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 271 transitions. [2018-10-27 06:08:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 193. [2018-10-27 06:08:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-27 06:08:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 212 transitions. [2018-10-27 06:08:32,901 INFO L728 BuchiCegarLoop]: Abstraction has 193 states and 212 transitions. [2018-10-27 06:08:32,901 INFO L608 BuchiCegarLoop]: Abstraction has 193 states and 212 transitions. [2018-10-27 06:08:32,901 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:08:32,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 212 transitions. [2018-10-27 06:08:32,902 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2018-10-27 06:08:32,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:32,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:32,903 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:32,903 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:32,904 INFO L793 eck$LassoCheckResult]: Stem: 2431#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2423#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 2424#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 2432#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 2425#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 2426#L555-3 assume true; 2410#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 2411#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 2403#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 2404#L557-9 assume true; 2517#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 2516#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 2515#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 2514#L557-3 assume test_fun_#t~short9; 2513#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 2512#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 2511#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 2509#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 2510#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 2528#L558-2 havoc test_fun_#t~mem10; 2526#L557-9 assume true; 2525#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 2407#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 2408#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 2414#L557-3 assume !test_fun_#t~short9; 2420#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 2397#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 2398#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 2440#L560-1 havoc test_fun_#t~mem11; 2435#L555-3 assume true; 2412#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 2413#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 2405#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 2387#L557-9 [2018-10-27 06:08:32,912 INFO L795 eck$LassoCheckResult]: Loop: 2387#L557-9 assume true; 2388#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 2399#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 2520#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 2519#L557-3 assume test_fun_#t~short9; 2427#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 2428#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 2436#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 2391#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 2392#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 2401#L558-2 havoc test_fun_#t~mem10; 2387#L557-9 [2018-10-27 06:08:32,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1788737426, now seen corresponding path program 2 times [2018-10-27 06:08:32,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:32,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:32,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:32,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,941 INFO L82 PathProgramCache]: Analyzing trace with hash 953738907, now seen corresponding path program 2 times [2018-10-27 06:08:32,941 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:32,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:32,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:32,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:32,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1136051606, now seen corresponding path program 3 times [2018-10-27 06:08:32,954 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:32,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:32,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:32,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:33,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:33,296 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:33,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:08:33,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 06:08:33,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:33,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:33,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:33,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:33,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:33,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:08:33,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:33,383 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:33,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:33,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:33,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:33,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:33,442 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:33,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:33,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:08:33,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:33,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:33,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:33,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-10-27 06:08:33,808 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:33,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-10-27 06:08:33,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-10-27 06:08:33,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:33,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:33,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:33,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:30 [2018-10-27 06:08:33,888 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:33,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-10-27 06:08:33,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-10-27 06:08:33,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:33,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:33,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:33,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2018-10-27 06:08:34,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-10-27 06:08:34,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-10-27 06:08:34,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:34,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:08:34,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:34,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:34,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:34,051 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:7 [2018-10-27 06:08:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:34,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:34,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-10-27 06:08:34,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 06:08:34,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2018-10-27 06:08:34,226 INFO L87 Difference]: Start difference. First operand 193 states and 212 transitions. cyclomatic complexity: 25 Second operand 26 states. [2018-10-27 06:08:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:35,047 INFO L93 Difference]: Finished difference Result 238 states and 253 transitions. [2018-10-27 06:08:35,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-27 06:08:35,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 238 states and 253 transitions. [2018-10-27 06:08:35,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2018-10-27 06:08:35,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 238 states to 167 states and 175 transitions. [2018-10-27 06:08:35,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2018-10-27 06:08:35,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2018-10-27 06:08:35,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 175 transitions. [2018-10-27 06:08:35,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:35,052 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 175 transitions. [2018-10-27 06:08:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 175 transitions. [2018-10-27 06:08:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 136. [2018-10-27 06:08:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-27 06:08:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2018-10-27 06:08:35,062 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-10-27 06:08:35,062 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-10-27 06:08:35,062 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:08:35,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 144 transitions. [2018-10-27 06:08:35,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2018-10-27 06:08:35,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:35,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:35,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:35,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:35,064 INFO L793 eck$LassoCheckResult]: Stem: 3055#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3049#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 3050#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 3059#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 3053#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 3054#L555-3 assume true; 3042#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3043#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 3048#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3123#L557-9 assume true; 3122#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3120#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3118#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3116#L557-3 assume test_fun_#t~short9; 3114#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3112#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3110#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 3109#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3029#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3030#L558-2 havoc test_fun_#t~mem10; 3018#L557-9 assume true; 3019#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3108#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3107#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3105#L557-3 assume test_fun_#t~short9; 3102#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3082#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3099#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 3097#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3095#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3093#L558-2 havoc test_fun_#t~mem10; 3091#L557-9 assume true; 3090#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3089#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3087#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3085#L557-3 assume test_fun_#t~short9; 3081#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3078#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3079#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 3024#L557-10 [2018-10-27 06:08:35,064 INFO L795 eck$LassoCheckResult]: Loop: 3024#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 3025#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 3060#L560-1 havoc test_fun_#t~mem11; 3062#L555-3 assume true; 3127#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3126#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 3036#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3037#L557-9 assume true; 3151#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3150#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3149#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3148#L557-3 assume test_fun_#t~short9; 3147#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3146#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3145#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 3144#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3143#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3142#L558-2 havoc test_fun_#t~mem10; 3141#L557-9 assume true; 3140#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3139#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3138#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3137#L557-3 assume test_fun_#t~short9; 3136#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3135#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3134#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 3064#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3131#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3130#L558-2 havoc test_fun_#t~mem10; 3129#L557-9 assume true; 3128#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3125#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3124#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3086#L557-3 assume test_fun_#t~short9; 3083#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3084#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3063#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 3024#L557-10 [2018-10-27 06:08:35,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:35,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2138115730, now seen corresponding path program 3 times [2018-10-27 06:08:35,065 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:35,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:35,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:35,352 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-27 06:08:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:35,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:35,653 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:35,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:08:35,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 06:08:35,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:35,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:35,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:35,716 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:35,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:08:35,731 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:35,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:35,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:08:35,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:35,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:08:35,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:35,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:35,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:35,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:35,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:08:35,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:08:35,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-27 06:08:35,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:36,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:14 [2018-10-27 06:08:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:36,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:36,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-10-27 06:08:36,045 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:36,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,045 INFO L82 PathProgramCache]: Analyzing trace with hash -208286630, now seen corresponding path program 2 times [2018-10-27 06:08:36,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:36,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:36,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:36,182 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:36,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:08:36,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:08:36,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:36,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:36,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:36,219 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:36,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:08:36,237 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:36,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:36,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:08:36,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:36,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:08:36,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:36,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:36,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:36,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:08:36,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:08:36,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-27 06:08:36,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:36,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:14 [2018-10-27 06:08:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:36,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:36,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-10-27 06:08:36,381 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:36,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 06:08:36,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-10-27 06:08:36,381 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. cyclomatic complexity: 12 Second operand 15 states. [2018-10-27 06:08:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:36,741 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2018-10-27 06:08:36,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 06:08:36,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 236 transitions. [2018-10-27 06:08:36,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-10-27 06:08:36,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 225 states and 236 transitions. [2018-10-27 06:08:36,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-10-27 06:08:36,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2018-10-27 06:08:36,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 236 transitions. [2018-10-27 06:08:36,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:36,751 INFO L705 BuchiCegarLoop]: Abstraction has 225 states and 236 transitions. [2018-10-27 06:08:36,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 236 transitions. [2018-10-27 06:08:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 169. [2018-10-27 06:08:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-27 06:08:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 180 transitions. [2018-10-27 06:08:36,759 INFO L728 BuchiCegarLoop]: Abstraction has 169 states and 180 transitions. [2018-10-27 06:08:36,759 INFO L608 BuchiCegarLoop]: Abstraction has 169 states and 180 transitions. [2018-10-27 06:08:36,759 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:08:36,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 180 transitions. [2018-10-27 06:08:36,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2018-10-27 06:08:36,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:36,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:36,761 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:36,761 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:36,761 INFO L793 eck$LassoCheckResult]: Stem: 3694#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3687#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 3688#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 3697#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 3692#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 3693#L555-3 assume true; 3679#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3680#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 3674#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3675#L557-9 assume true; 3790#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3789#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3788#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3787#L557-3 assume test_fun_#t~short9; 3786#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3785#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3784#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 3783#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3782#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3781#L558-2 havoc test_fun_#t~mem10; 3780#L557-9 assume true; 3779#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3778#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3777#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3776#L557-3 assume test_fun_#t~short9; 3775#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3764#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3822#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 3704#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3794#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3793#L558-2 havoc test_fun_#t~mem10; 3792#L557-9 assume true; 3791#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3762#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3761#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3727#L557-3 assume !test_fun_#t~short9; 3707#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 3664#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 3665#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 3702#L560-1 havoc test_fun_#t~mem11; 3700#L555-3 assume true; 3681#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3682#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 3676#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3654#L557-9 [2018-10-27 06:08:36,761 INFO L795 eck$LassoCheckResult]: Loop: 3654#L557-9 assume true; 3655#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3666#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3671#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3677#L557-3 assume test_fun_#t~short9; 3683#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3689#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3695#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 3658#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3659#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3668#L558-2 havoc test_fun_#t~mem10; 3654#L557-9 [2018-10-27 06:08:36,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash -113820730, now seen corresponding path program 4 times [2018-10-27 06:08:36,762 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:36,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,816 INFO L82 PathProgramCache]: Analyzing trace with hash 953738907, now seen corresponding path program 3 times [2018-10-27 06:08:36,817 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:36,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,826 INFO L82 PathProgramCache]: Analyzing trace with hash 68357558, now seen corresponding path program 5 times [2018-10-27 06:08:36,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:36,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:36,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:36,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:37,128 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-10-27 06:08:38,700 WARN L179 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 217 DAG size of output: 170 [2018-10-27 06:08:38,971 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-10-27 06:08:38,974 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:38,974 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:38,974 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:38,974 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:38,975 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:38,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:38,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:38,975 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:38,975 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca_true-termination_true-no-overflow.c.i_Iteration10_Lasso [2018-10-27 06:08:38,975 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:38,975 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:38,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:38,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,311 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2018-10-27 06:08:39,420 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-10-27 06:08:39,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:39,952 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:39,953 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:39,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:39,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:39,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:39,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:39,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:39,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:39,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:39,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:39,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:39,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:39,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:39,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:40,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:40,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:40,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:40,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:40,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:40,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:40,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:40,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:40,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:40,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:40,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:40,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:40,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:40,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:40,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:40,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:40,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:40,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:40,012 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:40,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:40,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:40,013 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:40,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:40,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:40,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:40,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:40,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:40,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:40,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:40,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:40,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:40,075 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:40,094 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:08:40,094 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:08:40,094 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:40,097 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-10-27 06:08:40,097 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:40,098 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 2147483647 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 - 1 >= 0] [2018-10-27 06:08:40,191 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2018-10-27 06:08:40,193 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:40,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:40,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:40,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:40,356 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:40,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 06:08:40,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-10-27 06:08:40,361 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:40,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:40,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:40,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-10-27 06:08:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:40,404 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:40,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 169 states and 180 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-10-27 06:08:40,528 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 169 states and 180 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 225 states and 239 transitions. Complement of second has 15 states. [2018-10-27 06:08:40,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-10-27 06:08:40,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 44 letters. Loop has 11 letters. [2018-10-27 06:08:40,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:40,532 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:40,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:40,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:40,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:40,652 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:40,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 06:08:40,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-10-27 06:08:40,657 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:40,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:40,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:40,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-10-27 06:08:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:40,714 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:08:40,714 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 169 states and 180 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-10-27 06:08:40,833 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 169 states and 180 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 225 states and 239 transitions. Complement of second has 17 states. [2018-10-27 06:08:40,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-10-27 06:08:40,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 44 letters. Loop has 11 letters. [2018-10-27 06:08:40,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:40,835 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:40,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:40,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:40,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:40,945 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:40,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 06:08:40,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-10-27 06:08:40,950 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:40,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:40,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:40,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-10-27 06:08:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:40,984 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 6 loop predicates [2018-10-27 06:08:40,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 169 states and 180 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-10-27 06:08:41,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 169 states and 180 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 309 states and 331 transitions. Complement of second has 14 states. [2018-10-27 06:08:41,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:08:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-10-27 06:08:41,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 44 letters. Loop has 11 letters. [2018-10-27 06:08:41,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:41,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 55 letters. Loop has 11 letters. [2018-10-27 06:08:41,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:41,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 44 letters. Loop has 22 letters. [2018-10-27 06:08:41,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:41,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 309 states and 331 transitions. [2018-10-27 06:08:41,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2018-10-27 06:08:41,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 309 states to 112 states and 114 transitions. [2018-10-27 06:08:41,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-10-27 06:08:41,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-10-27 06:08:41,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 114 transitions. [2018-10-27 06:08:41,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:41,097 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-10-27 06:08:41,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 114 transitions. [2018-10-27 06:08:41,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 53. [2018-10-27 06:08:41,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-27 06:08:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-10-27 06:08:41,099 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-10-27 06:08:41,099 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-10-27 06:08:41,099 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:08:41,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 54 transitions. [2018-10-27 06:08:41,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-10-27 06:08:41,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:41,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:41,100 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:41,100 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:41,101 INFO L793 eck$LassoCheckResult]: Stem: 5297#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5290#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 5291#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 5301#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 5295#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 5296#L555-3 [2018-10-27 06:08:41,101 INFO L795 eck$LassoCheckResult]: Loop: 5296#L555-3 assume true; 5285#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 5286#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 5278#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 5265#L557-9 assume true; 5266#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5275#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5280#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5288#L557-3 assume test_fun_#t~short9; 5289#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5299#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5300#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 5269#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5270#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5316#L558-2 havoc test_fun_#t~mem10; 5267#L557-9 assume true; 5268#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5317#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5283#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5284#L557-3 assume test_fun_#t~short9; 5293#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5294#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5302#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 5303#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5276#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5277#L558-2 havoc test_fun_#t~mem10; 5281#L557-9 assume true; 5315#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5314#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5313#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5312#L557-3 assume test_fun_#t~short9; 5311#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5310#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5309#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 5308#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5307#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5306#L558-2 havoc test_fun_#t~mem10; 5305#L557-9 assume true; 5273#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5274#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5279#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5282#L557-3 assume test_fun_#t~short9; 5287#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5292#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5298#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 5271#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 5272#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 5304#L560-1 havoc test_fun_#t~mem11; 5296#L555-3 [2018-10-27 06:08:41,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:41,101 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 3 times [2018-10-27 06:08:41,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:41,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:41,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:41,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:41,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:41,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:41,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1672824748, now seen corresponding path program 3 times [2018-10-27 06:08:41,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:41,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:41,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:41,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:41,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:41,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:41,399 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:41,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:08:41,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 06:08:41,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:41,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:41,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:41,474 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:41,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:41,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:41,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:41,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:08:41,491 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:41,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:41,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:08:41,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:41,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:41,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:41,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:08:41,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:41,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:41,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:41,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:41,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:41,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:08:41,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:41,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:41,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:41,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:41,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:41,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-10-27 06:08:41,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:08:41,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-27 06:08:41,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:41,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:41,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:41,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:30, output treesize:19 [2018-10-27 06:08:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:41,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:41,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 21 [2018-10-27 06:08:41,860 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:41,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 06:08:41,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2018-10-27 06:08:41,861 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. cyclomatic complexity: 2 Second operand 21 states. [2018-10-27 06:08:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:42,892 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-10-27 06:08:42,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 06:08:42,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 83 transitions. [2018-10-27 06:08:42,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-10-27 06:08:42,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 74 states and 75 transitions. [2018-10-27 06:08:42,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:08:42,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:08:42,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 75 transitions. [2018-10-27 06:08:42,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:42,896 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-10-27 06:08:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 75 transitions. [2018-10-27 06:08:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2018-10-27 06:08:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 06:08:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-10-27 06:08:42,904 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-10-27 06:08:42,904 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-10-27 06:08:42,904 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:08:42,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 65 transitions. [2018-10-27 06:08:42,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-10-27 06:08:42,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:42,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:42,906 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:42,906 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:42,906 INFO L793 eck$LassoCheckResult]: Stem: 5621#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5615#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 5616#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 5624#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 5619#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 5620#L555-3 [2018-10-27 06:08:42,906 INFO L795 eck$LassoCheckResult]: Loop: 5620#L555-3 assume true; 5610#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 5611#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 5607#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 5593#L557-9 assume true; 5594#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5656#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5655#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5613#L557-3 assume test_fun_#t~short9; 5614#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5618#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5623#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 5597#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5598#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5601#L558-2 havoc test_fun_#t~mem10; 5595#L557-9 assume true; 5596#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5604#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5606#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5609#L557-3 assume test_fun_#t~short9; 5654#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5653#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5652#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 5651#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5650#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5649#L558-2 havoc test_fun_#t~mem10; 5648#L557-9 assume true; 5647#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5646#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5645#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5644#L557-3 assume test_fun_#t~short9; 5643#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5642#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5641#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 5640#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5639#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5638#L558-2 havoc test_fun_#t~mem10; 5628#L557-9 assume true; 5637#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5636#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5635#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5634#L557-3 assume test_fun_#t~short9; 5633#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5632#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5631#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 5630#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5629#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5627#L558-2 havoc test_fun_#t~mem10; 5626#L557-9 assume true; 5602#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5603#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5605#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5608#L557-3 assume test_fun_#t~short9; 5612#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5617#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5622#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 5599#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 5600#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 5625#L560-1 havoc test_fun_#t~mem11; 5620#L555-3 [2018-10-27 06:08:42,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:42,906 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 4 times [2018-10-27 06:08:42,906 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:42,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:42,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:42,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:42,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:42,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:42,923 INFO L82 PathProgramCache]: Analyzing trace with hash -305006560, now seen corresponding path program 4 times [2018-10-27 06:08:42,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:42,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:42,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:42,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:43,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:43,240 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:43,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:08:43,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:08:43,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:43,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:43,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:43,294 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:43,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:43,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:43,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:43,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:08:43,429 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:43,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:43,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:08:43,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:43,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:43,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:43,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:08:43,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:43,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:43,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:43,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:43,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:43,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:08:43,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:43,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:43,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:44,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:44,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:44,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-10-27 06:08:44,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:44,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:44,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:45,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:45,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:45,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-10-27 06:08:46,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:08:46,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-27 06:08:46,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:46,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:46,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:46,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:35, output treesize:24 [2018-10-27 06:08:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:46,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:46,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 26 [2018-10-27 06:08:46,659 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:46,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 06:08:46,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-10-27 06:08:46,660 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. cyclomatic complexity: 2 Second operand 26 states. [2018-10-27 06:08:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:48,520 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-10-27 06:08:48,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-27 06:08:48,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 94 transitions. [2018-10-27 06:08:48,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-10-27 06:08:48,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 85 states and 86 transitions. [2018-10-27 06:08:48,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:08:48,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:08:48,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 86 transitions. [2018-10-27 06:08:48,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:48,523 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-10-27 06:08:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 86 transitions. [2018-10-27 06:08:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-10-27 06:08:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-27 06:08:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-10-27 06:08:48,525 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-10-27 06:08:48,525 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-10-27 06:08:48,525 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:08:48,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 76 transitions. [2018-10-27 06:08:48,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2018-10-27 06:08:48,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:48,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:48,526 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:48,526 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:48,527 INFO L793 eck$LassoCheckResult]: Stem: 6019#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6013#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 6014#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 6022#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 6017#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 6018#L555-3 [2018-10-27 06:08:48,527 INFO L795 eck$LassoCheckResult]: Loop: 6018#L555-3 assume true; 6009#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6010#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 6006#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 5990#L557-9 assume true; 5991#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6064#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6063#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6062#L557-3 assume test_fun_#t~short9; 6061#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6060#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6059#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 5994#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5995#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5998#L558-2 havoc test_fun_#t~mem10; 5992#L557-9 assume true; 5993#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6001#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6003#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6008#L557-3 assume test_fun_#t~short9; 6012#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6016#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6021#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6023#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6058#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6004#L558-2 havoc test_fun_#t~mem10; 6005#L557-9 assume true; 6057#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6056#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6055#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6054#L557-3 assume test_fun_#t~short9; 6053#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6052#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6051#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6050#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6049#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6048#L558-2 havoc test_fun_#t~mem10; 6047#L557-9 assume true; 6046#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6045#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6044#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6043#L557-3 assume test_fun_#t~short9; 6042#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6041#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6040#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6039#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6038#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6037#L558-2 havoc test_fun_#t~mem10; 6027#L557-9 assume true; 6036#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6035#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6034#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6033#L557-3 assume test_fun_#t~short9; 6032#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6031#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6030#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6029#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6028#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6026#L558-2 havoc test_fun_#t~mem10; 6025#L557-9 assume true; 5999#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6000#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6002#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6007#L557-3 assume test_fun_#t~short9; 6011#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6015#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6020#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 5996#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 5997#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 6024#L560-1 havoc test_fun_#t~mem11; 6018#L555-3 [2018-10-27 06:08:48,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 5 times [2018-10-27 06:08:48,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:48,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:48,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:48,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:48,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:48,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:48,537 INFO L82 PathProgramCache]: Analyzing trace with hash -664389844, now seen corresponding path program 5 times [2018-10-27 06:08:48,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:48,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:48,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:48,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:48,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:48,916 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-10-27 06:08:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:49,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:49,137 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:49,146 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:08:49,177 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-27 06:08:49,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:49,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:49,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:49,209 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:49,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:49,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:49,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:49,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:08:49,230 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:49,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:49,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:08:49,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:49,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:49,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:49,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:08:49,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:49,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:49,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:49,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:49,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:49,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:08:49,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:49,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:49,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:49,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:49,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:49,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-10-27 06:08:49,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:49,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:49,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:49,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:49,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:49,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-10-27 06:08:50,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:50,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:50,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:50,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:50,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:50,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-10-27 06:08:52,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:08:52,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-27 06:08:52,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:52,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:52,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:52,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:40, output treesize:29 [2018-10-27 06:08:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:52,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:52,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 30 [2018-10-27 06:08:52,102 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:52,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-27 06:08:52,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2018-10-27 06:08:52,103 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. cyclomatic complexity: 2 Second operand 30 states. [2018-10-27 06:08:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:57,073 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2018-10-27 06:08:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-27 06:08:57,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 105 transitions. [2018-10-27 06:08:57,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2018-10-27 06:08:57,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 96 states and 97 transitions. [2018-10-27 06:08:57,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:08:57,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:08:57,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 97 transitions. [2018-10-27 06:08:57,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:57,077 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-10-27 06:08:57,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 97 transitions. [2018-10-27 06:08:57,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2018-10-27 06:08:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-27 06:08:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-10-27 06:08:57,079 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-10-27 06:08:57,079 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-10-27 06:08:57,079 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-10-27 06:08:57,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 87 transitions. [2018-10-27 06:08:57,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-10-27 06:08:57,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:57,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:57,081 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:57,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:57,082 INFO L793 eck$LassoCheckResult]: Stem: 6481#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6475#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 6476#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 6484#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 6479#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 6480#L555-3 [2018-10-27 06:08:57,082 INFO L795 eck$LassoCheckResult]: Loop: 6480#L555-3 assume true; 6471#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6472#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 6468#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6453#L557-9 assume true; 6454#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6464#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6467#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6470#L557-3 assume test_fun_#t~short9; 6474#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6478#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6483#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6533#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6532#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6531#L558-2 havoc test_fun_#t~mem10; 6455#L557-9 assume true; 6456#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6538#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6537#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6536#L557-3 assume test_fun_#t~short9; 6535#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6534#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6485#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6457#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6458#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6461#L558-2 havoc test_fun_#t~mem10; 6465#L557-9 assume true; 6530#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6529#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6528#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6527#L557-3 assume test_fun_#t~short9; 6526#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6525#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6524#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6523#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6522#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6521#L558-2 havoc test_fun_#t~mem10; 6520#L557-9 assume true; 6519#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6518#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6517#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6516#L557-3 assume test_fun_#t~short9; 6515#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6514#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6513#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6512#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6511#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6510#L558-2 havoc test_fun_#t~mem10; 6509#L557-9 assume true; 6508#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6507#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6506#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6505#L557-3 assume test_fun_#t~short9; 6504#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6503#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6502#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6501#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6500#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6499#L558-2 havoc test_fun_#t~mem10; 6489#L557-9 assume true; 6498#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6497#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6496#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6495#L557-3 assume test_fun_#t~short9; 6494#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6493#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6492#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6491#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6490#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6488#L558-2 havoc test_fun_#t~mem10; 6487#L557-9 assume true; 6462#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6463#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6466#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6469#L557-3 assume test_fun_#t~short9; 6473#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6477#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6482#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6459#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 6460#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 6486#L560-1 havoc test_fun_#t~mem11; 6480#L555-3 [2018-10-27 06:08:57,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 6 times [2018-10-27 06:08:57,082 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:57,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:57,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:57,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:57,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1566070944, now seen corresponding path program 6 times [2018-10-27 06:08:57,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:57,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:57,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:57,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:57,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:57,476 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-10-27 06:08:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:57,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:57,895 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:57,907 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:08:58,027 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-27 06:08:58,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:58,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:58,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:58,042 INFO L477 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 8 treesize of output 7 [2018-10-27 06:08:58,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:58,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:58,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:58,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:08:58,086 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:58,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:08:58,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:08:58,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:58,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:58,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:58,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:08:58,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:58,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:58,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:58,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:58,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:58,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:08:58,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:58,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:58,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:58,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:58,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:58,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-10-27 06:08:58,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:58,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:58,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:58,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:58,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:58,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-10-27 06:08:59,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:08:59,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:08:59,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:59,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:59,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:59,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-10-27 06:09:01,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:09:01,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:09:01,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:01,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:01,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:01,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:53, output treesize:38 [2018-10-27 06:09:03,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:09:03,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-27 06:09:03,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:03,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:03,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:03,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:45, output treesize:34 [2018-10-27 06:09:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:03,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:03,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 35 [2018-10-27 06:09:03,519 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:03,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-27 06:09:03,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=933, Unknown=2, NotChecked=0, Total=1190 [2018-10-27 06:09:03,520 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. cyclomatic complexity: 2 Second operand 35 states. [2018-10-27 06:09:07,723 WARN L179 SmtUtils]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 06:09:09,421 WARN L179 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2018-10-27 06:09:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:57,699 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-10-27 06:09:57,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-27 06:09:57,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 116 transitions. [2018-10-27 06:09:57,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 102 [2018-10-27 06:09:57,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 107 states and 108 transitions. [2018-10-27 06:09:57,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:09:57,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:09:57,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 108 transitions. [2018-10-27 06:09:57,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:57,702 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-10-27 06:09:57,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 108 transitions. [2018-10-27 06:09:57,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2018-10-27 06:09:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-27 06:09:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-10-27 06:09:57,704 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-10-27 06:09:57,704 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-10-27 06:09:57,704 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-10-27 06:09:57,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 98 transitions. [2018-10-27 06:09:57,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-10-27 06:09:57,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:57,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:57,705 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:57,705 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:57,706 INFO L793 eck$LassoCheckResult]: Stem: 7018#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7012#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 7013#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 7021#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 7016#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 7017#L555-3 [2018-10-27 06:09:57,706 INFO L795 eck$LassoCheckResult]: Loop: 7017#L555-3 assume true; 7008#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7009#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 7005#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6990#L557-9 assume true; 6991#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7001#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7004#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7007#L557-3 assume test_fun_#t~short9; 7011#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7015#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7020#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 7081#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7080#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7079#L558-2 havoc test_fun_#t~mem10; 6992#L557-9 assume true; 6993#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7086#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7085#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7084#L557-3 assume test_fun_#t~short9; 7083#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7082#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7022#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6994#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6995#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6998#L558-2 havoc test_fun_#t~mem10; 7002#L557-9 assume true; 7078#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7077#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7076#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7075#L557-3 assume test_fun_#t~short9; 7074#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7073#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7072#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 7071#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7070#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7069#L558-2 havoc test_fun_#t~mem10; 7068#L557-9 assume true; 7067#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7066#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7065#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7064#L557-3 assume test_fun_#t~short9; 7063#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7062#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7061#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 7060#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7059#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7058#L558-2 havoc test_fun_#t~mem10; 7057#L557-9 assume true; 7056#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7055#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7054#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7053#L557-3 assume test_fun_#t~short9; 7052#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7051#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7050#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 7049#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7048#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7047#L558-2 havoc test_fun_#t~mem10; 7046#L557-9 assume true; 7045#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7044#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7043#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7042#L557-3 assume test_fun_#t~short9; 7041#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7040#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7039#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 7038#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7037#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7036#L558-2 havoc test_fun_#t~mem10; 7026#L557-9 assume true; 7035#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7034#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7033#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7032#L557-3 assume test_fun_#t~short9; 7031#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7030#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7029#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 7028#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7027#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7025#L558-2 havoc test_fun_#t~mem10; 7024#L557-9 assume true; 6999#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7000#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7003#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7006#L557-3 assume test_fun_#t~short9; 7010#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7014#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7019#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9; 6996#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 6997#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 7023#L560-1 havoc test_fun_#t~mem11; 7017#L555-3 [2018-10-27 06:09:57,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:57,707 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 7 times [2018-10-27 06:09:57,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:57,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:57,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:57,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:57,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:57,721 INFO L82 PathProgramCache]: Analyzing trace with hash 267814572, now seen corresponding path program 7 times [2018-10-27 06:09:57,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:57,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:58,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:58,056 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40057f31-7f7e-487c-af95-b37c5f3a5ef8/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:58,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:58,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:58,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:09:58,095 INFO L477 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 8 treesize of output 7 [2018-10-27 06:09:58,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:09:58,113 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:58,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:09:58,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:09:58,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:58,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:09:58,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:09:58,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:09:58,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:58,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:09:58,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:09:58,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:09:58,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:58,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-10-27 06:09:58,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:09:58,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:09:58,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:58,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-10-27 06:09:58,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:09:58,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:09:58,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:58,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-10-27 06:10:10,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:10:10,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:10:10,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:10,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:10,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:10,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:53, output treesize:38 [2018-10-27 06:10:41,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-27 06:10:41,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 15 [2018-10-27 06:10:41,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:41,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:41,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:41,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:58, output treesize:43 [2018-10-27 06:11:18,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:11:18,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-27 06:11:18,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:18,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:18,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-10-27 06:11:18,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:50, output treesize:39 [2018-10-27 06:11:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:18,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:18,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 40 [2018-10-27 06:11:18,404 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:18,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-27 06:11:18,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1228, Unknown=10, NotChecked=0, Total=1560 [2018-10-27 06:11:18,405 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. cyclomatic complexity: 2 Second operand 40 states. [2018-10-27 06:11:21,084 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2018-10-27 06:11:23,422 WARN L179 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:11:29,758 WARN L179 SmtUtils]: Spent 4.38 s on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:11:33,454 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-27 06:11:50,831 WARN L179 SmtUtils]: Spent 9.93 s on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-10-27 06:12:31,769 WARN L179 SmtUtils]: Spent 23.87 s on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-10-27 06:12:39,887 WARN L179 SmtUtils]: Spent 5.85 s on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-10-27 06:12:41,640 WARN L179 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-10-27 06:13:14,087 WARN L179 SmtUtils]: Spent 20.85 s on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-10-27 06:13:30,458 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2018-10-27 06:13:30,459 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:980) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-10-27 06:13:30,463 INFO L168 Benchmark]: Toolchain (without parser) took 314614.50 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 414.7 MB). Free memory was 958.5 MB in the beginning and 1.0 GB in the end (delta: -69.7 MB). Peak memory consumption was 345.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:30,463 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:13:30,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.19 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 937.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:30,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 937.0 MB in the beginning and 1.2 GB in the end (delta: -226.7 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:30,464 INFO L168 Benchmark]: Boogie Preprocessor took 29.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:30,464 INFO L168 Benchmark]: RCFGBuilder took 595.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:30,464 INFO L168 Benchmark]: BuchiAutomizer took 313471.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.9 MB). Peak memory consumption was 354.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:30,467 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.19 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 937.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 937.0 MB in the beginning and 1.2 GB in the end (delta: -226.7 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 595.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 313471.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.9 MB). Peak memory consumption was 354.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...