./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa --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 32bit --witnessprinter.graph.data.programhash 33fdb29d081e8788960943f1182fbfb10ca7dcdfe7c31b22aaab16bda45fd1b8 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:42:13,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:42:13,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:42:13,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:42:13,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:42:13,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:42:13,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:42:13,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:42:13,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:42:13,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:42:13,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:42:13,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:42:13,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:42:13,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:42:13,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:42:13,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:42:13,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:42:13,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:42:13,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:42:13,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:42:13,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:42:13,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:42:13,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:42:13,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:42:13,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:42:13,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:42:13,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:42:13,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:42:13,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:42:13,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:42:13,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:42:13,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:42:13,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:42:13,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:42:13,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:42:13,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:42:13,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:42:13,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:42:13,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:42:13,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:42:13,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:42:13,794 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-06 17:42:13,811 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:42:13,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:42:13,812 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:42:13,812 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:42:13,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:42:13,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:42:13,813 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:42:13,813 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-06 17:42:13,813 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-06 17:42:13,813 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-06 17:42:13,813 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-06 17:42:13,813 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-06 17:42:13,814 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-06 17:42:13,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:42:13,814 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:42:13,814 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 17:42:13,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:42:13,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:42:13,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:42:13,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-06 17:42:13,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-06 17:42:13,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-06 17:42:13,815 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:42:13,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:42:13,815 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-06 17:42:13,815 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:42:13,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-06 17:42:13,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:42:13,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:42:13,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:42:13,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:42:13,816 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:42:13,816 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-06 17:42:13,816 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_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/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_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33fdb29d081e8788960943f1182fbfb10ca7dcdfe7c31b22aaab16bda45fd1b8 [2021-12-06 17:42:13,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:42:13,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:42:14,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:42:14,001 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:42:14,002 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:42:14,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-12-06 17:42:14,048 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/data/68efed2b6/41801d035c1a4f91a38beb31cf92577c/FLAGd70302e72 [2021-12-06 17:42:14,437 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:42:14,437 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-12-06 17:42:14,442 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/data/68efed2b6/41801d035c1a4f91a38beb31cf92577c/FLAGd70302e72 [2021-12-06 17:42:14,452 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/data/68efed2b6/41801d035c1a4f91a38beb31cf92577c [2021-12-06 17:42:14,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:42:14,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:42:14,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:42:14,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:42:14,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:42:14,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:42:14" (1/1) ... [2021-12-06 17:42:14,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fab054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14, skipping insertion in model container [2021-12-06 17:42:14,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:42:14" (1/1) ... [2021-12-06 17:42:14,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:42:14,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:42:14,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2021-12-06 17:42:14,601 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:42:14,608 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:42:14,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2021-12-06 17:42:14,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:42:14,634 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:42:14,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14 WrapperNode [2021-12-06 17:42:14,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:42:14,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:42:14,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:42:14,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:42:14,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14" (1/1) ... [2021-12-06 17:42:14,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14" (1/1) ... [2021-12-06 17:42:14,663 INFO L137 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 138 [2021-12-06 17:42:14,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:42:14,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:42:14,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:42:14,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:42:14,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14" (1/1) ... [2021-12-06 17:42:14,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14" (1/1) ... [2021-12-06 17:42:14,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14" (1/1) ... [2021-12-06 17:42:14,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14" (1/1) ... [2021-12-06 17:42:14,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14" (1/1) ... [2021-12-06 17:42:14,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14" (1/1) ... [2021-12-06 17:42:14,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14" (1/1) ... [2021-12-06 17:42:14,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:42:14,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:42:14,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:42:14,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:42:14,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14" (1/1) ... [2021-12-06 17:42:14,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:14,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:14,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:14,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-06 17:42:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 17:42:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-06 17:42:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:42:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:42:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 17:42:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 17:42:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:42:14,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:42:14,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 17:42:14,801 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:42:14,802 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:42:14,989 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:42:14,995 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:42:14,995 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-06 17:42:14,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:42:14 BoogieIcfgContainer [2021-12-06 17:42:14,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:42:14,998 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-06 17:42:14,998 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-06 17:42:15,002 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-06 17:42:15,003 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-06 17:42:15,003 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.12 05:42:14" (1/3) ... [2021-12-06 17:42:15,004 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a2f0cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.12 05:42:15, skipping insertion in model container [2021-12-06 17:42:15,004 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-06 17:42:15,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:14" (2/3) ... [2021-12-06 17:42:15,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a2f0cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.12 05:42:15, skipping insertion in model container [2021-12-06 17:42:15,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-06 17:42:15,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:42:14" (3/3) ... [2021-12-06 17:42:15,006 INFO L388 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2021-12-06 17:42:15,046 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-06 17:42:15,046 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-06 17:42:15,046 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-06 17:42:15,046 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-06 17:42:15,047 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-06 17:42:15,047 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-06 17:42:15,047 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-06 17:42:15,047 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-06 17:42:15,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 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-12-06 17:42:15,073 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2021-12-06 17:42:15,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:42:15,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:42:15,077 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 17:42:15,077 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-06 17:42:15,078 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-06 17:42:15,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 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-12-06 17:42:15,080 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2021-12-06 17:42:15,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:42:15,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:42:15,081 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-06 17:42:15,081 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-06 17:42:15,085 INFO L791 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 36#L19-3true [2021-12-06 17:42:15,086 INFO L793 eck$LassoCheckResult]: Loop: 36#L19-3true assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 3#L19-2true init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 36#L19-3true [2021-12-06 17:42:15,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-06 17:42:15,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:15,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495623582] [2021-12-06 17:42:15,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:15,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:15,164 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:42:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:15,187 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:42:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:15,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-06 17:42:15,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:15,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070383555] [2021-12-06 17:42:15,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:15,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:15,210 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:42:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:15,222 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:42:15,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-06 17:42:15,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:15,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809561026] [2021-12-06 17:42:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:15,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:15,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:42:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:15,269 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:42:15,675 INFO L210 LassoAnalysis]: Preferences: [2021-12-06 17:42:15,675 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-06 17:42:15,675 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-06 17:42:15,675 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-06 17:42:15,676 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-06 17:42:15,676 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:15,676 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-06 17:42:15,676 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-06 17:42:15,676 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2021-12-06 17:42:15,676 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-06 17:42:15,676 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-06 17:42:15,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:15,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:15,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:15,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:16,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:16,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:16,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:16,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:16,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:16,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:16,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:16,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:16,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:16,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:16,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:42:16,304 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-06 17:42:16,307 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-06 17:42:16,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-06 17:42:16,317 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-12-06 17:42:16,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-06 17:42:16,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-06 17:42:16,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-06 17:42:16,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:16,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-06 17:42:16,350 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-12-06 17:42:16,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-06 17:42:16,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-06 17:42:16,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-06 17:42:16,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-06 17:42:16,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-06 17:42:16,379 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-12-06 17:42:16,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-12-06 17:42:16,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-06 17:42:16,412 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-12-06 17:42:16,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-12-06 17:42:16,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-06 17:42:16,444 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-12-06 17:42:16,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-06 17:42:16,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,475 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-06 17:42:16,476 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-12-06 17:42:16,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-06 17:42:16,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-06 17:42:16,508 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-12-06 17:42:16,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:16,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,538 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-06 17:42:16,539 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-12-06 17:42:16,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-12-06 17:42:16,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,571 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-06 17:42:16,573 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-12-06 17:42:16,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-12-06 17:42:16,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,602 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-06 17:42:16,604 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-12-06 17:42:16,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:16,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,635 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-06 17:42:16,636 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-12-06 17:42:16,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-12-06 17:42:16,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,669 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-06 17:42:16,670 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-12-06 17:42:16,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-06 17:42:16,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,702 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-06 17:42:16,703 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-12-06 17:42:16,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-12-06 17:42:16,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,734 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-06 17:42:16,735 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-12-06 17:42:16,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-06 17:42:16,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-06 17:42:16,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-06 17:42:16,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-06 17:42:16,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,763 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-06 17:42:16,768 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-12-06 17:42:16,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:42:16,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-06 17:42:16,798 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,799 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-06 17:42:16,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-12-06 17:42:16,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:42:16,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:42:16,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:42:16,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:42:16,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:42:16,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:42:16,822 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-06 17:42:16,863 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2021-12-06 17:42:16,863 INFO L444 ModelExtractionUtils]: 0 out of 25 variables were initially zero. Simplification set additionally 22 variables to zero. [2021-12-06 17:42:16,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:42:16,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:16,865 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:16,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-06 17:42:16,866 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-06 17:42:16,874 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-06 17:42:16,874 INFO L513 LassoAnalysis]: Proved termination. [2021-12-06 17:42:16,875 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_1, ULTIMATE.start_init_~i~0#1) = 3*v_rep(select #length ~#pp~0.base)_1 - 16*ULTIMATE.start_init_~i~0#1 Supporting invariants [] [2021-12-06 17:42:16,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-12-06 17:42:16,949 INFO L297 tatePredicateManager]: 21 out of 23 supporting invariants were superfluous and have been removed [2021-12-06 17:42:16,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:16,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:42:16,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 17:42:17,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:17,058 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-06 17:42:17,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 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 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-12-06 17:42:17,153 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 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 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 95 states and 138 transitions. Complement of second has 8 states. [2021-12-06 17:42:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-06 17:42:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-12-06 17:42:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2021-12-06 17:42:17,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 94 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-06 17:42:17,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-06 17:42:17,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 94 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-06 17:42:17,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-06 17:42:17,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 94 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-06 17:42:17,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-06 17:42:17,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 138 transitions. [2021-12-06 17:42:17,169 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-06 17:42:17,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 28 states and 37 transitions. [2021-12-06 17:42:17,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-12-06 17:42:17,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-06 17:42:17,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2021-12-06 17:42:17,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:42:17,173 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-12-06 17:42:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2021-12-06 17:42:17,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-06 17:42:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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-12-06 17:42:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-12-06 17:42:17,190 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-12-06 17:42:17,190 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-12-06 17:42:17,190 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-06 17:42:17,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2021-12-06 17:42:17,191 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-06 17:42:17,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:42:17,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:42:17,191 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:17,191 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-06 17:42:17,192 INFO L791 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 277#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 278#L19-3 assume !(init_~i~0#1 < 2); 293#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 284#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 280#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 273#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 274#L27-3 [2021-12-06 17:42:17,192 INFO L793 eck$LassoCheckResult]: Loop: 274#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 295#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 279#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 274#L27-3 [2021-12-06 17:42:17,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:17,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2021-12-06 17:42:17,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:17,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953381736] [2021-12-06 17:42:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:17,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:17,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953381736] [2021-12-06 17:42:17,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953381736] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:17,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:17,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:42:17,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188357471] [2021-12-06 17:42:17,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:17,224 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-06 17:42:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:17,225 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2021-12-06 17:42:17,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:17,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22517257] [2021-12-06 17:42:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:17,229 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:42:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:17,234 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:42:17,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:17,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:42:17,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:42:17,268 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-12-06 17:42:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:17,278 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-12-06 17:42:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:17,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2021-12-06 17:42:17,280 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-06 17:42:17,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2021-12-06 17:42:17,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-12-06 17:42:17,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-06 17:42:17,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2021-12-06 17:42:17,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:42:17,281 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-06 17:42:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2021-12-06 17:42:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-12-06 17:42:17,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 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-12-06 17:42:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2021-12-06 17:42:17,283 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-12-06 17:42:17,284 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-12-06 17:42:17,284 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-06 17:42:17,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2021-12-06 17:42:17,284 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-06 17:42:17,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:42:17,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:42:17,285 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:17,285 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-06 17:42:17,285 INFO L791 eck$LassoCheckResult]: Stem: 352#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 340#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 341#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 331#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 332#L19-3 assume !(init_~i~0#1 < 2); 356#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 344#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 343#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 333#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 334#L27-3 [2021-12-06 17:42:17,285 INFO L793 eck$LassoCheckResult]: Loop: 334#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 358#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 342#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 334#L27-3 [2021-12-06 17:42:17,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:17,285 INFO L85 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2021-12-06 17:42:17,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:17,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946014953] [2021-12-06 17:42:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:17,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:17,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946014953] [2021-12-06 17:42:17,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946014953] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:17,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536104694] [2021-12-06 17:42:17,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,326 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:17,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:17,327 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:17,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-06 17:42:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:42:17,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:17,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:42:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:17,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536104694] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:42:17,404 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:42:17,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-06 17:42:17,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858327093] [2021-12-06 17:42:17,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:42:17,404 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-06 17:42:17,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2021-12-06 17:42:17,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:17,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441665048] [2021-12-06 17:42:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:17,409 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:42:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:17,413 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:42:17,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:42:17,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:42:17,447 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-12-06 17:42:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:17,461 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2021-12-06 17:42:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:42:17,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2021-12-06 17:42:17,463 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-06 17:42:17,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2021-12-06 17:42:17,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-12-06 17:42:17,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-06 17:42:17,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2021-12-06 17:42:17,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:42:17,464 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-12-06 17:42:17,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2021-12-06 17:42:17,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-06 17:42:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 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-12-06 17:42:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-12-06 17:42:17,466 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-12-06 17:42:17,466 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-12-06 17:42:17,466 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-06 17:42:17,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2021-12-06 17:42:17,467 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-12-06 17:42:17,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:42:17,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:42:17,467 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:17,467 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-06 17:42:17,468 INFO L791 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 452#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 453#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 445#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 446#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 473#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 474#L19-3 assume !(init_~i~0#1 < 2); 470#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 458#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 457#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 447#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 448#L27-3 [2021-12-06 17:42:17,468 INFO L793 eck$LassoCheckResult]: Loop: 448#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 472#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 456#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 448#L27-3 [2021-12-06 17:42:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2021-12-06 17:42:17,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:17,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866012066] [2021-12-06 17:42:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:17,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-12-06 17:42:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:17,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:42:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:17,548 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:42:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:17,548 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2021-12-06 17:42:17,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:17,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356952602] [2021-12-06 17:42:17,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:17,553 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:42:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:17,558 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:42:17,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:17,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2021-12-06 17:42:17,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:17,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814153288] [2021-12-06 17:42:17,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:17,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:17,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814153288] [2021-12-06 17:42:17,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814153288] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:17,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203176868] [2021-12-06 17:42:17,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:17,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:17,785 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:17,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-06 17:42:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-06 17:42:17,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:17,881 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-12-06 17:42:17,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:17,886 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 18 treesize of output 20 [2021-12-06 17:42:17,891 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-12-06 17:42:17,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:17,895 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 18 treesize of output 20 [2021-12-06 17:42:17,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:17,969 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-06 17:42:17,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:17,979 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-06 17:42:17,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:17,987 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 14 treesize of output 16 [2021-12-06 17:42:17,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:17,991 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 14 treesize of output 16 [2021-12-06 17:42:18,072 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-12-06 17:42:18,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-12-06 17:42:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:18,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:42:18,144 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_183 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |c_ULTIMATE.start_init_~i~0#1| 4) |c_~#pp~0.offset|) v_ArrVal_183)) |c_~#pstate~0.base| v_ArrVal_186) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)) (forall ((v_ArrVal_187 Int) (v_ArrVal_188 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |c_ULTIMATE.start_init_~i~0#1| 4) |c_~#pp~0.offset|) v_ArrVal_187)) |c_~#pstate~0.base| v_ArrVal_188) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0))) is different from false [2021-12-06 17:42:18,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_init_~i~0#1_113| Int)) (or (and (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_183 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_init_~i~0#1_113| 4) |c_~#pp~0.offset|) v_ArrVal_183)) |c_~#pstate~0.base| v_ArrVal_186) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)) (forall ((v_ArrVal_187 Int) (v_ArrVal_188 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_init_~i~0#1_113| 4) |c_~#pp~0.offset|) v_ArrVal_187)) |c_~#pstate~0.base| v_ArrVal_188) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0))) (< |v_ULTIMATE.start_init_~i~0#1_113| (+ |c_ULTIMATE.start_init_~i~0#1| 1)))) is different from false [2021-12-06 17:42:18,202 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:18,203 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 94 [2021-12-06 17:42:18,208 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:18,208 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 82 [2021-12-06 17:42:18,214 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 120 treesize of output 116 [2021-12-06 17:42:18,223 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:18,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 130 treesize of output 134 [2021-12-06 17:42:18,229 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 148 treesize of output 146 [2021-12-06 17:42:18,234 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 184 treesize of output 180 [2021-12-06 17:42:18,243 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:18,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 194 treesize of output 198 [2021-12-06 17:42:18,251 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 212 treesize of output 210 [2021-12-06 17:42:18,261 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 177 treesize of output 173 [2021-12-06 17:42:18,269 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 173 treesize of output 169 [2021-12-06 17:42:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-06 17:42:18,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203176868] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:42:18,359 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:42:18,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2021-12-06 17:42:18,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809647079] [2021-12-06 17:42:18,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:42:18,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:18,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 17:42:18,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=294, Unknown=2, NotChecked=74, Total=462 [2021-12-06 17:42:18,397 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 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-12-06 17:42:30,472 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_init_~i~0#1| 4) |c_~#pp~0.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse0) 0) (= |c_ULTIMATE.start_init_~i~0#1| 0) (forall ((|v_ULTIMATE.start_init_~i~0#1_113| Int)) (or (and (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_183 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_init_~i~0#1_113| 4) |c_~#pp~0.offset|) v_ArrVal_183)) |c_~#pstate~0.base| v_ArrVal_186) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)) (forall ((v_ArrVal_187 Int) (v_ArrVal_188 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_init_~i~0#1_113| 4) |c_~#pp~0.offset|) v_ArrVal_187)) |c_~#pstate~0.base| v_ArrVal_188) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0))) (< |v_ULTIMATE.start_init_~i~0#1_113| (+ |c_ULTIMATE.start_init_~i~0#1| 1)))) (<= |c_~#pp~0.base| 4) (<= 5 |c_~#pstate~0.base|) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse0) 0) (= |c_~#pp~0.offset| 0))) is different from false [2021-12-06 17:42:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:30,576 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2021-12-06 17:42:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:42:30,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2021-12-06 17:42:30,578 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-06 17:42:30,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2021-12-06 17:42:30,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-12-06 17:42:30,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-06 17:42:30,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2021-12-06 17:42:30,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:42:30,579 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-12-06 17:42:30,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2021-12-06 17:42:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-06 17:42:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 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-12-06 17:42:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-12-06 17:42:30,580 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-12-06 17:42:30,580 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-12-06 17:42:30,580 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-06 17:42:30,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2021-12-06 17:42:30,581 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-06 17:42:30,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:42:30,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:42:30,581 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:30,581 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-06 17:42:30,582 INFO L791 eck$LassoCheckResult]: Stem: 638#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 625#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 626#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 618#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 619#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 645#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 646#L19-3 assume !(init_~i~0#1 < 2); 642#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 630#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 629#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 620#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 621#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 644#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 640#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 639#L27-7 [2021-12-06 17:42:30,582 INFO L793 eck$LassoCheckResult]: Loop: 639#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 631#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 633#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 639#L27-7 [2021-12-06 17:42:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2021-12-06 17:42:30,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:30,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982845081] [2021-12-06 17:42:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:30,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:30,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:42:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:30,639 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:42:30,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2021-12-06 17:42:30,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:30,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592966269] [2021-12-06 17:42:30,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:30,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:30,644 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:42:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:30,647 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:42:30,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:30,648 INFO L85 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2021-12-06 17:42:30,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:30,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663346148] [2021-12-06 17:42:30,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:30,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:30,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:42:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:42:30,705 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:42:54,043 WARN L227 SmtUtils]: Spent 23.31s on a formula simplification. DAG size of input: 295 DAG size of output: 250 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-06 17:43:01,184 WARN L227 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 190 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-06 17:43:01,187 INFO L210 LassoAnalysis]: Preferences: [2021-12-06 17:43:01,187 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-06 17:43:01,187 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-06 17:43:01,187 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-06 17:43:01,187 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-06 17:43:01,187 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:43:01,187 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-06 17:43:01,187 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-06 17:43:01,188 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2021-12-06 17:43:01,188 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-06 17:43:01,188 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-06 17:43:01,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:43:01,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:43:01,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:43:01,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:43:05,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:43:05,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:43:05,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-12-06 17:43:05,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:43:05,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-12-06 17:43:05,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:43:05,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-12-06 17:43:05,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-12-06 17:43:05,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-12-06 17:43:05,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-06 17:43:05,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-12-06 17:43:05,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-12-06 17:43:06,110 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-06 17:43:06,111 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-06 17:43:06,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:43:06,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:06,125 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:43:06,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-06 17:43:06,127 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-12-06 17:43:06,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:43:06,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-06 17:43:06,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:43:06,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:43:06,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:43:06,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-06 17:43:06,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-06 17:43:06,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:43:06,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-06 17:43:06,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:43:06,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:06,154 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:43:06,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-06 17:43:06,155 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-12-06 17:43:06,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:43:06,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:43:06,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:43:06,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:43:06,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:43:06,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:43:06,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:43:06,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-06 17:43:06,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:43:06,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:06,184 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:43:06,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-06 17:43:06,185 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-12-06 17:43:06,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:43:06,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-06 17:43:06,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:43:06,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:43:06,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:43:06,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-06 17:43:06,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-06 17:43:06,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:43:06,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-06 17:43:06,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:43:06,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:06,212 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:43:06,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-06 17:43:06,213 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-12-06 17:43:06,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:43:06,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:43:06,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:43:06,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:43:06,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:43:06,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:43:06,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:43:06,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-06 17:43:06,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:43:06,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:06,244 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:43:06,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-06 17:43:06,245 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-12-06 17:43:06,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:43:06,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:43:06,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:43:06,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:43:06,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:43:06,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:43:06,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:43:06,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-06 17:43:06,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:43:06,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:06,273 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:43:06,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-06 17:43:06,275 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-12-06 17:43:06,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:43:06,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:43:06,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:43:06,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:43:06,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:43:06,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:43:06,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-06 17:43:06,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-06 17:43:06,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:43:06,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:06,306 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:43:06,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-06 17:43:06,307 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-12-06 17:43:06,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-06 17:43:06,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-06 17:43:06,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-06 17:43:06,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-06 17:43:06,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-06 17:43:06,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-06 17:43:06,328 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-06 17:43:06,352 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-12-06 17:43:06,352 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. [2021-12-06 17:43:06,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-06 17:43:06,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:06,353 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-06 17:43:06,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-06 17:43:06,354 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-06 17:43:06,363 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-06 17:43:06,363 INFO L513 LassoAnalysis]: Proved termination. [2021-12-06 17:43:06,363 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1#1) = -2*ULTIMATE.start_f_~i~1#1 + 3 Supporting invariants [] [2021-12-06 17:43:06,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-06 17:43:06,565 INFO L297 tatePredicateManager]: 55 out of 55 supporting invariants were superfluous and have been removed [2021-12-06 17:43:06,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:06,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:43:06,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:06,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:43:06,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:06,626 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-12-06 17:43:06,626 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-06 17:43:06,642 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 68 states and 88 transitions. Complement of second has 6 states. [2021-12-06 17:43:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-06 17:43:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-06 17:43:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2021-12-06 17:43:06,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-06 17:43:06,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-06 17:43:06,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2021-12-06 17:43:06,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-06 17:43:06,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2021-12-06 17:43:06,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-06 17:43:06,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2021-12-06 17:43:06,647 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-12-06 17:43:06,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2021-12-06 17:43:06,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-12-06 17:43:06,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-12-06 17:43:06,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2021-12-06 17:43:06,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-06 17:43:06,648 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2021-12-06 17:43:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2021-12-06 17:43:06,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2021-12-06 17:43:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 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-12-06 17:43:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-12-06 17:43:06,651 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-06 17:43:06,651 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-06 17:43:06,651 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-06 17:43:06,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2021-12-06 17:43:06,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-06 17:43:06,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:43:06,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:43:06,652 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:06,653 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-06 17:43:06,653 INFO L791 eck$LassoCheckResult]: Stem: 1030#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1016#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1017#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1009#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1010#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1038#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1039#L19-3 assume !(init_~i~0#1 < 2); 1035#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1021#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1020#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1014#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1015#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1037#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1032#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1033#L27-7 assume !(f_~i~1#1 < 2); 1023#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1011#L38-3 [2021-12-06 17:43:06,653 INFO L793 eck$LassoCheckResult]: Loop: 1011#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1013#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1028#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1011#L38-3 [2021-12-06 17:43:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:06,653 INFO L85 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2021-12-06 17:43:06,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:06,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254721311] [2021-12-06 17:43:06,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:06,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 17:43:06,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:06,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254721311] [2021-12-06 17:43:06,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254721311] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:06,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:06,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:43:06,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329645477] [2021-12-06 17:43:06,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:06,693 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-06 17:43:06,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 1 times [2021-12-06 17:43:06,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:06,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144699200] [2021-12-06 17:43:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:06,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:06,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:43:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:06,701 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:43:06,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-06 17:43:06,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:06,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:43:06,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:43:06,730 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-12-06 17:43:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:06,743 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2021-12-06 17:43:06,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:43:06,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2021-12-06 17:43:06,745 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-12-06 17:43:06,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2021-12-06 17:43:06,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-12-06 17:43:06,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-12-06 17:43:06,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-12-06 17:43:06,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-06 17:43:06,746 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-12-06 17:43:06,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-12-06 17:43:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2021-12-06 17:43:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 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-12-06 17:43:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2021-12-06 17:43:06,748 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-12-06 17:43:06,748 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-12-06 17:43:06,748 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-06 17:43:06,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2021-12-06 17:43:06,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-06 17:43:06,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:43:06,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:43:06,749 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:06,749 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-06 17:43:06,749 INFO L791 eck$LassoCheckResult]: Stem: 1113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1102#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1092#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1093#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1121#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1122#L19-3 assume !(init_~i~0#1 < 2); 1118#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1104#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1103#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1094#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1095#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1120#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1115#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1116#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1105#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1106#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1096#L38-3 [2021-12-06 17:43:06,750 INFO L793 eck$LassoCheckResult]: Loop: 1096#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1098#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1111#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1096#L38-3 [2021-12-06 17:43:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2021-12-06 17:43:06,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:06,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058660816] [2021-12-06 17:43:06,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:06,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 17:43:06,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:06,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058660816] [2021-12-06 17:43:06,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058660816] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:06,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:06,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:43:06,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544753023] [2021-12-06 17:43:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:06,887 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-06 17:43:06,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:06,887 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 2 times [2021-12-06 17:43:06,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:06,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872231459] [2021-12-06 17:43:06,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:06,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:06,890 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:43:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:06,893 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:43:06,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:43:06,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:43:06,924 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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-12-06 17:43:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:07,086 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2021-12-06 17:43:07,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:43:07,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2021-12-06 17:43:07,087 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-12-06 17:43:07,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2021-12-06 17:43:07,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-12-06 17:43:07,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-12-06 17:43:07,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2021-12-06 17:43:07,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-06 17:43:07,088 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2021-12-06 17:43:07,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2021-12-06 17:43:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2021-12-06 17:43:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-12-06 17:43:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2021-12-06 17:43:07,090 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-12-06 17:43:07,090 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-12-06 17:43:07,090 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-06 17:43:07,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2021-12-06 17:43:07,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-06 17:43:07,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:43:07,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:43:07,091 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:07,091 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-06 17:43:07,091 INFO L791 eck$LassoCheckResult]: Stem: 1212#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1201#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1191#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1192#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1220#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1221#L19-3 assume !(init_~i~0#1 < 2); 1217#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1207#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1202#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1196#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1197#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1219#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1214#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1215#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1205#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1206#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1213#L27-7 assume !(f_~i~1#1 < 2); 1204#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1193#L38-3 [2021-12-06 17:43:07,091 INFO L793 eck$LassoCheckResult]: Loop: 1193#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1195#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1210#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1193#L38-3 [2021-12-06 17:43:07,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2021-12-06 17:43:07,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:07,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179530600] [2021-12-06 17:43:07,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:07,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 17:43:07,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:07,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179530600] [2021-12-06 17:43:07,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179530600] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:43:07,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87040748] [2021-12-06 17:43:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:07,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:43:07,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:07,125 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:43:07,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-06 17:43:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:07,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:43:07,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 17:43:07,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 17:43:07,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87040748] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:07,227 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:43:07,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-06 17:43:07,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554106189] [2021-12-06 17:43:07,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:07,228 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-06 17:43:07,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:07,228 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 3 times [2021-12-06 17:43:07,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:07,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435805812] [2021-12-06 17:43:07,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:07,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:07,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:43:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:07,234 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:43:07,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:07,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:43:07,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:43:07,264 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-12-06 17:43:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:07,280 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2021-12-06 17:43:07,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:43:07,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2021-12-06 17:43:07,282 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-12-06 17:43:07,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2021-12-06 17:43:07,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-12-06 17:43:07,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-12-06 17:43:07,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-12-06 17:43:07,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-06 17:43:07,283 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-12-06 17:43:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-12-06 17:43:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2021-12-06 17:43:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 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-12-06 17:43:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-12-06 17:43:07,286 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-12-06 17:43:07,286 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-12-06 17:43:07,286 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-06 17:43:07,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2021-12-06 17:43:07,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-06 17:43:07,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:43:07,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:43:07,287 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:07,288 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-06 17:43:07,288 INFO L791 eck$LassoCheckResult]: Stem: 1405#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1394#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1384#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1385#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1414#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1415#L19-3 assume !(init_~i~0#1 < 2); 1410#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1396#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1395#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1386#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1387#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1412#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1407#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1408#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1399#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1400#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1406#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1397#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1398#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1388#L38-3 [2021-12-06 17:43:07,288 INFO L793 eck$LassoCheckResult]: Loop: 1388#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1390#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1403#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1388#L38-3 [2021-12-06 17:43:07,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2021-12-06 17:43:07,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:07,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093204090] [2021-12-06 17:43:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:07,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:07,316 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:43:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:07,346 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:43:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:07,347 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 4 times [2021-12-06 17:43:07,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:07,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652350063] [2021-12-06 17:43:07,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:07,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:07,351 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:43:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:07,354 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:43:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash 951949698, now seen corresponding path program 1 times [2021-12-06 17:43:07,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:07,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850177977] [2021-12-06 17:43:07,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:07,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 17:43:07,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:07,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850177977] [2021-12-06 17:43:07,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850177977] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:43:07,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556145869] [2021-12-06 17:43:07,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:07,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:43:07,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:07,769 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:43:07,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-12-06 17:43:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:07,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-06 17:43:07,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:07,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-06 17:43:07,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:07,974 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 14 treesize of output 16 [2021-12-06 17:43:07,979 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-06 17:43:07,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:07,984 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 14 treesize of output 16 [2021-12-06 17:43:08,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:08,122 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-06 17:43:08,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:08,128 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-06 17:43:08,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:08,134 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 14 treesize of output 16 [2021-12-06 17:43:08,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:08,137 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 14 treesize of output 16 [2021-12-06 17:43:08,204 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-12-06 17:43:08,206 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 22 treesize of output 10 [2021-12-06 17:43:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 17:43:08,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:08,292 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |c_ULTIMATE.start_f_~i~1#1| 4)) v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|))) (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |c_ULTIMATE.start_f_~i~1#1| 4)) v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2021-12-06 17:43:08,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_f_~i~1#1_83| Int)) (or (and (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_f_~i~1#1_83| 4)) v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_f_~i~1#1_83| 4)) v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) (< |v_ULTIMATE.start_f_~i~1#1_83| (+ |c_ULTIMATE.start_f_~i~1#1| 1)))) is different from false [2021-12-06 17:43:08,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_f_~i~1#1_83| Int)) (or (and (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_f_~i~1#1_83| 4)) v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_f_~i~1#1_83| 4)) v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) (< |v_ULTIMATE.start_f_~i~1#1_83| 1))) is different from false [2021-12-06 17:43:08,407 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:08,407 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 94 [2021-12-06 17:43:08,411 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:08,412 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 82 [2021-12-06 17:43:08,414 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 120 treesize of output 116 [2021-12-06 17:43:08,418 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 154 treesize of output 150 [2021-12-06 17:43:08,426 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:08,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 164 treesize of output 168 [2021-12-06 17:43:08,431 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 182 treesize of output 180 [2021-12-06 17:43:08,440 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:08,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 194 treesize of output 198 [2021-12-06 17:43:08,444 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 212 treesize of output 210 [2021-12-06 17:43:08,451 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 177 treesize of output 173 [2021-12-06 17:43:08,455 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 173 treesize of output 169 [2021-12-06 17:43:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2021-12-06 17:43:08,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556145869] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:08,567 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:43:08,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 31 [2021-12-06 17:43:08,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388489435] [2021-12-06 17:43:08,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:08,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:08,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-06 17:43:08,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=688, Unknown=3, NotChecked=168, Total=992 [2021-12-06 17:43:08,593 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 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-12-06 17:43:20,651 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.base| 0) (= |c_ULTIMATE.start_f_~i~1#1| 0) (forall ((|v_ULTIMATE.start_f_~i~1#1_83| Int)) (or (and (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_f_~i~1#1_83| 4)) v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_f_~i~1#1_83| 4)) v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) (< |v_ULTIMATE.start_f_~i~1#1_83| 1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) |c_~#pp~0.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_f_~pointer#1.offset|) (<= |c_~#pp~0.base| 4) (<= 5 |c_~#pstate~0.base|) (= |c_~#pp~0.offset| 0) (= |c_ULTIMATE.start_f_~pointer#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 1) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) |c_~#pp~0.offset|))) is different from false [2021-12-06 17:43:32,656 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.base| 0) (= |c_ULTIMATE.start_f_~i~1#1| 0) (forall ((|v_ULTIMATE.start_f_~i~1#1_83| Int)) (or (and (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_f_~i~1#1_83| 4)) v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_f_~i~1#1_83| 4)) v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) (< |v_ULTIMATE.start_f_~i~1#1_83| (+ |c_ULTIMATE.start_f_~i~1#1| 1)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) |c_~#pp~0.offset|)) (<= |c_~#pp~0.base| 4) (<= 5 |c_~#pstate~0.base|) (= |c_~#pp~0.offset| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 1) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) |c_~#pp~0.offset|))) is different from false [2021-12-06 17:43:44,660 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|)) (.cse1 (+ |c_~#pp~0.offset| (* |c_ULTIMATE.start_f_~i~1#1| 4))) (.cse2 (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|))) (and (= |c_ULTIMATE.start_main_~a~0#1.base| 0) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (= |c_ULTIMATE.start_f_~i~1#1| 0) (= |c_ULTIMATE.start_f_#t~mem6#1.base| 0) (forall ((|v_ULTIMATE.start_f_~i~1#1_83| Int)) (or (and (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_f_~i~1#1_83| 4)) v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |v_ULTIMATE.start_f_~i~1#1_83| 4)) v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) (< |v_ULTIMATE.start_f_~i~1#1_83| (+ |c_ULTIMATE.start_f_~i~1#1| 1)))) (<= 0 |c_~#pp~0.offset|) (<= |c_~#pp~0.offset| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse0 |c_~#pp~0.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse0 .cse1)) (<= |c_~#pp~0.base| 4) (<= 5 |c_~#pstate~0.base|) (= |c_~#pp~0.offset| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 1) (= (select .cse2 .cse1) |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| (select .cse2 |c_~#pp~0.offset|)) (= (+ |c_~#pp~0.offset| (* 4 |c_ULTIMATE.start_f_~i~1#1|)) 0))) is different from false [2021-12-06 17:43:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:44,842 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2021-12-06 17:43:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 17:43:44,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2021-12-06 17:43:44,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-06 17:43:44,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2021-12-06 17:43:44,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-06 17:43:44,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-12-06 17:43:44,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2021-12-06 17:43:44,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-06 17:43:44,845 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-06 17:43:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2021-12-06 17:43:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2021-12-06 17:43:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 35 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-12-06 17:43:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2021-12-06 17:43:44,847 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-12-06 17:43:44,847 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-12-06 17:43:44,847 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-06 17:43:44,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2021-12-06 17:43:44,848 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-06 17:43:44,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:43:44,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:43:44,849 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:44,849 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-06 17:43:44,849 INFO L791 eck$LassoCheckResult]: Stem: 1659#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1647#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1648#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1639#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1640#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1670#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1674#L19-3 assume !(init_~i~0#1 < 2); 1666#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1654#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1649#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1643#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1644#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1668#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1661#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1662#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1652#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1653#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1660#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1650#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1651#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1641#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1642#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1658#L41 [2021-12-06 17:43:44,849 INFO L793 eck$LassoCheckResult]: Loop: 1658#L41 assume 1 == g_#t~mem9#1; 1656#L41-2 havoc g_#t~mem9#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1657#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1665#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1672#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1658#L41 [2021-12-06 17:43:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2021-12-06 17:43:44,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:44,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34592988] [2021-12-06 17:43:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:44,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:44,884 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:43:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:44,907 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:43:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash 102360307, now seen corresponding path program 1 times [2021-12-06 17:43:44,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:44,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058155911] [2021-12-06 17:43:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:44,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:44,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:43:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:44,917 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:43:44,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash -289347350, now seen corresponding path program 1 times [2021-12-06 17:43:44,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:44,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412310209] [2021-12-06 17:43:44,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:44,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 17:43:45,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:45,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412310209] [2021-12-06 17:43:45,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412310209] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:43:45,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669081691] [2021-12-06 17:43:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:45,089 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:43:45,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:45,090 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:43:45,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-12-06 17:43:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:45,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-06 17:43:45,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:45,391 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2021-12-06 17:43:45,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:45,393 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 16 treesize of output 18 [2021-12-06 17:43:45,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:45,481 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 16 treesize of output 18 [2021-12-06 17:43:45,528 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-12-06 17:43:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 17:43:45,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:45,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_958 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_958) |c_~#pp~0.base|) (+ (* |c_ULTIMATE.start_g_~i~2#1| 4) |c_~#pp~0.offset| 4)) |c_ULTIMATE.start_g_~pointer#1.offset|))) is different from false [2021-12-06 17:43:45,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_958 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_958) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4))))) is different from false [2021-12-06 17:43:45,591 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:45,592 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2021-12-06 17:43:45,596 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:45,596 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 41 treesize of output 41 [2021-12-06 17:43:45,599 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 22 treesize of output 18 [2021-12-06 17:43:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2021-12-06 17:43:45,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669081691] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:45,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:43:45,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-06 17:43:45,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860634686] [2021-12-06 17:43:45,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:45,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:45,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-06 17:43:45,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=718, Unknown=2, NotChecked=110, Total=930 [2021-12-06 17:43:45,864 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 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-12-06 17:43:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:46,792 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2021-12-06 17:43:46,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 17:43:46,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 86 transitions. [2021-12-06 17:43:46,794 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 26 [2021-12-06 17:43:46,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 86 transitions. [2021-12-06 17:43:46,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2021-12-06 17:43:46,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2021-12-06 17:43:46,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 86 transitions. [2021-12-06 17:43:46,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-06 17:43:46,795 INFO L681 BuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2021-12-06 17:43:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 86 transitions. [2021-12-06 17:43:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2021-12-06 17:43:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 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-12-06 17:43:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2021-12-06 17:43:46,798 INFO L704 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-12-06 17:43:46,798 INFO L587 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-12-06 17:43:46,798 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-06 17:43:46,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2021-12-06 17:43:46,798 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-06 17:43:46,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:43:46,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:43:46,799 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:46,799 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-06 17:43:46,799 INFO L791 eck$LassoCheckResult]: Stem: 2003#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1991#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1992#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1983#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1984#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2019#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 2020#L19-3 assume !(init_~i~0#1 < 2); 2013#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1994#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 1993#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1987#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1988#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2015#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 2005#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 2006#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2016#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 2022#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 2017#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1997#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1998#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 2004#L27-7 assume !(f_~i~1#1 < 2); 2021#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1985#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1986#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 2011#L41 [2021-12-06 17:43:46,799 INFO L793 eck$LassoCheckResult]: Loop: 2011#L41 assume 1 == g_#t~mem9#1; 2012#L41-2 havoc g_#t~mem9#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 2026#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 2023#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2024#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 2011#L41 [2021-12-06 17:43:46,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2021-12-06 17:43:46,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:46,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953107292] [2021-12-06 17:43:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:46,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:46,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:43:46,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953107292] [2021-12-06 17:43:46,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953107292] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:43:46,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797229976] [2021-12-06 17:43:46,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:46,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:43:46,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:43:46,960 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:43:46,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-12-06 17:43:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:47,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-06 17:43:47,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:47,083 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2021-12-06 17:43:47,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:47,085 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 16 treesize of output 18 [2021-12-06 17:43:47,089 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2021-12-06 17:43:47,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:47,091 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 16 treesize of output 18 [2021-12-06 17:43:47,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:47,185 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-06 17:43:47,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:47,190 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-06 17:43:47,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:47,194 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 16 treesize of output 18 [2021-12-06 17:43:47,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:47,199 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 16 treesize of output 18 [2021-12-06 17:43:47,270 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-12-06 17:43:47,273 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-12-06 17:43:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:47,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:47,356 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1064 Int) (v_ArrVal_1063 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |c_ULTIMATE.start_f_~i~1#1| 4)) v_ArrVal_1064)) |c_~#pstate~0.base| v_ArrVal_1063) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) 0)) (forall ((v_ArrVal_1062 Int) (v_ArrVal_1065 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |c_ULTIMATE.start_f_~i~1#1| 4)) v_ArrVal_1062)) |c_~#pstate~0.base| v_ArrVal_1065) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4))))) is different from false [2021-12-06 17:43:47,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_f_~i~1#1_94| Int)) (or (< 0 |v_ULTIMATE.start_f_~i~1#1_94|) (and (forall ((v_ArrVal_1062 Int) (v_ArrVal_1065 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_94| 4) |c_~#pp~0.offset|) v_ArrVal_1062)) |c_~#pstate~0.base| v_ArrVal_1065) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)))) (forall ((v_ArrVal_1064 Int) (v_ArrVal_1063 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_94| 4) |c_~#pp~0.offset|) v_ArrVal_1064)) |c_~#pstate~0.base| v_ArrVal_1063) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) 0))))) is different from false [2021-12-06 17:43:47,485 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:47,486 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 98 [2021-12-06 17:43:47,490 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:47,490 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 86 [2021-12-06 17:43:47,493 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 130 treesize of output 126 [2021-12-06 17:43:47,497 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 170 treesize of output 166 [2021-12-06 17:43:47,500 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 184 treesize of output 180 [2021-12-06 17:43:47,507 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:47,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 198 treesize of output 202 [2021-12-06 17:43:47,515 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:47,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 220 treesize of output 224 [2021-12-06 17:43:47,520 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 242 treesize of output 238 [2021-12-06 17:43:47,526 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 201 treesize of output 193 [2021-12-06 17:43:47,530 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 193 treesize of output 185 [2021-12-06 17:43:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-06 17:43:47,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797229976] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:47,604 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:43:47,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-12-06 17:43:47,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540984237] [2021-12-06 17:43:47,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:47,604 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-06 17:43:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash 102360307, now seen corresponding path program 2 times [2021-12-06 17:43:47,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:43:47,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744183184] [2021-12-06 17:43:47,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:47,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:43:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:47,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:43:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:43:47,613 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:43:47,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:43:47,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-06 17:43:47,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=460, Unknown=2, NotChecked=90, Total=650 [2021-12-06 17:43:47,757 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 13 Second operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 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-12-06 17:43:59,864 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|)) (.cse1 (+ |c_~#pp~0.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|)) (.cse3 (+ (* |c_ULTIMATE.start_init_~i~0#1| 4) |c_~#pp~0.offset|))) (and (forall ((|v_ULTIMATE.start_f_~i~1#1_94| Int)) (or (< 0 |v_ULTIMATE.start_f_~i~1#1_94|) (and (forall ((v_ArrVal_1062 Int) (v_ArrVal_1065 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_94| 4) |c_~#pp~0.offset|) v_ArrVal_1062)) |c_~#pstate~0.base| v_ArrVal_1065) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)))) (forall ((v_ArrVal_1064 Int) (v_ArrVal_1063 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_94| 4) |c_~#pp~0.offset|) v_ArrVal_1064)) |c_~#pstate~0.base| v_ArrVal_1063) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) 0))))) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_init_~i~0#1| 1) (= (select .cse2 .cse3) 0) (= (select .cse2 .cse1) 0) (<= |c_~#pp~0.base| 4) (<= 5 |c_~#pstate~0.base|) (= (select .cse0 .cse3) 0) (= |c_~#pp~0.offset| 0))) is different from false [2021-12-06 17:44:11,869 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#pp~0.offset| 4))) (and (forall ((|v_ULTIMATE.start_f_~i~1#1_94| Int)) (or (< 0 |v_ULTIMATE.start_f_~i~1#1_94|) (and (forall ((v_ArrVal_1062 Int) (v_ArrVal_1065 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_94| 4) |c_~#pp~0.offset|) v_ArrVal_1062)) |c_~#pstate~0.base| v_ArrVal_1065) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)))) (forall ((v_ArrVal_1064 Int) (v_ArrVal_1063 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_f_~i~1#1_94| 4) |c_~#pp~0.offset|) v_ArrVal_1064)) |c_~#pstate~0.base| v_ArrVal_1063) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse0) 0) (<= |c_~#pp~0.base| 4) (<= 5 |c_~#pstate~0.base|) (= |c_~#pp~0.offset| 0))) is different from false [2021-12-06 17:44:12,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:12,070 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2021-12-06 17:44:12,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:44:12,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 94 transitions. [2021-12-06 17:44:12,072 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2021-12-06 17:44:12,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 82 states and 93 transitions. [2021-12-06 17:44:12,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2021-12-06 17:44:12,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2021-12-06 17:44:12,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 93 transitions. [2021-12-06 17:44:12,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-06 17:44:12,074 INFO L681 BuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2021-12-06 17:44:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 93 transitions. [2021-12-06 17:44:12,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2021-12-06 17:44:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 64 states have internal predecessors, (74), 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-12-06 17:44:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2021-12-06 17:44:12,078 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 74 transitions. [2021-12-06 17:44:12,078 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 74 transitions. [2021-12-06 17:44:12,078 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-06 17:44:12,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 74 transitions. [2021-12-06 17:44:12,079 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-06 17:44:12,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-06 17:44:12,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-06 17:44:12,079 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:12,079 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-06 17:44:12,080 INFO L791 eck$LassoCheckResult]: Stem: 2326#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 2310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 2311#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2304#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 2305#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2342#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 2351#L19-3 assume !(init_~i~0#1 < 2); 2350#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 2349#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post10#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post10#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post10#1;havoc malloc_#t~post10#1; 2348#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 2306#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 2307#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2340#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 2345#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 2344#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2343#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 2327#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 2328#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2317#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 2318#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 2308#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2309#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 2358#L41 assume 1 == g_#t~mem9#1; 2322#L41-2 havoc g_#t~mem9#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 2323#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 2334#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2355#L39 [2021-12-06 17:44:12,080 INFO L793 eck$LassoCheckResult]: Loop: 2355#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 2356#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 2354#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2355#L39 [2021-12-06 17:44:12,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash -147881120, now seen corresponding path program 2 times [2021-12-06 17:44:12,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:12,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351994025] [2021-12-06 17:44:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:12,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:44:12,111 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:44:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:44:12,130 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:44:12,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:12,130 INFO L85 PathProgramCache]: Analyzing trace with hash 116228, now seen corresponding path program 5 times [2021-12-06 17:44:12,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:12,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527341201] [2021-12-06 17:44:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:12,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:44:12,133 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:44:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:44:12,136 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:44:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1110086213, now seen corresponding path program 1 times [2021-12-06 17:44:12,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:44:12,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590052879] [2021-12-06 17:44:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:12,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:44:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 17:44:12,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:44:12,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590052879] [2021-12-06 17:44:12,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590052879] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:44:12,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838096950] [2021-12-06 17:44:12,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:12,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:44:12,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:44:12,181 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:44:12,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-12-06 17:44:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:12,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:44:12,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 17:44:12,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:44:12,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838096950] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:44:12,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:44:12,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-12-06 17:44:12,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695195839] [2021-12-06 17:44:12,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:44:12,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:44:12,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:44:12,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:44:12,324 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. cyclomatic complexity: 14 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-12-06 17:44:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:12,350 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2021-12-06 17:44:12,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:44:12,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 86 transitions. [2021-12-06 17:44:12,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-06 17:44:12,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2021-12-06 17:44:12,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-06 17:44:12,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-06 17:44:12,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-06 17:44:12,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 17:44:12,352 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-06 17:44:12,352 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-06 17:44:12,352 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-06 17:44:12,352 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-06 17:44:12,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-06 17:44:12,352 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-06 17:44:12,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-06 17:44:12,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.12 05:44:12 BoogieIcfgContainer [2021-12-06 17:44:12,356 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-06 17:44:12,357 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:44:12,357 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:44:12,357 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:44:12,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:42:14" (3/4) ... [2021-12-06 17:44:12,359 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-06 17:44:12,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:44:12,360 INFO L158 Benchmark]: Toolchain (without parser) took 117904.52ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 67.1MB in the beginning and 61.8MB in the end (delta: 5.4MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2021-12-06 17:44:12,360 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:44:12,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.54ms. Allocated memory is still 104.9MB. Free memory was 66.9MB in the beginning and 81.2MB in the end (delta: -14.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 17:44:12,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.83ms. Allocated memory is still 104.9MB. Free memory was 81.2MB in the beginning and 79.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:44:12,360 INFO L158 Benchmark]: Boogie Preprocessor took 22.22ms. Allocated memory is still 104.9MB. Free memory was 79.1MB in the beginning and 77.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:44:12,361 INFO L158 Benchmark]: RCFGBuilder took 310.72ms. Allocated memory is still 104.9MB. Free memory was 77.8MB in the beginning and 63.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-06 17:44:12,361 INFO L158 Benchmark]: BuchiAutomizer took 117358.23ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 63.0MB in the beginning and 61.8MB in the end (delta: 1.2MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2021-12-06 17:44:12,361 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 125.8MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:44:12,362 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.54ms. Allocated memory is still 104.9MB. Free memory was 66.9MB in the beginning and 81.2MB in the end (delta: -14.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.83ms. Allocated memory is still 104.9MB. Free memory was 81.2MB in the beginning and 79.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.22ms. Allocated memory is still 104.9MB. Free memory was 79.1MB in the beginning and 77.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 310.72ms. Allocated memory is still 104.9MB. Free memory was 77.8MB in the beginning and 63.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 117358.23ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 63.0MB in the beginning and 61.8MB in the end (delta: 1.2MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 2.42ms. Allocated memory is still 125.8MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 3 * unknown-#length-unknown[pp] + -16 * i and consists of 6 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 117.3s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 42.9s. Construction of modules took 0.7s. Büchi inclusion checks took 73.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 96 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 65 states and ocurred in iteration 11. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 655 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 654 mSDsluCounter, 1190 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 337 IncrementalHoareTripleChecker+Unchecked, 897 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1343 IncrementalHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 293 mSDtfsCounter, 1343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1510 mio100 ax100 hnf99 lsp97 ukn31 mio100 lsp35 div100 bol100 ite100 ukn100 eq182 hnf91 smp98 dnf112 smp100 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-06 17:44:12,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2021-12-06 17:44:12,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2021-12-06 17:44:12,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2021-12-06 17:44:12,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-12-06 17:44:13,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-12-06 17:44:13,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-06 17:44:13,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-06 17:44:13,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86df53c6-f596-49d4-87a0-58efa0791c4f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE