./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array13_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array13_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G --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 bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 14:09:59,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 14:09:59,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 14:09:59,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 14:09:59,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 14:09:59,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 14:09:59,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 14:09:59,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 14:09:59,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 14:09:59,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 14:09:59,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 14:09:59,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 14:09:59,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 14:09:59,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 14:09:59,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 14:09:59,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 14:09:59,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 14:09:59,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 14:09:59,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 14:09:59,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 14:09:59,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 14:09:59,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 14:09:59,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 14:09:59,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 14:09:59,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 14:09:59,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 14:09:59,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 14:09:59,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 14:09:59,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 14:09:59,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 14:09:59,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 14:09:59,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 14:09:59,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 14:09:59,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 14:09:59,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 14:09:59,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 14:09:59,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 14:09:59,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 14:09:59,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 14:09:59,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 14:09:59,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 14:09:59,642 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-11-23 14:09:59,669 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 14:09:59,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 14:09:59,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 14:09:59,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 14:09:59,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 14:09:59,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 14:09:59,672 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 14:09:59,672 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-23 14:09:59,673 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-23 14:09:59,673 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-23 14:09:59,673 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-23 14:09:59,673 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-23 14:09:59,673 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-23 14:09:59,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 14:09:59,674 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 14:09:59,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 14:09:59,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 14:09:59,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-23 14:09:59,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-23 14:09:59,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-23 14:09:59,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 14:09:59,676 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-23 14:09:59,676 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 14:09:59,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-23 14:09:59,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 14:09:59,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 14:09:59,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 14:09:59,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 14:09:59,677 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 14:09:59,679 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-23 14:09:59,679 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_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/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_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G 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 -> bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff [2021-11-23 14:09:59,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 14:10:00,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 14:10:00,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 14:10:00,013 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 14:10:00,014 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 14:10:00,015 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/termination-15/array13_alloca.i [2021-11-23 14:10:00,079 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/data/780b6982f/25b306a5b28e4a038a604362adba32b0/FLAGc8a1a8646 [2021-11-23 14:10:00,753 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 14:10:00,753 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/sv-benchmarks/c/termination-15/array13_alloca.i [2021-11-23 14:10:00,773 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/data/780b6982f/25b306a5b28e4a038a604362adba32b0/FLAGc8a1a8646 [2021-11-23 14:10:01,043 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/data/780b6982f/25b306a5b28e4a038a604362adba32b0 [2021-11-23 14:10:01,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 14:10:01,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 14:10:01,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 14:10:01,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 14:10:01,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 14:10:01,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:10:01" (1/1) ... [2021-11-23 14:10:01,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b5ab63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01, skipping insertion in model container [2021-11-23 14:10:01,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:10:01" (1/1) ... [2021-11-23 14:10:01,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 14:10:01,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 14:10:01,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 14:10:01,419 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 14:10:01,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 14:10:01,493 INFO L208 MainTranslator]: Completed translation [2021-11-23 14:10:01,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01 WrapperNode [2021-11-23 14:10:01,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 14:10:01,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 14:10:01,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 14:10:01,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 14:10:01,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01" (1/1) ... [2021-11-23 14:10:01,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01" (1/1) ... [2021-11-23 14:10:01,539 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2021-11-23 14:10:01,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 14:10:01,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 14:10:01,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 14:10:01,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 14:10:01,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01" (1/1) ... [2021-11-23 14:10:01,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01" (1/1) ... [2021-11-23 14:10:01,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01" (1/1) ... [2021-11-23 14:10:01,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01" (1/1) ... [2021-11-23 14:10:01,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01" (1/1) ... [2021-11-23 14:10:01,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01" (1/1) ... [2021-11-23 14:10:01,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01" (1/1) ... [2021-11-23 14:10:01,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 14:10:01,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 14:10:01,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 14:10:01,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 14:10:01,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01" (1/1) ... [2021-11-23 14:10:01,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:10:01,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:01,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:10:01,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-23 14:10:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 14:10:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 14:10:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 14:10:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 14:10:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 14:10:01,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 14:10:01,726 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 14:10:01,728 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 14:10:01,916 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 14:10:01,930 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 14:10:01,930 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-23 14:10:01,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:10:01 BoogieIcfgContainer [2021-11-23 14:10:01,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 14:10:01,933 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-23 14:10:01,933 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-23 14:10:01,951 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-23 14:10:01,952 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-23 14:10:01,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:10:01" (1/3) ... [2021-11-23 14:10:01,954 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65b5388e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:10:01, skipping insertion in model container [2021-11-23 14:10:01,954 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-23 14:10:01,955 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:10:01" (2/3) ... [2021-11-23 14:10:01,955 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65b5388e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:10:01, skipping insertion in model container [2021-11-23 14:10:01,955 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-23 14:10:01,955 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:10:01" (3/3) ... [2021-11-23 14:10:01,957 INFO L388 chiAutomizerObserver]: Analyzing ICFG array13_alloca.i [2021-11-23 14:10:02,018 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-23 14:10:02,019 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-23 14:10:02,019 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-23 14:10:02,019 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-23 14:10:02,019 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-23 14:10:02,020 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-23 14:10:02,020 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-23 14:10:02,020 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-23 14:10:02,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:02,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-23 14:10:02,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:10:02,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:10:02,064 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-23 14:10:02,064 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-23 14:10:02,064 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-23 14:10:02,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:02,067 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-23 14:10:02,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:10:02,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:10:02,068 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-23 14:10:02,068 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-23 14:10:02,075 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 8#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 5#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6#L370-3true [2021-11-23 14:10:02,076 INFO L793 eck$LassoCheckResult]: Loop: 6#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13#L372true assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 6#L370-3true [2021-11-23 14:10:02,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:02,081 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2021-11-23 14:10:02,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:02,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914982067] [2021-11-23 14:10:02,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:02,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:02,222 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:02,252 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2021-11-23 14:10:02,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:02,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850225496] [2021-11-23 14:10:02,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:02,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:02,272 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:02,288 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:02,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2021-11-23 14:10:02,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:02,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862044457] [2021-11-23 14:10:02,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:02,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:02,345 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:02,375 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:02,748 INFO L210 LassoAnalysis]: Preferences: [2021-11-23 14:10:02,749 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-23 14:10:02,749 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-23 14:10:02,749 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-23 14:10:02,749 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-23 14:10:02,750 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:10:02,750 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-23 14:10:02,750 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-23 14:10:02,750 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration1_Lasso [2021-11-23 14:10:02,750 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-23 14:10:02,750 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-23 14:10:02,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:10:02,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:10:02,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:10:02,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:10:02,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:10:02,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:10:02,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:10:02,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:10:02,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:10:02,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:10:02,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:10:02,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:10:03,186 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-23 14:10:03,191 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-23 14:10:03,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:10:03,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:03,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:10:03,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:10:03,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:10:03,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-23 14:10:03,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:10:03,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:10:03,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:10:03,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-23 14:10:03,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-23 14:10:03,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-23 14:10:03,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-23 14:10:03,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-11-23 14:10:03,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:10:03,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:03,280 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:10:03,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:10:03,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:10:03,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:10:03,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:10:03,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:10:03,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-23 14:10:03,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-23 14:10:03,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-23 14:10:03,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-23 14:10:03,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-11-23 14:10:03,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:10:03,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:03,372 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:10:03,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:10:03,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:10:03,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-23 14:10:03,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:10:03,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:10:03,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:10:03,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-23 14:10:03,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-23 14:10:03,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-23 14:10:03,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-23 14:10:03,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-23 14:10:03,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:10:03,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:03,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:10:03,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:10:03,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:10:03,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-23 14:10:03,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:10:03,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:10:03,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:10:03,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-23 14:10:03,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-23 14:10:03,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-23 14:10:03,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-23 14:10:03,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-11-23 14:10:03,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:10:03,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:03,519 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:10:03,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:10:03,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:10:03,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-23 14:10:03,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:10:03,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:10:03,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:10:03,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-23 14:10:03,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-23 14:10:03,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-23 14:10:03,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-23 14:10:03,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-11-23 14:10:03,597 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:10:03,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:03,598 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:10:03,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:10:03,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-23 14:10:03,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:10:03,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:10:03,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:10:03,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:10:03,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-23 14:10:03,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-23 14:10:03,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-23 14:10:03,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-23 14:10:03,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:10:03,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:03,691 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:10:03,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-23 14:10:03,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:10:03,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:10:03,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:10:03,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:10:03,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:10:03,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-23 14:10:03,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-23 14:10:03,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-23 14:10:03,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-23 14:10:03,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:10:03,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:03,794 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:10:03,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:10:03,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-23 14:10:03,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:10:03,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:10:03,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:10:03,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:10:03,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-23 14:10:03,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-23 14:10:03,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-23 14:10:03,879 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2021-11-23 14:10:03,880 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-11-23 14:10:03,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:10:03,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:03,883 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:10:03,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-23 14:10:03,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-23 14:10:03,921 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-23 14:10:03,921 INFO L513 LassoAnalysis]: Proved termination. [2021-11-23 14:10:03,922 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~arr~0#1.offset) = -4*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 1*ULTIMATE.start_main_~arr~0#1.offset Supporting invariants [] [2021-11-23 14:10:03,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-11-23 14:10:03,971 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-11-23 14:10:03,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:04,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 14:10:04,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:10:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:04,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 14:10:04,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:10:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:04,107 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 [2021-11-23 14:10:04,109 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:04,181 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 50 transitions. Complement of second has 7 states. [2021-11-23 14:10:04,183 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 [2021-11-23 14:10:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-11-23 14:10:04,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2021-11-23 14:10:04,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-23 14:10:04,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2021-11-23 14:10:04,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-23 14:10:04,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2021-11-23 14:10:04,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-23 14:10:04,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2021-11-23 14:10:04,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:04,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2021-11-23 14:10:04,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-11-23 14:10:04,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-11-23 14:10:04,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2021-11-23 14:10:04,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:10:04,227 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-11-23 14:10:04,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2021-11-23 14:10:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-23 14:10:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2021-11-23 14:10:04,264 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-11-23 14:10:04,265 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-11-23 14:10:04,265 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-23 14:10:04,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2021-11-23 14:10:04,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:04,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:10:04,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:10:04,275 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:10:04,275 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:10:04,276 INFO L791 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 114#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 121#L367 assume !(main_~length~0#1 < 1); 115#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 116#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 117#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 118#L370-4 main_~j~0#1 := 0; 119#L378-2 [2021-11-23 14:10:04,276 INFO L793 eck$LassoCheckResult]: Loop: 119#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 120#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 119#L378-2 [2021-11-23 14:10:04,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:04,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2021-11-23 14:10:04,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:04,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599402363] [2021-11-23 14:10:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:04,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:04,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:10:04,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599402363] [2021-11-23 14:10:04,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599402363] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:10:04,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:10:04,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:10:04,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326410575] [2021-11-23 14:10:04,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:10:04,392 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-23 14:10:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:04,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2021-11-23 14:10:04,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:04,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051636565] [2021-11-23 14:10:04,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:04,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:04,410 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:04,431 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:04,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:10:04,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 14:10:04,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:10:04,502 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:10:04,534 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2021-11-23 14:10:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 14:10:04,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2021-11-23 14:10:04,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:04,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2021-11-23 14:10:04,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-11-23 14:10:04,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-11-23 14:10:04,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-11-23 14:10:04,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:10:04,542 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-11-23 14:10:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-11-23 14:10:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2021-11-23 14:10:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-11-23 14:10:04,545 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-11-23 14:10:04,545 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-11-23 14:10:04,545 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-23 14:10:04,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-11-23 14:10:04,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:04,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:10:04,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:10:04,548 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:10:04,549 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:10:04,549 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 154#L367 assume !(main_~length~0#1 < 1); 148#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 149#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 150#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 155#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 157#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 156#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 151#L370-4 main_~j~0#1 := 0; 152#L378-2 [2021-11-23 14:10:04,549 INFO L793 eck$LassoCheckResult]: Loop: 152#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 153#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 152#L378-2 [2021-11-23 14:10:04,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:04,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2021-11-23 14:10:04,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:04,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894393128] [2021-11-23 14:10:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:04,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:04,580 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:04,609 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:04,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:04,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2021-11-23 14:10:04,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:04,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426199778] [2021-11-23 14:10:04,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:04,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:04,623 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:04,635 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:04,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:04,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2021-11-23 14:10:04,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:04,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546896556] [2021-11-23 14:10:04,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:04,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:04,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:10:04,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546896556] [2021-11-23 14:10:04,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546896556] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:10:04,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618421473] [2021-11-23 14:10:04,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:04,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:10:04,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:04,929 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:10:04,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 14:10:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:05,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 14:10:05,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:10:05,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-23 14:10:05,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 14:10:05,232 INFO L388 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 15 treesize of output 7 [2021-11-23 14:10:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:05,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:10:05,323 INFO L388 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 18 treesize of output 16 [2021-11-23 14:10:05,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2021-11-23 14:10:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:05,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618421473] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:10:05,358 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:10:05,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 15 [2021-11-23 14:10:05,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362588800] [2021-11-23 14:10:05,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:10:05,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:10:05,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-23 14:10:05,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-11-23 14:10:05,423 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:10:05,595 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2021-11-23 14:10:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 14:10:05,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2021-11-23 14:10:05,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-23 14:10:05,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2021-11-23 14:10:05,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-23 14:10:05,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-23 14:10:05,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-11-23 14:10:05,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:10:05,607 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-11-23 14:10:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-11-23 14:10:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2021-11-23 14:10:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:05,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2021-11-23 14:10:05,617 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-11-23 14:10:05,617 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-11-23 14:10:05,617 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-23 14:10:05,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2021-11-23 14:10:05,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:05,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:10:05,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:10:05,622 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:10:05,622 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:10:05,622 INFO L791 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 279#L367 assume !(main_~length~0#1 < 1); 273#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 274#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 275#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 280#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 284#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 281#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 282#L370-4 main_~j~0#1 := 0; 288#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 276#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 277#L378-2 [2021-11-23 14:10:05,622 INFO L793 eck$LassoCheckResult]: Loop: 277#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 285#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 277#L378-2 [2021-11-23 14:10:05,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2021-11-23 14:10:05,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:05,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031126922] [2021-11-23 14:10:05,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:05,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:05,655 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:05,677 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:05,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2021-11-23 14:10:05,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:05,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942319052] [2021-11-23 14:10:05,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:05,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:05,691 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:05,702 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:05,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:05,703 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2021-11-23 14:10:05,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:05,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433605947] [2021-11-23 14:10:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:05,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:05,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:10:05,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433605947] [2021-11-23 14:10:05,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433605947] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:10:05,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003208938] [2021-11-23 14:10:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:05,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:10:05,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:05,851 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:10:05,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 14:10:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:05,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 14:10:05,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:10:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:05,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:10:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:06,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003208938] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:10:06,069 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:10:06,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2021-11-23 14:10:06,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693118943] [2021-11-23 14:10:06,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:10:06,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:10:06,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-23 14:10:06,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-11-23 14:10:06,137 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:10:06,362 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2021-11-23 14:10:06,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 14:10:06,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2021-11-23 14:10:06,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-23 14:10:06,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 50 transitions. [2021-11-23 14:10:06,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-11-23 14:10:06,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-11-23 14:10:06,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2021-11-23 14:10:06,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:10:06,367 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2021-11-23 14:10:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2021-11-23 14:10:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2021-11-23 14:10:06,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2021-11-23 14:10:06,372 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-11-23 14:10:06,372 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-11-23 14:10:06,372 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-23 14:10:06,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2021-11-23 14:10:06,373 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-23 14:10:06,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:10:06,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:10:06,374 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:10:06,374 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:10:06,375 INFO L791 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 439#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 447#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 440#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 441#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 442#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 449#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 458#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 459#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 460#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 455#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 456#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 443#L370-4 main_~j~0#1 := 0; 444#L378-2 [2021-11-23 14:10:06,375 INFO L793 eck$LassoCheckResult]: Loop: 444#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 454#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 444#L378-2 [2021-11-23 14:10:06,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:06,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2021-11-23 14:10:06,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:06,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579046163] [2021-11-23 14:10:06,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:06,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:06,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:10:06,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579046163] [2021-11-23 14:10:06,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579046163] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:10:06,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528647518] [2021-11-23 14:10:06,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:06,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:10:06,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:06,506 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:10:06,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 14:10:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:06,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 14:10:06,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:10:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:06,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 14:10:06,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528647518] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:10:06,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 14:10:06,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-11-23 14:10:06,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217759761] [2021-11-23 14:10:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:10:06,634 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-23 14:10:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2021-11-23 14:10:06,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:06,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313995182] [2021-11-23 14:10:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:06,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:06,646 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:06,656 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:06,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:10:06,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 14:10:06,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-23 14:10:06,715 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:10:06,742 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2021-11-23 14:10:06,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 14:10:06,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2021-11-23 14:10:06,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:06,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2021-11-23 14:10:06,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-11-23 14:10:06,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-11-23 14:10:06,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-11-23 14:10:06,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:10:06,750 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-11-23 14:10:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-11-23 14:10:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-11-23 14:10:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2021-11-23 14:10:06,756 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-11-23 14:10:06,756 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-11-23 14:10:06,756 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-23 14:10:06,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2021-11-23 14:10:06,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:06,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:10:06,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:10:06,760 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:10:06,760 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:10:06,761 INFO L791 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 554#L367 assume !(main_~length~0#1 < 1); 548#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 549#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 550#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 555#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 558#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 556#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 557#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 565#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 562#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 553#L370-4 main_~j~0#1 := 0; 552#L378-2 [2021-11-23 14:10:06,761 INFO L793 eck$LassoCheckResult]: Loop: 552#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 559#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 552#L378-2 [2021-11-23 14:10:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2021-11-23 14:10:06,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:06,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562420071] [2021-11-23 14:10:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:06,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:06,783 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:06,814 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:06,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2021-11-23 14:10:06,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:06,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519951730] [2021-11-23 14:10:06,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:06,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:06,822 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:06,828 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:06,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2021-11-23 14:10:06,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:06,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764478579] [2021-11-23 14:10:06,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:06,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:07,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:10:07,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764478579] [2021-11-23 14:10:07,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764478579] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:10:07,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093229883] [2021-11-23 14:10:07,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:07,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:10:07,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:07,080 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:10:07,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 14:10:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:07,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 14:10:07,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:10:07,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-23 14:10:07,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 14:10:07,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-23 14:10:07,265 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 14:10:07,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-23 14:10:07,427 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 14:10:07,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-11-23 14:10:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:07,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:10:08,029 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_36| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-11-23 14:10:08,574 INFO L388 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 30 treesize of output 28 [2021-11-23 14:10:08,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2021-11-23 14:10:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-23 14:10:08,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093229883] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:10:08,651 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:10:08,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 21 [2021-11-23 14:10:08,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534156840] [2021-11-23 14:10:08,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:10:08,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:10:08,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-23 14:10:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=311, Unknown=1, NotChecked=38, Total=462 [2021-11-23 14:10:08,699 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:09,120 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_36| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2021-11-23 14:10:09,616 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_36| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2021-11-23 14:10:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:10:09,687 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2021-11-23 14:10:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-23 14:10:09,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions. [2021-11-23 14:10:09,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:09,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 69 transitions. [2021-11-23 14:10:09,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-11-23 14:10:09,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-11-23 14:10:09,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 69 transitions. [2021-11-23 14:10:09,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:10:09,691 INFO L681 BuchiCegarLoop]: Abstraction has 53 states and 69 transitions. [2021-11-23 14:10:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 69 transitions. [2021-11-23 14:10:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 28. [2021-11-23 14:10:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2021-11-23 14:10:09,695 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-11-23 14:10:09,695 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-11-23 14:10:09,695 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-23 14:10:09,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2021-11-23 14:10:09,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:09,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:10:09,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:10:09,697 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:10:09,697 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:10:09,698 INFO L791 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 740#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 748#L367 assume !(main_~length~0#1 < 1); 741#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 742#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 743#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 749#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 758#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 750#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 751#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 753#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 755#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 744#L370-4 main_~j~0#1 := 0; 745#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 746#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 747#L378-2 [2021-11-23 14:10:09,698 INFO L793 eck$LassoCheckResult]: Loop: 747#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 757#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 747#L378-2 [2021-11-23 14:10:09,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959587, now seen corresponding path program 1 times [2021-11-23 14:10:09,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:09,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45528862] [2021-11-23 14:10:09,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:09,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:09,710 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:09,721 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:09,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:09,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2021-11-23 14:10:09,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:09,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174305140] [2021-11-23 14:10:09,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:09,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:09,725 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:09,729 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:09,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:09,730 INFO L85 PathProgramCache]: Analyzing trace with hash 123354080, now seen corresponding path program 1 times [2021-11-23 14:10:09,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:09,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391165078] [2021-11-23 14:10:09,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:09,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:09,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:10:09,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391165078] [2021-11-23 14:10:09,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391165078] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:10:09,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726256997] [2021-11-23 14:10:09,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:09,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:10:09,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:09,834 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:10:09,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 14:10:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:09,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-23 14:10:09,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:10:09,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 14:10:10,075 INFO L388 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 15 treesize of output 7 [2021-11-23 14:10:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:10,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:10:10,160 INFO L388 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 16 treesize of output 14 [2021-11-23 14:10:10,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-11-23 14:10:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:10,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726256997] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:10:10,192 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:10:10,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2021-11-23 14:10:10,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358660453] [2021-11-23 14:10:10,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:10:10,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:10:10,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-23 14:10:10,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-11-23 14:10:10,244 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 15 Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:10:10,422 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2021-11-23 14:10:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 14:10:10,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2021-11-23 14:10:10,424 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-23 14:10:10,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2021-11-23 14:10:10,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-11-23 14:10:10,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-11-23 14:10:10,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2021-11-23 14:10:10,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:10:10,426 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2021-11-23 14:10:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2021-11-23 14:10:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2021-11-23 14:10:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 32 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2021-11-23 14:10:10,429 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2021-11-23 14:10:10,429 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2021-11-23 14:10:10,429 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-23 14:10:10,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2021-11-23 14:10:10,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:10,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:10:10,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:10:10,430 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:10:10,430 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:10:10,430 INFO L791 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 929#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 936#L367 assume !(main_~length~0#1 < 1); 930#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 931#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 932#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 937#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 947#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 938#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 939#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 941#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 943#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 933#L370-4 main_~j~0#1 := 0; 934#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 949#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 946#L378-2 [2021-11-23 14:10:10,430 INFO L793 eck$LassoCheckResult]: Loop: 946#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 945#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 946#L378-2 [2021-11-23 14:10:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:10,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2021-11-23 14:10:10,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:10,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108866429] [2021-11-23 14:10:10,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:10,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:10,452 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:10,491 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:10,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2021-11-23 14:10:10,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:10,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973941488] [2021-11-23 14:10:10,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:10,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:10,499 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:10,505 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:10,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2021-11-23 14:10:10,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:10,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081470900] [2021-11-23 14:10:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:10,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:10,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:10:10,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081470900] [2021-11-23 14:10:10,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081470900] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:10:10,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742144830] [2021-11-23 14:10:10,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 14:10:10,663 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:10:10,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:10,665 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:10:10,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-23 14:10:10,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 14:10:10,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 14:10:10,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 14:10:10,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:10:10,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2021-11-23 14:10:10,870 INFO L388 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 19 treesize of output 7 [2021-11-23 14:10:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:10,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:10:10,946 INFO L388 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 20 treesize of output 18 [2021-11-23 14:10:10,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2021-11-23 14:10:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:10,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742144830] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:10:10,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:10:10,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2021-11-23 14:10:10,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529494198] [2021-11-23 14:10:10,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:10:11,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:10:11,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-23 14:10:11,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-23 14:10:11,030 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. cyclomatic complexity: 16 Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:10:11,155 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2021-11-23 14:10:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 14:10:11,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2021-11-23 14:10:11,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-23 14:10:11,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 66 transitions. [2021-11-23 14:10:11,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-11-23 14:10:11,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-11-23 14:10:11,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 66 transitions. [2021-11-23 14:10:11,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:10:11,159 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2021-11-23 14:10:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 66 transitions. [2021-11-23 14:10:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2021-11-23 14:10:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.4) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2021-11-23 14:10:11,164 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-11-23 14:10:11,164 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-11-23 14:10:11,164 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-23 14:10:11,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. [2021-11-23 14:10:11,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:11,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:10:11,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:10:11,166 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:10:11,166 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:10:11,167 INFO L791 eck$LassoCheckResult]: Stem: 1127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1135#L367 assume !(main_~length~0#1 < 1); 1129#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1130#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1131#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1136#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1146#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1137#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1138#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1139#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1163#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1144#L370-4 main_~j~0#1 := 0; 1166#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1134#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1133#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1141#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1148#L378-2 [2021-11-23 14:10:11,167 INFO L793 eck$LassoCheckResult]: Loop: 1148#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1149#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1148#L378-2 [2021-11-23 14:10:11,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:11,168 INFO L85 PathProgramCache]: Analyzing trace with hash 123354082, now seen corresponding path program 2 times [2021-11-23 14:10:11,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:11,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953882736] [2021-11-23 14:10:11,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:11,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:11,178 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:11,192 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2021-11-23 14:10:11,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:11,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777567755] [2021-11-23 14:10:11,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:11,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:11,197 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:11,200 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:11,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1715810139, now seen corresponding path program 2 times [2021-11-23 14:10:11,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:11,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319323359] [2021-11-23 14:10:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:11,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:11,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:10:11,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319323359] [2021-11-23 14:10:11,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319323359] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:10:11,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226829980] [2021-11-23 14:10:11,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 14:10:11,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:10:11,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:11,364 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:10:11,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-23 14:10:11,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 14:10:11,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 14:10:11,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 14:10:11,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:10:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:11,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:10:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:11,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226829980] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:10:11,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:10:11,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2021-11-23 14:10:11,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251560184] [2021-11-23 14:10:11,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:10:11,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:10:11,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-23 14:10:11,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-11-23 14:10:11,686 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. cyclomatic complexity: 21 Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:10:11,896 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2021-11-23 14:10:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 14:10:11,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2021-11-23 14:10:11,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:11,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 43 states and 57 transitions. [2021-11-23 14:10:11,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-11-23 14:10:11,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-11-23 14:10:11,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2021-11-23 14:10:11,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:10:11,899 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2021-11-23 14:10:11,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2021-11-23 14:10:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2021-11-23 14:10:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.35) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2021-11-23 14:10:11,903 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2021-11-23 14:10:11,903 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2021-11-23 14:10:11,903 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-23 14:10:11,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2021-11-23 14:10:11,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:11,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:10:11,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:10:11,905 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:10:11,905 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:10:11,905 INFO L791 eck$LassoCheckResult]: Stem: 1357#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1358#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1366#L367 assume !(main_~length~0#1 < 1); 1359#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1360#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1361#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1367#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1396#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1395#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1394#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1373#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1368#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1369#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1371#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1386#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1384#L370-4 main_~j~0#1 := 0; 1378#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1362#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1363#L378-2 [2021-11-23 14:10:11,906 INFO L793 eck$LassoCheckResult]: Loop: 1363#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1377#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1363#L378-2 [2021-11-23 14:10:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:11,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1062164513, now seen corresponding path program 3 times [2021-11-23 14:10:11,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:11,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360870373] [2021-11-23 14:10:11,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:11,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:11,916 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:11,927 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:11,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2021-11-23 14:10:11,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:11,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671043648] [2021-11-23 14:10:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:11,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:11,931 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:10:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:10:11,935 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:10:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:11,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1462118108, now seen corresponding path program 3 times [2021-11-23 14:10:11,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:11,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256089707] [2021-11-23 14:10:11,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:11,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:12,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:10:12,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256089707] [2021-11-23 14:10:12,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256089707] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:10:12,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24085895] [2021-11-23 14:10:12,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 14:10:12,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:10:12,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:12,061 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:10:12,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-23 14:10:12,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-23 14:10:12,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 14:10:12,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 14:10:12,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:10:12,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-11-23 14:10:12,182 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-11-23 14:10:12,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2021-11-23 14:10:12,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2021-11-23 14:10:12,219 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-11-23 14:10:12,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 51 [2021-11-23 14:10:12,300 INFO L388 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 19 treesize of output 7 [2021-11-23 14:10:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 14:10:12,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:10:12,922 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)) is different from false [2021-11-23 14:10:12,939 INFO L388 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 23 treesize of output 21 [2021-11-23 14:10:12,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2021-11-23 14:10:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-11-23 14:10:12,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24085895] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:10:12,971 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:10:12,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2021-11-23 14:10:12,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774252380] [2021-11-23 14:10:12,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:10:13,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:10:13,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-23 14:10:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=213, Unknown=1, NotChecked=30, Total=306 [2021-11-23 14:10:13,025 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. cyclomatic complexity: 19 Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:13,609 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0))) is different from false [2021-11-23 14:10:14,169 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (= (* 4 |c_ULTIMATE.start_main_~i~0#1|) 4)) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0))) is different from false [2021-11-23 14:10:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:10:14,237 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2021-11-23 14:10:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 14:10:14,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 69 transitions. [2021-11-23 14:10:14,239 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-23 14:10:14,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 69 transitions. [2021-11-23 14:10:14,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-11-23 14:10:14,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-11-23 14:10:14,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 69 transitions. [2021-11-23 14:10:14,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:10:14,242 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 69 transitions. [2021-11-23 14:10:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 69 transitions. [2021-11-23 14:10:14,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2021-11-23 14:10:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:10:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2021-11-23 14:10:14,246 INFO L704 BuchiCegarLoop]: Abstraction has 43 states and 59 transitions. [2021-11-23 14:10:14,246 INFO L587 BuchiCegarLoop]: Abstraction has 43 states and 59 transitions. [2021-11-23 14:10:14,246 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-23 14:10:14,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 59 transitions. [2021-11-23 14:10:14,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:10:14,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:10:14,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:10:14,247 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:10:14,248 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:10:14,248 INFO L791 eck$LassoCheckResult]: Stem: 1594#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1595#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1600#L367 assume !(main_~length~0#1 < 1); 1592#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1593#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1596#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1601#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1616#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1615#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1613#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1614#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1631#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1627#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1625#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1622#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1619#L370-4 main_~j~0#1 := 0; 1618#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1609#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1610#L378-2 [2021-11-23 14:10:14,248 INFO L793 eck$LassoCheckResult]: Loop: 1610#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1612#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1610#L378-2 [2021-11-23 14:10:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:10:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1119422813, now seen corresponding path program 2 times [2021-11-23 14:10:14,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:10:14,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593710567] [2021-11-23 14:10:14,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:10:14,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:10:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:10:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:14,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:10:14,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593710567] [2021-11-23 14:10:14,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593710567] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:10:14,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862364006] [2021-11-23 14:10:14,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 14:10:14,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:10:14,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:10:14,500 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:10:14,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-23 14:10:14,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 14:10:14,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 14:10:14,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-23 14:10:14,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:10:14,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-23 14:10:14,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 14:10:14,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-23 14:10:14,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 14:10:14,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-23 14:10:14,787 INFO L354 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2021-11-23 14:10:14,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 44 [2021-11-23 14:10:14,942 INFO L354 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2021-11-23 14:10:14,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 32 [2021-11-23 14:10:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:10:14,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:11:38,615 INFO L388 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 59 treesize of output 57 [2021-11-23 14:11:38,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 448 [2021-11-23 14:11:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:11:39,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862364006] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:11:39,017 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:11:39,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28 [2021-11-23 14:11:39,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127448039] [2021-11-23 14:11:39,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:11:39,018 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-23 14:11:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:11:39,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2021-11-23 14:11:39,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:11:39,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711622898] [2021-11-23 14:11:39,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:11:39,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:11:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:11:39,024 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:11:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:11:39,029 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:11:39,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:11:39,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-23 14:11:39,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=642, Unknown=12, NotChecked=0, Total=812 [2021-11-23 14:11:39,080 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. cyclomatic complexity: 22 Second operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:11:51,137 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_60| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~j~0#1_57| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int)) (or (< (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* 4 |v_ULTIMATE.start_main_~j~0#1_57|)) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_57|) (< |v_ULTIMATE.start_main_~j~0#1_57| 0) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) |ULTIMATE.start_main_#t~nondet208#1|) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)) 0))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0)) is different from false [2021-11-23 14:11:51,785 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_57| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet208#1|) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)) 0) (< (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* 4 |v_ULTIMATE.start_main_~j~0#1_57|)) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_57|) (< |v_ULTIMATE.start_main_~j~0#1_57| 0))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2021-11-23 14:11:52,647 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_57| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (<= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 0) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) |ULTIMATE.start_main_#t~nondet208#1|) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)) 0) (< |v_ULTIMATE.start_main_~i~0#1_60| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* 4 |v_ULTIMATE.start_main_~j~0#1_57|)) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_57|) (< |v_ULTIMATE.start_main_~j~0#1_57| 0))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (not (= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0))) is different from false [2021-11-23 14:11:53,474 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_57| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (<= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 0) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) |ULTIMATE.start_main_#t~nondet208#1|) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)) 0) (< |v_ULTIMATE.start_main_~i~0#1_60| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* 4 |v_ULTIMATE.start_main_~j~0#1_57|)) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_57|) (< |v_ULTIMATE.start_main_~j~0#1_57| 0))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2021-11-23 14:11:54,328 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|))) (and (<= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_58| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_58| 4))) 0) (<= 1 |v_ULTIMATE.start_main_~i~0#1_58|))) (forall ((|v_ULTIMATE.start_main_~j~0#1_57| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (<= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 0) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) |ULTIMATE.start_main_#t~nondet208#1|) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)) 0) (< |v_ULTIMATE.start_main_~i~0#1_60| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* 4 |v_ULTIMATE.start_main_~j~0#1_57|)) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_57|) (< |v_ULTIMATE.start_main_~j~0#1_57| 0))) (<= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (not (= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0)) (<= (select .cse0 |c_ULTIMATE.start_main_~arr~0#1.offset|) 0))) is different from false [2021-11-23 14:12:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:15,257 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2021-11-23 14:12:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-23 14:12:15,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 144 transitions. [2021-11-23 14:12:15,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:12:15,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 144 transitions. [2021-11-23 14:12:15,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-11-23 14:12:15,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-11-23 14:12:15,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 144 transitions. [2021-11-23 14:12:15,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:12:15,263 INFO L681 BuchiCegarLoop]: Abstraction has 105 states and 144 transitions. [2021-11-23 14:12:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 144 transitions. [2021-11-23 14:12:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2021-11-23 14:12:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 64 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2021-11-23 14:12:15,269 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 92 transitions. [2021-11-23 14:12:15,269 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 92 transitions. [2021-11-23 14:12:15,269 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-23 14:12:15,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 92 transitions. [2021-11-23 14:12:15,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:12:15,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:12:15,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:12:15,271 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:15,271 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:12:15,272 INFO L791 eck$LassoCheckResult]: Stem: 1903#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1904#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1911#L367 assume !(main_~length~0#1 < 1); 1905#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1906#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1907#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1912#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1941#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1940#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1938#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1937#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1936#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1932#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1930#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1926#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1923#L370-4 main_~j~0#1 := 0; 1924#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1920#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1921#L378-2 [2021-11-23 14:12:15,272 INFO L793 eck$LassoCheckResult]: Loop: 1921#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1922#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1921#L378-2 [2021-11-23 14:12:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:15,273 INFO L85 PathProgramCache]: Analyzing trace with hash 861257375, now seen corresponding path program 3 times [2021-11-23 14:12:15,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:15,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434888900] [2021-11-23 14:12:15,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:15,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:15,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:15,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434888900] [2021-11-23 14:12:15,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434888900] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:12:15,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994134414] [2021-11-23 14:12:15,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 14:12:15,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:12:15,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:15,519 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:12:15,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-23 14:12:15,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-23 14:12:15,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 14:12:15,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 14:12:15,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:12:15,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-23 14:12:15,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 14:12:15,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-23 14:12:15,728 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 14:12:15,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-23 14:12:15,837 INFO L354 Elim1Store]: treesize reduction 58, result has 36.3 percent of original size [2021-11-23 14:12:15,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 64 [2021-11-23 14:12:16,727 INFO L354 Elim1Store]: treesize reduction 57, result has 32.9 percent of original size [2021-11-23 14:12:16,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 73 [2021-11-23 14:12:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:16,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:12:50,269 INFO L388 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 32 treesize of output 30 [2021-11-23 14:12:50,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2021-11-23 14:12:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 14:12:50,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994134414] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:12:50,337 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:12:50,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 24 [2021-11-23 14:12:50,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55921119] [2021-11-23 14:12:50,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:12:50,338 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-23 14:12:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:50,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2021-11-23 14:12:50,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:50,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806831537] [2021-11-23 14:12:50,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:50,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:50,357 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:12:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:50,360 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:12:50,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-23 14:12:50,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2021-11-23 14:12:50,415 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. cyclomatic complexity: 35 Second operand has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:51,431 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_61| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_61| 4))) 0) (< (+ (* 4 |v_ULTIMATE.start_main_~j~0#1_61|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_61|) (< |v_ULTIMATE.start_main_~j~0#1_61| 0))) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (or (< 0 |c_ULTIMATE.start_main_#t~mem209#1|) (forall ((|v_ULTIMATE.start_main_~j~0#1_61| Int)) (or (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_61| 4))) 0) (< (+ (* 4 |v_ULTIMATE.start_main_~j~0#1_61|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_61|) (< |v_ULTIMATE.start_main_~j~0#1_61| 0))))) is different from false [2021-11-23 14:12:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:52,667 INFO L93 Difference]: Finished difference Result 128 states and 174 transitions. [2021-11-23 14:12:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-23 14:12:52,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 174 transitions. [2021-11-23 14:12:52,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:12:52,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 128 states and 174 transitions. [2021-11-23 14:12:52,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2021-11-23 14:12:52,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2021-11-23 14:12:52,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 174 transitions. [2021-11-23 14:12:52,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:12:52,673 INFO L681 BuchiCegarLoop]: Abstraction has 128 states and 174 transitions. [2021-11-23 14:12:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 174 transitions. [2021-11-23 14:12:52,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 67. [2021-11-23 14:12:52,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 66 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2021-11-23 14:12:52,678 INFO L704 BuchiCegarLoop]: Abstraction has 67 states and 95 transitions. [2021-11-23 14:12:52,678 INFO L587 BuchiCegarLoop]: Abstraction has 67 states and 95 transitions. [2021-11-23 14:12:52,678 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-23 14:12:52,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 95 transitions. [2021-11-23 14:12:52,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:12:52,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:12:52,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:12:52,680 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:52,680 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:12:52,680 INFO L791 eck$LassoCheckResult]: Stem: 2255#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2256#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2264#L367 assume !(main_~length~0#1 < 1); 2257#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2258#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2259#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2265#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2311#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2316#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2314#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2315#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2266#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2267#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2269#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2270#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2288#L370-4 main_~j~0#1 := 0; 2263#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2276#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2273#L378-2 [2021-11-23 14:12:52,680 INFO L793 eck$LassoCheckResult]: Loop: 2273#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2274#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2273#L378-2 [2021-11-23 14:12:52,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1484057445, now seen corresponding path program 4 times [2021-11-23 14:12:52,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:52,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826163753] [2021-11-23 14:12:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:52,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:52,689 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:12:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:52,698 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:12:52,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2021-11-23 14:12:52,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:52,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977930725] [2021-11-23 14:12:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:52,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:52,702 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:12:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:52,705 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:12:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash 250063720, now seen corresponding path program 4 times [2021-11-23 14:12:52,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:52,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300985742] [2021-11-23 14:12:52,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:52,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:52,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:52,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300985742] [2021-11-23 14:12:52,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300985742] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:12:52,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804780693] [2021-11-23 14:12:52,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 14:12:52,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:12:52,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:52,832 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:12:52,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-23 14:12:52,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 14:12:52,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 14:12:52,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-23 14:12:52,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:12:52,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-23 14:12:53,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 14:12:53,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-11-23 14:12:53,058 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-23 14:12:53,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-23 14:12:53,303 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 14:12:53,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-11-23 14:12:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:53,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:12:53,961 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_72| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (< |v_ULTIMATE.start_main_~i~0#1_72| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-11-23 14:12:54,534 INFO L388 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 32 treesize of output 30 [2021-11-23 14:12:54,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2021-11-23 14:12:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-23 14:12:54,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804780693] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:12:54,573 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:12:54,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 23 [2021-11-23 14:12:54,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381329559] [2021-11-23 14:12:54,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:12:54,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:54,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-23 14:12:54,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=408, Unknown=1, NotChecked=42, Total=552 [2021-11-23 14:12:54,612 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. cyclomatic complexity: 37 Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:55,107 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_72| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (< |v_ULTIMATE.start_main_~i~0#1_72| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 0)) is different from false [2021-11-23 14:12:55,648 WARN L838 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_72| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (< |v_ULTIMATE.start_main_~i~0#1_72| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2021-11-23 14:12:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:55,679 INFO L93 Difference]: Finished difference Result 118 states and 162 transitions. [2021-11-23 14:12:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-23 14:12:55,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 162 transitions. [2021-11-23 14:12:55,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:12:55,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 162 transitions. [2021-11-23 14:12:55,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-11-23 14:12:55,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-11-23 14:12:55,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 162 transitions. [2021-11-23 14:12:55,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:12:55,683 INFO L681 BuchiCegarLoop]: Abstraction has 118 states and 162 transitions. [2021-11-23 14:12:55,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 162 transitions. [2021-11-23 14:12:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 77. [2021-11-23 14:12:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 76 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2021-11-23 14:12:55,688 INFO L704 BuchiCegarLoop]: Abstraction has 77 states and 113 transitions. [2021-11-23 14:12:55,688 INFO L587 BuchiCegarLoop]: Abstraction has 77 states and 113 transitions. [2021-11-23 14:12:55,689 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-11-23 14:12:55,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 113 transitions. [2021-11-23 14:12:55,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:12:55,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:12:55,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:12:55,690 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:55,690 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:12:55,691 INFO L791 eck$LassoCheckResult]: Stem: 2589#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2590#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2598#L367 assume !(main_~length~0#1 < 1); 2591#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2592#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2593#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2599#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2636#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2655#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2654#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2653#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2600#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2601#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2603#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2605#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2596#L370-4 main_~j~0#1 := 0; 2597#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2594#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2595#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2611#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2608#L378-2 [2021-11-23 14:12:55,691 INFO L793 eck$LassoCheckResult]: Loop: 2608#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2612#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2608#L378-2 [2021-11-23 14:12:55,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash 250063722, now seen corresponding path program 5 times [2021-11-23 14:12:55,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:55,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307911956] [2021-11-23 14:12:55,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:55,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:55,701 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:12:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:55,712 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:12:55,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:55,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 13 times [2021-11-23 14:12:55,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:55,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825960062] [2021-11-23 14:12:55,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:55,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:55,716 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:12:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:55,719 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:12:55,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:55,720 INFO L85 PathProgramCache]: Analyzing trace with hash -206930387, now seen corresponding path program 5 times [2021-11-23 14:12:55,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:55,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402396893] [2021-11-23 14:12:55,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:55,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:55,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:55,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402396893] [2021-11-23 14:12:55,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402396893] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:12:55,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678231115] [2021-11-23 14:12:55,825 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-23 14:12:55,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:12:55,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:55,829 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:12:55,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-23 14:12:55,887 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-11-23 14:12:55,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 14:12:55,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-23 14:12:55,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:12:55,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-11-23 14:12:56,036 INFO L388 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 19 treesize of output 7 [2021-11-23 14:12:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:56,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:12:56,231 INFO L388 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 26 treesize of output 24 [2021-11-23 14:12:56,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2021-11-23 14:12:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:56,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678231115] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:12:56,287 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:12:56,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2021-11-23 14:12:56,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910272959] [2021-11-23 14:12:56,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:12:56,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:56,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-23 14:12:56,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-11-23 14:12:56,338 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. cyclomatic complexity: 47 Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:56,499 INFO L93 Difference]: Finished difference Result 90 states and 129 transitions. [2021-11-23 14:12:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 14:12:56,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 129 transitions. [2021-11-23 14:12:56,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:12:56,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 129 transitions. [2021-11-23 14:12:56,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-11-23 14:12:56,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-11-23 14:12:56,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 129 transitions. [2021-11-23 14:12:56,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:12:56,503 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 129 transitions. [2021-11-23 14:12:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 129 transitions. [2021-11-23 14:12:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2021-11-23 14:12:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 85 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2021-11-23 14:12:56,508 INFO L704 BuchiCegarLoop]: Abstraction has 86 states and 125 transitions. [2021-11-23 14:12:56,508 INFO L587 BuchiCegarLoop]: Abstraction has 86 states and 125 transitions. [2021-11-23 14:12:56,509 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-11-23 14:12:56,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 125 transitions. [2021-11-23 14:12:56,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:12:56,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:12:56,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:12:56,511 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:56,511 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:12:56,511 INFO L791 eck$LassoCheckResult]: Stem: 2909#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2910#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2918#L367 assume !(main_~length~0#1 < 1); 2911#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2912#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2913#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2919#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2970#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2920#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2921#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2922#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2994#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2992#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2991#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2990#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2952#L370-4 main_~j~0#1 := 0; 2917#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2972#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2929#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2933#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2928#L378-2 [2021-11-23 14:12:56,511 INFO L793 eck$LassoCheckResult]: Loop: 2928#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2930#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2928#L378-2 [2021-11-23 14:12:56,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash -559282904, now seen corresponding path program 6 times [2021-11-23 14:12:56,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:56,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079529671] [2021-11-23 14:12:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:56,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:56,522 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:12:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:56,534 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:12:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:56,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 14 times [2021-11-23 14:12:56,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:56,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047021827] [2021-11-23 14:12:56,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:56,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:56,538 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:12:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:56,540 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:12:56,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:56,541 INFO L85 PathProgramCache]: Analyzing trace with hash -599957397, now seen corresponding path program 6 times [2021-11-23 14:12:56,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:56,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334224054] [2021-11-23 14:12:56,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:56,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:56,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:56,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334224054] [2021-11-23 14:12:56,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334224054] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:12:56,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017219653] [2021-11-23 14:12:56,666 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-23 14:12:56,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:12:56,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:56,677 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:12:56,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-23 14:12:56,713 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-11-23 14:12:56,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 14:12:56,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 14:12:56,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:12:56,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-23 14:12:57,020 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-11-23 14:12:57,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2021-11-23 14:12:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:57,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:12:57,422 INFO L388 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 30 treesize of output 28 [2021-11-23 14:12:57,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2021-11-23 14:12:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:57,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017219653] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:12:57,446 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:12:57,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 28 [2021-11-23 14:12:57,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22996988] [2021-11-23 14:12:57,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:12:57,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:57,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-23 14:12:57,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2021-11-23 14:12:57,486 INFO L87 Difference]: Start difference. First operand 86 states and 125 transitions. cyclomatic complexity: 50 Second operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:58,051 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2021-11-23 14:12:58,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-23 14:12:58,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 154 transitions. [2021-11-23 14:12:58,054 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-11-23 14:12:58,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 154 transitions. [2021-11-23 14:12:58,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-11-23 14:12:58,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-11-23 14:12:58,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 154 transitions. [2021-11-23 14:12:58,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 14:12:58,056 INFO L681 BuchiCegarLoop]: Abstraction has 111 states and 154 transitions. [2021-11-23 14:12:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 154 transitions. [2021-11-23 14:12:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 94. [2021-11-23 14:12:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 93 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2021-11-23 14:12:58,067 INFO L704 BuchiCegarLoop]: Abstraction has 94 states and 135 transitions. [2021-11-23 14:12:58,067 INFO L587 BuchiCegarLoop]: Abstraction has 94 states and 135 transitions. [2021-11-23 14:12:58,067 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-11-23 14:12:58,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 135 transitions. [2021-11-23 14:12:58,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-23 14:12:58,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:12:58,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:12:58,070 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:58,073 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:12:58,073 INFO L791 eck$LassoCheckResult]: Stem: 3302#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3303#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3310#L367 assume !(main_~length~0#1 < 1); 3304#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3305#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3306#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3311#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3316#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3312#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3313#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3315#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3390#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3387#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3386#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3385#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3307#L370-4 main_~j~0#1 := 0; 3308#L378-2 [2021-11-23 14:12:58,075 INFO L793 eck$LassoCheckResult]: Loop: 3308#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3309#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3308#L378-2 [2021-11-23 14:12:58,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash 649647838, now seen corresponding path program 2 times [2021-11-23 14:12:58,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:58,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682369426] [2021-11-23 14:12:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:58,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:58,084 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:12:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:58,106 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:12:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:58,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2021-11-23 14:12:58,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:58,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56787064] [2021-11-23 14:12:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:58,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:58,112 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:12:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:58,114 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:12:58,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1541315747, now seen corresponding path program 7 times [2021-11-23 14:12:58,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:58,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110478333] [2021-11-23 14:12:58,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:58,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:58,128 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:12:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:12:58,146 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:12:58,663 INFO L210 LassoAnalysis]: Preferences: [2021-11-23 14:12:58,663 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-23 14:12:58,663 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-23 14:12:58,663 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-23 14:12:58,664 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-23 14:12:58,664 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:12:58,664 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-23 14:12:58,664 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-23 14:12:58,664 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration16_Lasso [2021-11-23 14:12:58,664 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-23 14:12:58,664 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-23 14:12:58,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:12:58,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:12:58,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:12:58,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:12:58,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:12:58,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:12:58,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:12:58,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:12:58,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:12:58,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:12:58,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-23 14:12:58,934 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-23 14:12:58,934 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-23 14:12:58,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:12:58,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:58,949 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:12:58,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-11-23 14:12:58,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:12:58,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:12:58,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-23 14:12:58,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:12:58,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:12:58,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:12:58,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-23 14:12:58,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-23 14:12:58,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-23 14:12:58,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-11-23 14:12:58,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:12:58,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:59,006 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:12:59,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:12:59,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:12:59,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-23 14:12:59,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:12:59,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:12:59,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:12:59,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-23 14:12:59,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-23 14:12:59,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-11-23 14:12:59,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-23 14:12:59,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-11-23 14:12:59,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:12:59,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:59,077 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:12:59,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:12:59,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-11-23 14:12:59,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:12:59,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-23 14:12:59,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:12:59,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:12:59,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:12:59,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-23 14:12:59,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-23 14:12:59,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-23 14:12:59,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-11-23 14:12:59,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:12:59,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:59,121 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:12:59,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-11-23 14:12:59,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:12:59,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:12:59,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:12:59,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:12:59,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:12:59,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-23 14:12:59,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-23 14:12:59,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-23 14:12:59,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-11-23 14:12:59,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:12:59,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:59,162 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:12:59,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-23 14:12:59,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-11-23 14:12:59,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-23 14:12:59,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-23 14:12:59,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-23 14:12:59,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-23 14:12:59,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-23 14:12:59,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-23 14:12:59,193 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-23 14:12:59,205 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-11-23 14:12:59,205 INFO L444 ModelExtractionUtils]: 10 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-11-23 14:12:59,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-23 14:12:59,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:59,206 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-23 14:12:59,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-11-23 14:12:59,209 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-23 14:12:59,217 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-23 14:12:59,218 INFO L513 LassoAnalysis]: Proved termination. [2021-11-23 14:12:59,218 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~arr~0#1.offset, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 1*ULTIMATE.start_main_~arr~0#1.offset - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2021-11-23 14:12:59,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-11-23 14:12:59,243 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-11-23 14:12:59,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:59,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 14:12:59,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:12:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:59,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 14:12:59,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:12:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:59,341 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 [2021-11-23 14:12:59,341 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 135 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:59,361 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 135 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 106 states and 152 transitions. Complement of second has 5 states. [2021-11-23 14:12:59,362 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 [2021-11-23 14:12:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2021-11-23 14:12:59,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 16 letters. Loop has 2 letters. [2021-11-23 14:12:59,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-23 14:12:59,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 18 letters. Loop has 2 letters. [2021-11-23 14:12:59,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-23 14:12:59,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 16 letters. Loop has 4 letters. [2021-11-23 14:12:59,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-23 14:12:59,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 152 transitions. [2021-11-23 14:12:59,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:12:59,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 98 states and 140 transitions. [2021-11-23 14:12:59,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-11-23 14:12:59,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-11-23 14:12:59,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 140 transitions. [2021-11-23 14:12:59,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-23 14:12:59,368 INFO L681 BuchiCegarLoop]: Abstraction has 98 states and 140 transitions. [2021-11-23 14:12:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 140 transitions. [2021-11-23 14:12:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2021-11-23 14:12:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 94 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2021-11-23 14:12:59,375 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 137 transitions. [2021-11-23 14:12:59,375 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 137 transitions. [2021-11-23 14:12:59,375 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-11-23 14:12:59,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 137 transitions. [2021-11-23 14:12:59,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-23 14:12:59,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-23 14:12:59,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-23 14:12:59,380 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:59,380 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-23 14:12:59,381 INFO L791 eck$LassoCheckResult]: Stem: 3589#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3590#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3600#L367 assume !(main_~length~0#1 < 1); 3591#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3592#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3593#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3601#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3659#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3658#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3656#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3654#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3651#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3648#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3646#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3643#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3641#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3626#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3629#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3594#L370-4 main_~j~0#1 := 0; 3595#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3596#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3597#L378-2 [2021-11-23 14:12:59,381 INFO L793 eck$LassoCheckResult]: Loop: 3597#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3660#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3597#L378-2 [2021-11-23 14:12:59,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:59,381 INFO L85 PathProgramCache]: Analyzing trace with hash 95390747, now seen corresponding path program 4 times [2021-11-23 14:12:59,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:59,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346488921] [2021-11-23 14:12:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:59,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:59,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-11-23 14:12:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:59,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:59,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346488921] [2021-11-23 14:12:59,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346488921] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:12:59,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011843673] [2021-11-23 14:12:59,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 14:12:59,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:12:59,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:59,681 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:12:59,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d291fd50-83d6-4cd8-84ac-a06c802bb12e/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-23 14:12:59,723 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 14:12:59,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 14:12:59,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-23 14:12:59,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:12:59,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-23 14:12:59,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 14:12:59,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-23 14:12:59,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 14:12:59,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-23 14:12:59,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 14:12:59,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-23 14:12:59,959 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 14:12:59,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-23 14:13:00,077 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 14:13:00,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-11-23 14:13:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:13:00,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:13:00,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_98| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0))) is different from false [2021-11-23 14:13:12,788 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_98| (+ |v_ULTIMATE.start_main_~i~0#1_99| 1)) (<= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_99| 4)) |ULTIMATE.start_main_#t~nondet208#1|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0))) (< |v_ULTIMATE.start_main_~i~0#1_99| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-11-23 14:13:21,193 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_#t~nondet208#1_64| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_98| (+ |v_ULTIMATE.start_main_~i~0#1_99| 1)) (<= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet208#1|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_99| 4)) |v_ULTIMATE.start_main_#t~nondet208#1_64|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_99| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-11-23 14:13:33,301 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_#t~nondet208#1_64| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_98| (+ |v_ULTIMATE.start_main_~i~0#1_99| 1)) (< |v_ULTIMATE.start_main_~i~0#1_99| (+ |v_ULTIMATE.start_main_~i~0#1_100| 1)) (<= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_100| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) |ULTIMATE.start_main_#t~nondet208#1|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_99| 4)) |v_ULTIMATE.start_main_#t~nondet208#1_64|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0))) (< |v_ULTIMATE.start_main_~i~0#1_100| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-11-23 14:13:45,460 WARN L227 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 14:13:45,487 INFO L388 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 54 treesize of output 52 [2021-11-23 14:13:45,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33456 treesize of output 33200