./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array16_alloca_original.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array16_alloca_original.i -s /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/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 b6c8e92f4d5413ae33bafe73b9024f19a73a1964 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 03:20:41,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:20:41,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:20:42,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:20:42,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:20:42,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:20:42,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:20:42,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:20:42,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:20:42,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:20:42,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:20:42,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:20:42,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:20:42,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:20:42,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:20:42,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:20:42,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:20:42,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:20:42,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:20:42,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:20:42,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:20:42,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:20:42,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:20:42,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:20:42,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:20:42,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:20:42,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:20:42,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:20:42,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:20:42,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:20:42,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:20:42,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:20:42,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:20:42,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:20:42,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:20:42,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:20:42,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:20:42,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:20:42,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:20:42,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:20:42,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:20:42,120 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-11-28 03:20:42,173 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:20:42,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:20:42,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:20:42,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:20:42,178 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:20:42,178 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:20:42,178 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:20:42,179 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:20:42,179 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:20:42,179 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:20:42,181 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:20:42,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:20:42,181 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:20:42,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:20:42,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:20:42,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:20:42,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:20:42,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:20:42,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:20:42,183 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:20:42,183 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:20:42,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:20:42,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:20:42,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:20:42,185 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:20:42,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:20:42,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:20:42,186 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:20:42,186 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:20:42,188 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:20:42,189 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/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 -> b6c8e92f4d5413ae33bafe73b9024f19a73a1964 [2020-11-28 03:20:42,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:20:42,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:20:42,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:20:42,530 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:20:42,531 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:20:42,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/../../sv-benchmarks/c/termination-15/array16_alloca_original.i [2020-11-28 03:20:42,621 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/data/33c9881c4/6406b5f421c840ca935db414166f5867/FLAG6ed2cdcf9 [2020-11-28 03:20:43,260 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:20:43,260 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/sv-benchmarks/c/termination-15/array16_alloca_original.i [2020-11-28 03:20:43,272 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/data/33c9881c4/6406b5f421c840ca935db414166f5867/FLAG6ed2cdcf9 [2020-11-28 03:20:43,509 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/data/33c9881c4/6406b5f421c840ca935db414166f5867 [2020-11-28 03:20:43,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:20:43,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:20:43,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:20:43,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:20:43,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:20:43,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:43" (1/1) ... [2020-11-28 03:20:43,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2fa8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:43, skipping insertion in model container [2020-11-28 03:20:43,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:43" (1/1) ... [2020-11-28 03:20:43,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:20:43,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:20:44,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:20:44,024 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:20:44,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:20:44,196 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:20:44,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:44 WrapperNode [2020-11-28 03:20:44,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:20:44,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:20:44,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:20:44,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:20:44,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:44" (1/1) ... [2020-11-28 03:20:44,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:44" (1/1) ... [2020-11-28 03:20:44,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:20:44,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:20:44,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:20:44,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:20:44,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:44" (1/1) ... [2020-11-28 03:20:44,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:44" (1/1) ... [2020-11-28 03:20:44,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:44" (1/1) ... [2020-11-28 03:20:44,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:44" (1/1) ... [2020-11-28 03:20:44,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:44" (1/1) ... [2020-11-28 03:20:44,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:44" (1/1) ... [2020-11-28 03:20:44,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:44" (1/1) ... [2020-11-28 03:20:44,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:20:44,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:20:44,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:20:44,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:20:44,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/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 [2020-11-28 03:20:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-28 03:20:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:20:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:20:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:20:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:20:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:20:44,711 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:20:44,711 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-28 03:20:44,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:44 BoogieIcfgContainer [2020-11-28 03:20:44,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:20:44,714 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:20:44,714 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:20:44,718 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:20:44,719 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:20:44,719 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:20:43" (1/3) ... [2020-11-28 03:20:44,721 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17dd15b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:20:44, skipping insertion in model container [2020-11-28 03:20:44,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:20:44,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:44" (2/3) ... [2020-11-28 03:20:44,722 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17dd15b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:20:44, skipping insertion in model container [2020-11-28 03:20:44,722 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:20:44,722 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:44" (3/3) ... [2020-11-28 03:20:44,724 INFO L373 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original.i [2020-11-28 03:20:44,826 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:20:44,826 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:20:44,826 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:20:44,826 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:20:44,826 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:20:44,827 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:20:44,827 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:20:44,827 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:20:44,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-11-28 03:20:44,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-11-28 03:20:44,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:44,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:44,866 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-28 03:20:44,866 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 03:20:44,867 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:20:44,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-11-28 03:20:44,869 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-11-28 03:20:44,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:44,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:44,870 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-28 03:20:44,870 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 03:20:44,878 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2020-11-28 03:20:44,879 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2020-11-28 03:20:44,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:44,886 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-11-28 03:20:44,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:44,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909263635] [2020-11-28 03:20:44,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:45,018 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:45,032 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:45,054 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:45,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:45,056 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2020-11-28 03:20:45,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:45,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264573091] [2020-11-28 03:20:45,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:45,083 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:45,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:45,104 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:45,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:45,106 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2020-11-28 03:20:45,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:45,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498593197] [2020-11-28 03:20:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:45,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:45,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:45,172 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:45,568 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:20:45,569 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:20:45,569 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:20:45,569 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:20:45,569 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:20:45,569 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:45,569 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:20:45,570 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:20:45,570 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration1_Lasso [2020-11-28 03:20:45,570 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:20:45,570 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:20:45,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:45,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:45,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:45,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:45,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:45,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:45,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:45,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:45,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:45,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:45,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:45,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:46,119 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:20:46,125 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:20:46,151 INFO L120 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 [2020-11-28 03:20:46,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:46,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:20:46,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:46,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:46,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:46,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:20:46,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:20:46,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:20:46,231 INFO L120 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 [2020-11-28 03:20:46,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:46,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:20:46,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:46,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:46,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:46,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:20:46,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:46,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:20:46,288 INFO L120 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 [2020-11-28 03:20:46,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:46,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:20:46,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:46,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:46,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:46,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:20:46,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:46,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:20:46,343 INFO L120 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 [2020-11-28 03:20:46,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:46,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:20:46,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:46,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:46,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:46,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:20:46,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:46,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:20:46,430 INFO L120 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 [2020-11-28 03:20:46,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:46,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:46,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:46,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:46,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:20:46,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:46,442 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:46,480 INFO L120 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 [2020-11-28 03:20:46,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:46,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:20:46,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:46,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:46,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:46,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:20:46,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:20:46,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:20:46,541 INFO L120 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 [2020-11-28 03:20:46,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:46,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:46,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:46,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:46,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:20:46,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:20:46,587 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:20:46,625 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-11-28 03:20:46,625 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:20:46,634 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:46,638 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-28 03:20:46,639 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:20:46,639 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-11-28 03:20:46,689 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-11-28 03:20:46,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:46,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:20:46,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:20:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:46,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 03:20:46,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:20:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:46,824 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-28 03:20:46,826 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-11-28 03:20:46,908 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2020-11-28 03:20:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-28 03:20:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 03:20:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-11-28 03:20:46,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2020-11-28 03:20:46,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:20:46,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2020-11-28 03:20:46,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:20:46,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2020-11-28 03:20:46,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:20:46,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2020-11-28 03:20:46,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-28 03:20:46,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2020-11-28 03:20:46,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-11-28 03:20:46,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-11-28 03:20:46,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2020-11-28 03:20:46,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:46,938 INFO L691 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-11-28 03:20:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2020-11-28 03:20:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-11-28 03:20:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-11-28 03:20:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-11-28 03:20:46,971 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-11-28 03:20:46,971 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-11-28 03:20:46,971 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:20:46,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2020-11-28 03:20:46,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-28 03:20:46,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:46,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:46,975 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:46,976 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 03:20:46,976 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2020-11-28 03:20:46,976 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 118#L378-2 [2020-11-28 03:20:46,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:46,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2020-11-28 03:20:46,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:46,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825437828] [2020-11-28 03:20:46,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:47,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825437828] [2020-11-28 03:20:47,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:20:47,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:20:47,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73666046] [2020-11-28 03:20:47,089 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:20:47,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:47,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2020-11-28 03:20:47,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:47,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656352208] [2020-11-28 03:20:47,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:47,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:47,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:47,142 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:47,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:47,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:47,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:20:47,249 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-11-28 03:20:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:47,293 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-11-28 03:20:47,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:20:47,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-11-28 03:20:47,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-28 03:20:47,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2020-11-28 03:20:47,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-11-28 03:20:47,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-11-28 03:20:47,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-11-28 03:20:47,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:20:47,296 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-28 03:20:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-11-28 03:20:47,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-11-28 03:20:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-11-28 03:20:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-11-28 03:20:47,298 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-11-28 03:20:47,298 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-11-28 03:20:47,298 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:20:47,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-11-28 03:20:47,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-28 03:20:47,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:47,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:47,300 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:47,300 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 03:20:47,301 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2020-11-28 03:20:47,301 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 151#L378-2 [2020-11-28 03:20:47,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:47,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2020-11-28 03:20:47,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:47,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470964484] [2020-11-28 03:20:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:47,326 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:47,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:47,358 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:47,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:47,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2020-11-28 03:20:47,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:47,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249967058] [2020-11-28 03:20:47,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:47,383 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:47,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:47,399 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:47,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:47,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2020-11-28 03:20:47,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:47,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268026617] [2020-11-28 03:20:47,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:47,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:47,499 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:47,504 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:47,658 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2020-11-28 03:20:47,893 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2020-11-28 03:20:48,926 WARN L193 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2020-11-28 03:20:48,949 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:20:48,950 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:20:48,950 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:20:48,950 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:20:48,950 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:20:48,950 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:48,950 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:20:48,950 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:20:48,950 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration3_Lasso [2020-11-28 03:20:48,950 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:20:48,950 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:20:48,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:49,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:49,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:49,050 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2020-11-28 03:20:49,746 WARN L193 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2020-11-28 03:20:49,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:49,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:49,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:49,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:49,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:49,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:49,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:49,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:50,125 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2020-11-28 03:20:50,514 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-11-28 03:20:50,564 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:20:50,564 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:50,573 INFO L120 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 [2020-11-28 03:20:50,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:50,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:20:50,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:50,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:50,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:50,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:20:50,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:20:50,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:50,608 INFO L120 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 [2020-11-28 03:20:50,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:50,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:20:50,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:50,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:50,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:50,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:20:50,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:20:50,612 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:50,639 INFO L120 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 [2020-11-28 03:20:50,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:50,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:50,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:50,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:50,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:20:50,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:20:50,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:20:50,716 INFO L120 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 [2020-11-28 03:20:50,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:50,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:50,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:50,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:50,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:20:50,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:50,747 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:20:50,811 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2020-11-28 03:20:50,811 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:20:50,818 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:50,822 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-28 03:20:50,822 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:20:50,822 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-11-28 03:20:50,874 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-11-28 03:20:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:50,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:20:50,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:20:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:50,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 03:20:50,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:20:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:50,945 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-28 03:20:50,945 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-11-28 03:20:51,124 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2020-11-28 03:20:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-28 03:20:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 03:20:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-11-28 03:20:51,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2020-11-28 03:20:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:20:51,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2020-11-28 03:20:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:20:51,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2020-11-28 03:20:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:20:51,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2020-11-28 03:20:51,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-28 03:20:51,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2020-11-28 03:20:51,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 03:20:51,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-28 03:20:51,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-11-28 03:20:51,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:20:51,129 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-11-28 03:20:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-11-28 03:20:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-11-28 03:20:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-28 03:20:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-11-28 03:20:51,132 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-11-28 03:20:51,132 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-11-28 03:20:51,132 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:20:51,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-11-28 03:20:51,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-28 03:20:51,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:51,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:51,134 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:51,135 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 03:20:51,135 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 245#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 246#L367 assume !(main_~length~0 < 1); 255#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 243#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 254#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 250#L378-2 [2020-11-28 03:20:51,135 INFO L796 eck$LassoCheckResult]: Loop: 250#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 251#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 250#L378-2 [2020-11-28 03:20:51,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:51,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2020-11-28 03:20:51,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:51,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231721532] [2020-11-28 03:20:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:51,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:51,189 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:51,197 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:51,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2020-11-28 03:20:51,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:51,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000064823] [2020-11-28 03:20:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:51,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:51,228 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:51,230 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:51,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:51,230 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2020-11-28 03:20:51,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:51,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438353315] [2020-11-28 03:20:51,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 03:20:51,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438353315] [2020-11-28 03:20:51,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202949253] [2020-11-28 03:20:51,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:20:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:51,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-28 03:20:51,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:20:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 03:20:51,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-28 03:20:51,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-11-28 03:20:51,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598952161] [2020-11-28 03:20:51,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:51,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:20:51,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:20:51,561 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-11-28 03:20:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:51,590 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-11-28 03:20:51,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:20:51,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2020-11-28 03:20:51,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-28 03:20:51,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2020-11-28 03:20:51,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-28 03:20:51,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-28 03:20:51,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2020-11-28 03:20:51,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:20:51,593 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-11-28 03:20:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2020-11-28 03:20:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-11-28 03:20:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-28 03:20:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-11-28 03:20:51,596 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-11-28 03:20:51,596 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-11-28 03:20:51,596 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:20:51,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-11-28 03:20:51,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-28 03:20:51,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:51,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:51,598 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:51,599 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 03:20:51,599 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 327#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 328#L367 assume !(main_~length~0 < 1); 337#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 338#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 339#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 329#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 330#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 340#L370-3 assume !(main_~i~0 < main_~length~0); 331#L370-4 main_~j~0 := 0; 332#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 334#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 335#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 336#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 341#L378-2 [2020-11-28 03:20:51,599 INFO L796 eck$LassoCheckResult]: Loop: 341#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 342#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 341#L378-2 [2020-11-28 03:20:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:51,600 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2020-11-28 03:20:51,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:51,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481532998] [2020-11-28 03:20:51,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:51,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481532998] [2020-11-28 03:20:51,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909288218] [2020-11-28 03:20:51,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:20:51,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 03:20:51,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:20:51,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-28 03:20:51,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:20:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:51,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:20:51,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-11-28 03:20:51,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983140290] [2020-11-28 03:20:51,832 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:20:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:51,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2020-11-28 03:20:51,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:51,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355420412] [2020-11-28 03:20:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:51,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:51,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:51,847 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:51,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:51,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-28 03:20:51,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-28 03:20:51,937 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 10 states. [2020-11-28 03:20:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:52,143 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-11-28 03:20:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-28 03:20:52,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2020-11-28 03:20:52,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-28 03:20:52,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 27 transitions. [2020-11-28 03:20:52,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-28 03:20:52,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-28 03:20:52,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2020-11-28 03:20:52,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:20:52,147 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-11-28 03:20:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2020-11-28 03:20:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-11-28 03:20:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-28 03:20:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-11-28 03:20:52,150 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-11-28 03:20:52,150 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-11-28 03:20:52,150 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-28 03:20:52,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-11-28 03:20:52,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-28 03:20:52,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:52,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:52,152 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:52,152 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 03:20:52,152 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 440#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 441#L367 assume !(main_~length~0 < 1); 450#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 451#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 452#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 455#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 453#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 454#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 438#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 439#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 456#L370-3 assume !(main_~i~0 < main_~length~0); 442#L370-4 main_~j~0 := 0; 443#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 449#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 447#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 448#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 445#L378-2 [2020-11-28 03:20:52,152 INFO L796 eck$LassoCheckResult]: Loop: 445#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 446#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 445#L378-2 [2020-11-28 03:20:52,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:52,153 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2020-11-28 03:20:52,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:52,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106577045] [2020-11-28 03:20:52,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:52,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:52,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:52,320 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2020-11-28 03:20:52,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:52,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743572135] [2020-11-28 03:20:52,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:52,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:52,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:52,344 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:52,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2020-11-28 03:20:52,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:52,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368493515] [2020-11-28 03:20:52,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:52,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:52,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:52,458 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:53,043 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 121 [2020-11-28 03:20:54,172 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 249 DAG size of output: 76 [2020-11-28 03:20:54,175 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:20:54,175 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:20:54,175 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:20:54,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:20:54,176 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:20:54,176 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:54,176 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:20:54,176 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:20:54,176 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration6_Lasso [2020-11-28 03:20:54,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:20:54,176 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:20:54,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:54,371 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2020-11-28 03:20:54,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:54,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:54,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:54,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:54,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:54,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:54,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:54,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:54,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:54,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:54,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:20:55,008 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:20:55,009 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:20:55,022 INFO L120 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 [2020-11-28 03:20:55,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:55,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:55,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:55,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:55,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:20:55,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:55,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:55,073 INFO L120 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 [2020-11-28 03:20:55,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:55,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:55,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:55,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:55,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:20:55,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:20:55,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:55,117 INFO L120 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 [2020-11-28 03:20:55,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:55,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:55,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:55,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:55,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:20:55,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:20:55,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:20:55,184 INFO L120 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 [2020-11-28 03:20:55,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:20:55,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:20:55,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:20:55,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:20:55,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:20:55,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:55,212 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:20:55,250 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-11-28 03:20:55,251 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:20:55,257 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-28 03:20:55,262 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-28 03:20:55,262 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:20:55,262 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-11-28 03:20:55,321 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-11-28 03:20:55,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:55,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:20:55,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:20:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:55,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 03:20:55,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:20:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:20:55,390 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-28 03:20:55,390 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-11-28 03:20:55,408 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 5 states. [2020-11-28 03:20:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-28 03:20:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 03:20:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-11-28 03:20:55,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2020-11-28 03:20:55,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:20:55,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 19 letters. Loop has 2 letters. [2020-11-28 03:20:55,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:20:55,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 4 letters. [2020-11-28 03:20:55,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:20:55,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2020-11-28 03:20:55,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-28 03:20:55,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2020-11-28 03:20:55,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-11-28 03:20:55,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-28 03:20:55,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2020-11-28 03:20:55,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:20:55,413 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-11-28 03:20:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2020-11-28 03:20:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-11-28 03:20:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-28 03:20:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-11-28 03:20:55,415 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-11-28 03:20:55,415 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-11-28 03:20:55,415 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-28 03:20:55,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-11-28 03:20:55,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-28 03:20:55,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:55,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:55,417 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:55,417 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 03:20:55,417 INFO L794 eck$LassoCheckResult]: Stem: 580#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 574#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 575#L367 assume !(main_~length~0 < 1); 586#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 587#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 588#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 592#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 589#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 590#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 576#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 577#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 593#L370-3 assume !(main_~i~0 < main_~length~0); 578#L370-4 main_~j~0 := 0; 579#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 585#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 583#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 584#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 591#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 594#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 581#L378-2 [2020-11-28 03:20:55,417 INFO L796 eck$LassoCheckResult]: Loop: 581#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 582#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 581#L378-2 [2020-11-28 03:20:55,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:55,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2020-11-28 03:20:55,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:55,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717505640] [2020-11-28 03:20:55,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:20:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-28 03:20:55,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717505640] [2020-11-28 03:20:55,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076811487] [2020-11-28 03:20:55,713 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:20:55,768 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-11-28 03:20:55,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:20:55,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-28 03:20:55,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:20:55,908 INFO L384 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 25 treesize of output 9 [2020-11-28 03:20:55,909 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-28 03:20:55,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:20:55,917 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-28 03:20:55,917 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:5 [2020-11-28 03:20:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-28 03:20:55,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:20:55,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-11-28 03:20:55,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879378258] [2020-11-28 03:20:55,928 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:20:55,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:55,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2020-11-28 03:20:55,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:55,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012859823] [2020-11-28 03:20:55,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:55,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:55,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:55,938 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:56,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:20:56,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-28 03:20:56,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-11-28 03:20:56,061 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 12 states. [2020-11-28 03:20:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:20:56,289 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2020-11-28 03:20:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:20:56,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2020-11-28 03:20:56,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-28 03:20:56,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 46 transitions. [2020-11-28 03:20:56,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-28 03:20:56,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-28 03:20:56,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2020-11-28 03:20:56,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:20:56,296 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-11-28 03:20:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2020-11-28 03:20:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2020-11-28 03:20:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-28 03:20:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-11-28 03:20:56,300 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-11-28 03:20:56,300 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-11-28 03:20:56,300 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-28 03:20:56,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2020-11-28 03:20:56,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-28 03:20:56,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:20:56,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:20:56,303 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:20:56,303 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-28 03:20:56,303 INFO L794 eck$LassoCheckResult]: Stem: 717#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 711#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 712#L367 assume !(main_~length~0 < 1); 722#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 723#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 724#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 713#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 714#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 730#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 731#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 725#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 726#L370-3 assume !(main_~i~0 < main_~length~0); 715#L370-4 main_~j~0 := 0; 716#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 718#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 719#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 720#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 727#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 743#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 741#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 738#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 736#L378-2 [2020-11-28 03:20:56,303 INFO L796 eck$LassoCheckResult]: Loop: 736#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 732#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 733#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 737#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 736#L378-2 [2020-11-28 03:20:56,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:56,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1142942490, now seen corresponding path program 6 times [2020-11-28 03:20:56,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:56,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475722472] [2020-11-28 03:20:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:56,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:56,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:56,380 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:56,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2020-11-28 03:20:56,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:56,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412588778] [2020-11-28 03:20:56,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:56,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:56,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:56,394 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:20:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash -227346514, now seen corresponding path program 7 times [2020-11-28 03:20:56,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:20:56,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754299677] [2020-11-28 03:20:56,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:20:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:56,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:20:56,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:20:56,509 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:20:57,249 WARN L193 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 134 [2020-11-28 03:20:58,051 WARN L193 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 79 [2020-11-28 03:20:58,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:20:58 BoogieIcfgContainer [2020-11-28 03:20:58,098 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:20:58,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:20:58,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:20:58,099 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:20:58,100 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:44" (3/4) ... [2020-11-28 03:20:58,103 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-28 03:20:58,175 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_84d1c158-b5ae-44f4-85a3-e944ec094e24/bin/uautomizer/witness.graphml [2020-11-28 03:20:58,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:20:58,179 INFO L168 Benchmark]: Toolchain (without parser) took 14662.72 ms. Allocated memory was 94.4 MB in the beginning and 222.3 MB in the end (delta: 127.9 MB). Free memory was 62.8 MB in the beginning and 80.2 MB in the end (delta: -17.4 MB). Peak memory consumption was 110.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:58,180 INFO L168 Benchmark]: CDTParser took 3.89 ms. Allocated memory is still 94.4 MB. Free memory is still 54.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:20:58,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.17 ms. Allocated memory was 94.4 MB in the beginning and 125.8 MB in the end (delta: 31.5 MB). Free memory was 62.6 MB in the beginning and 86.4 MB in the end (delta: -23.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:58,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.17 ms. Allocated memory is still 125.8 MB. Free memory was 86.4 MB in the beginning and 84.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:58,181 INFO L168 Benchmark]: Boogie Preprocessor took 28.68 ms. Allocated memory is still 125.8 MB. Free memory was 84.8 MB in the beginning and 83.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:58,182 INFO L168 Benchmark]: RCFGBuilder took 417.17 ms. Allocated memory is still 125.8 MB. Free memory was 83.3 MB in the beginning and 70.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:58,182 INFO L168 Benchmark]: BuchiAutomizer took 13384.34 ms. Allocated memory was 125.8 MB in the beginning and 222.3 MB in the end (delta: 96.5 MB). Free memory was 70.2 MB in the beginning and 82.3 MB in the end (delta: -12.1 MB). Peak memory consumption was 94.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:58,183 INFO L168 Benchmark]: Witness Printer took 78.87 ms. Allocated memory is still 222.3 MB. Free memory was 82.3 MB in the beginning and 80.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:20:58,188 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.89 ms. Allocated memory is still 94.4 MB. Free memory is still 54.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 680.17 ms. Allocated memory was 94.4 MB in the beginning and 125.8 MB in the end (delta: 31.5 MB). Free memory was 62.6 MB in the beginning and 86.4 MB in the end (delta: -23.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.17 ms. Allocated memory is still 125.8 MB. Free memory was 86.4 MB in the beginning and 84.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.68 ms. Allocated memory is still 125.8 MB. Free memory was 84.8 MB in the beginning and 83.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 417.17 ms. Allocated memory is still 125.8 MB. Free memory was 83.3 MB in the beginning and 70.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 13384.34 ms. Allocated memory was 125.8 MB in the beginning and 222.3 MB in the end (delta: 96.5 MB). Free memory was 70.2 MB in the beginning and 82.3 MB in the end (delta: -12.1 MB). Peak memory consumption was 94.2 MB. Max. memory is 16.1 GB. * Witness Printer took 78.87 ms. Allocated memory is still 222.3 MB. Free memory was 82.3 MB in the beginning and 80.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.3s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 12.0s. Construction of modules took 0.4s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 79 SDtfs, 101 SDslu, 93 SDs, 0 SdLazy, 198 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital295 mio100 ax100 hnf98 lsp115 ukn62 mio100 lsp62 div136 bol100 ite100 ukn100 eq164 hnf73 smp71 dnf155 smp82 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@448d3b59=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b03a55f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4602b463=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@540d7b6e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4602b463=2, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@4dbe6e18=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@56f456ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@48ca1dca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@511a672d=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i