./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/avg10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/avg10-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc --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 431bc26901e3cf271c74e4f10a5bc241d4509dbbafd99aaf0126c46ffc8b7c33 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:00:50,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:00:50,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:00:50,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:00:50,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:00:50,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:00:50,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:00:50,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:00:50,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:00:50,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:00:50,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:00:50,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:00:50,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:00:50,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:00:50,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:00:50,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:00:50,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:00:50,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:00:50,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:00:50,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:00:50,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:00:50,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:00:50,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:00:50,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:00:50,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:00:50,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:00:50,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:00:50,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:00:50,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:00:50,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:00:50,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:00:50,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:00:50,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:00:50,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:00:50,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:00:50,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:00:50,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:00:50,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:00:50,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:00:50,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:00:50,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:00:50,649 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-02 21:00:50,687 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:00:50,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:00:50,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:00:50,691 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:00:50,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:00:50,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:00:50,693 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:00:50,693 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-02 21:00:50,694 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-02 21:00:50,694 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-02 21:00:50,695 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-02 21:00:50,695 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-02 21:00:50,696 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-02 21:00:50,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:00:50,696 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:00:50,696 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:00:50,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:00:50,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:00:50,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:00:50,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-02 21:00:50,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-02 21:00:50,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-02 21:00:50,698 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:00:50,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:00:50,698 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-02 21:00:50,699 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:00:50,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-02 21:00:50,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:00:50,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:00:50,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:00:50,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:00:50,701 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-02 21:00:50,701 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_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/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_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc 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 -> 431bc26901e3cf271c74e4f10a5bc241d4509dbbafd99aaf0126c46ffc8b7c33 [2022-11-02 21:00:51,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:00:51,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:00:51,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:00:51,041 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:00:51,042 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:00:51,043 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/reducercommutativity/avg10-2.i [2022-11-02 21:00:51,120 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/data/7e986bf3f/f2af2408e3d34471818a431d6ab3a00b/FLAGcd3cebbe7 [2022-11-02 21:00:51,521 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:00:51,522 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/sv-benchmarks/c/reducercommutativity/avg10-2.i [2022-11-02 21:00:51,530 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/data/7e986bf3f/f2af2408e3d34471818a431d6ab3a00b/FLAGcd3cebbe7 [2022-11-02 21:00:51,928 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/data/7e986bf3f/f2af2408e3d34471818a431d6ab3a00b [2022-11-02 21:00:51,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:00:51,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:00:51,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:51,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:00:51,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:00:51,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:51" (1/1) ... [2022-11-02 21:00:51,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456fc79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:51, skipping insertion in model container [2022-11-02 21:00:51,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:51" (1/1) ... [2022-11-02 21:00:51,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:00:51,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:00:52,161 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_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/sv-benchmarks/c/reducercommutativity/avg10-2.i[1282,1295] [2022-11-02 21:00:52,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:52,169 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:00:52,189 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_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/sv-benchmarks/c/reducercommutativity/avg10-2.i[1282,1295] [2022-11-02 21:00:52,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:52,203 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:00:52,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52 WrapperNode [2022-11-02 21:00:52,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:52,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:52,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:00:52,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:00:52,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52" (1/1) ... [2022-11-02 21:00:52,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52" (1/1) ... [2022-11-02 21:00:52,241 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-11-02 21:00:52,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:52,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:00:52,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:00:52,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:00:52,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52" (1/1) ... [2022-11-02 21:00:52,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52" (1/1) ... [2022-11-02 21:00:52,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52" (1/1) ... [2022-11-02 21:00:52,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52" (1/1) ... [2022-11-02 21:00:52,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52" (1/1) ... [2022-11-02 21:00:52,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52" (1/1) ... [2022-11-02 21:00:52,265 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52" (1/1) ... [2022-11-02 21:00:52,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52" (1/1) ... [2022-11-02 21:00:52,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:00:52,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:00:52,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:00:52,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:00:52,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52" (1/1) ... [2022-11-02 21:00:52,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:52,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:52,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:52,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-02 21:00:52,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:00:52,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:00:52,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:00:52,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:00:52,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:00:52,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:00:52,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:00:52,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:00:52,456 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:00:52,458 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:00:52,735 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:00:52,755 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:00:52,755 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 21:00:52,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:00:52 BoogieIcfgContainer [2022-11-02 21:00:52,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:00:52,759 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-02 21:00:52,759 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-02 21:00:52,764 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-02 21:00:52,765 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 21:00:52,765 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 09:00:51" (1/3) ... [2022-11-02 21:00:52,766 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c85f7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 09:00:52, skipping insertion in model container [2022-11-02 21:00:52,766 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 21:00:52,767 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:52" (2/3) ... [2022-11-02 21:00:52,767 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c85f7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 09:00:52, skipping insertion in model container [2022-11-02 21:00:52,768 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 21:00:52,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:00:52" (3/3) ... [2022-11-02 21:00:52,770 INFO L332 chiAutomizerObserver]: Analyzing ICFG avg10-2.i [2022-11-02 21:00:52,881 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-02 21:00:52,881 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-02 21:00:52,881 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-02 21:00:52,882 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-02 21:00:52,882 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-02 21:00:52,882 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-02 21:00:52,882 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-02 21:00:52,883 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-02 21:00:52,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 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) [2022-11-02 21:00:52,912 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2022-11-02 21:00:52,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:00:52,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:00:52,919 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 21:00:52,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:00:52,926 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-02 21:00:52,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 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) [2022-11-02 21:00:52,929 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2022-11-02 21:00:52,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:00:52,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:00:52,929 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 21:00:52,930 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:00:52,936 INFO L748 eck$LassoCheckResult]: Stem: 15#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(10, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 14#L34-3true [2022-11-02 21:00:52,937 INFO L750 eck$LassoCheckResult]: Loop: 14#L34-3true assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 10#L34-2true main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 14#L34-3true [2022-11-02 21:00:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:52,943 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-02 21:00:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:52,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891203905] [2022-11-02 21:00:52,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:52,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:53,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:00:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:53,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:00:53,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:53,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-11-02 21:00:53,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:53,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250442251] [2022-11-02 21:00:53,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:53,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:53,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:00:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:53,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:00:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-11-02 21:00:53,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:53,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465248846] [2022-11-02 21:00:53,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:53,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:53,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:00:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:53,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:00:53,623 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 21:00:53,624 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 21:00:53,624 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 21:00:53,624 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 21:00:53,624 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 21:00:53,625 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:53,625 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 21:00:53,625 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 21:00:53,625 INFO L133 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration1_Lasso [2022-11-02 21:00:53,626 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 21:00:53,626 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 21:00:53,646 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,657 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,660 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,665 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,668 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,671 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,674 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,677 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,680 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,684 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,884 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,887 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,890 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,893 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,896 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,900 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,903 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:53,906 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:00:54,215 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 21:00:54,219 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 21:00:54,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:54,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:54,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:54,227 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 [2022-11-02 21:00:54,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-02 21:00:54,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:00:54,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 21:00:54,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:00:54,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:00:54,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:00:54,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 21:00:54,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 21:00:54,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:00:54,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-11-02 21:00:54,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:54,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:54,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:54,293 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 [2022-11-02 21:00:54,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-02 21:00:54,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:00:54,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 21:00:54,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:00:54,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:00:54,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:00:54,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 21:00:54,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 21:00:54,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:00:54,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:54,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:54,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:54,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:54,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-02 21:00:54,361 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 [2022-11-02 21:00:54,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:00:54,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:00:54,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:00:54,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:00:54,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:00:54,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:00:54,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:00:54,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:54,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:54,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:54,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:54,436 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 [2022-11-02 21:00:54,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:00:54,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 21:00:54,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:00:54,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:00:54,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:00:54,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 21:00:54,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 21:00:54,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-02 21:00:54,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:00:54,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:54,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:54,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:54,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:54,521 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 [2022-11-02 21:00:54,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-02 21:00:54,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:00:54,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 21:00:54,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:00:54,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:00:54,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:00:54,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 21:00:54,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 21:00:54,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:00:54,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:54,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:54,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:54,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:54,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-02 21:00:54,602 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 [2022-11-02 21:00:54,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:00:54,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 21:00:54,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:00:54,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:00:54,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:00:54,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 21:00:54,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 21:00:54,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:00:54,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:54,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:54,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:54,675 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:54,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-02 21:00:54,689 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 [2022-11-02 21:00:54,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:00:54,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 21:00:54,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:00:54,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:00:54,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:00:54,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 21:00:54,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 21:00:54,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:00:54,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:54,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:54,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:54,729 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:54,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-02 21:00:54,731 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 [2022-11-02 21:00:54,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:00:54,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 21:00:54,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:00:54,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:00:54,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:00:54,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 21:00:54,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 21:00:54,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:00:54,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:54,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:54,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:54,770 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:54,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-02 21:00:54,773 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 [2022-11-02 21:00:54,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:00:54,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:00:54,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:00:54,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:00:54,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:00:54,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:00:54,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:00:54,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:54,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:54,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:54,849 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:54,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-02 21:00:54,863 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 [2022-11-02 21:00:54,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:00:54,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:00:54,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:00:54,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:00:54,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:00:54,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:00:54,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:00:54,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:54,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:54,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:54,944 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:54,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-02 21:00:54,953 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 [2022-11-02 21:00:54,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:00:54,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:00:54,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:00:54,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:00:54,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:00:54,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:00:54,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:00:55,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:55,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:55,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:55,014 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:55,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-02 21:00:55,021 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 [2022-11-02 21:00:55,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:00:55,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:00:55,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:00:55,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:00:55,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:00:55,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:00:55,068 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 21:00:55,127 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-11-02 21:00:55,127 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-11-02 21:00:55,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:00:55,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:55,131 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:55,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 21:00:55,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-02 21:00:55,172 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-02 21:00:55,172 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 21:00:55,173 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2022-11-02 21:00:55,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:55,231 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-11-02 21:00:55,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:55,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:00:55,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:55,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:00:55,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:55,365 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-02 21:00:55,366 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) 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) [2022-11-02 21:00:55,446 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) 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 66 states and 92 transitions. Complement of second has 8 states. [2022-11-02 21:00:55,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-02 21:00:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) 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) [2022-11-02 21:00:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-11-02 21:00:55,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2022-11-02 21:00:55,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 21:00:55,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2022-11-02 21:00:55,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 21:00:55,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2022-11-02 21:00:55,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 21:00:55,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 92 transitions. [2022-11-02 21:00:55,462 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-11-02 21:00:55,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 19 states and 24 transitions. [2022-11-02 21:00:55,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-11-02 21:00:55,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-11-02 21:00:55,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2022-11-02 21:00:55,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:00:55,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-02 21:00:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2022-11-02 21:00:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-02 21:00:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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) [2022-11-02 21:00:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-02 21:00:55,494 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-02 21:00:55,495 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-02 21:00:55,495 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-02 21:00:55,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2022-11-02 21:00:55,496 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-11-02 21:00:55,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:00:55,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:00:55,497 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 21:00:55,497 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:00:55,497 INFO L748 eck$LassoCheckResult]: Stem: 150#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(10, 2); 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 162#L34-3 assume !(main_~i~1#1 < 10); 154#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 155#L20-3 [2022-11-02 21:00:55,497 INFO L750 eck$LassoCheckResult]: Loop: 155#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 168#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 155#L20-3 [2022-11-02 21:00:55,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-11-02 21:00:55,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:55,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482983320] [2022-11-02 21:00:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:55,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:55,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:55,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482983320] [2022-11-02 21:00:55,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482983320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:55,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:55,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:00:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722099030] [2022-11-02 21:00:55,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:55,567 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 21:00:55,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2022-11-02 21:00:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:55,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365003796] [2022-11-02 21:00:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:55,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:55,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:00:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:55,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:00:55,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:55,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:00:55,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:00:55,648 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 1.3333333333333333) 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) [2022-11-02 21:00:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:55,675 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-11-02 21:00:55,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2022-11-02 21:00:55,680 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-11-02 21:00:55,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2022-11-02 21:00:55,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-11-02 21:00:55,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-11-02 21:00:55,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2022-11-02 21:00:55,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:00:55,684 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-11-02 21:00:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2022-11-02 21:00:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-11-02 21:00:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 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) [2022-11-02 21:00:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-11-02 21:00:55,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-11-02 21:00:55,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:00:55,695 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-11-02 21:00:55,695 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-02 21:00:55,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2022-11-02 21:00:55,696 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-11-02 21:00:55,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:00:55,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:00:55,699 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-02 21:00:55,699 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:00:55,701 INFO L748 eck$LassoCheckResult]: Stem: 195#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(10, 2); 196#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 207#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 210#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 211#L34-3 assume !(main_~i~1#1 < 10); 199#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 200#L20-3 [2022-11-02 21:00:55,702 INFO L750 eck$LassoCheckResult]: Loop: 200#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 213#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 200#L20-3 [2022-11-02 21:00:55,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:55,702 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-11-02 21:00:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:55,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992912260] [2022-11-02 21:00:55,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:55,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992912260] [2022-11-02 21:00:55,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992912260] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:55,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48155483] [2022-11-02 21:00:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:55,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:55,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:55,811 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:55,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 21:00:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:55,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 21:00:55,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:55,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:55,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48155483] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:00:55,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:00:55,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-02 21:00:55,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632190494] [2022-11-02 21:00:55,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:00:55,902 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 21:00:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2022-11-02 21:00:55,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:55,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915900906] [2022-11-02 21:00:55,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:55,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:00:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:55,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:00:55,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:55,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:00:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:00:55,977 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:00:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:56,003 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-11-02 21:00:56,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2022-11-02 21:00:56,004 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-11-02 21:00:56,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 29 transitions. [2022-11-02 21:00:56,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-11-02 21:00:56,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-11-02 21:00:56,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2022-11-02 21:00:56,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:00:56,005 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-02 21:00:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2022-11-02 21:00:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-02 21:00:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 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) [2022-11-02 21:00:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-02 21:00:56,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-02 21:00:56,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:00:56,009 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-02 21:00:56,009 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-02 21:00:56,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2022-11-02 21:00:56,010 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-11-02 21:00:56,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:00:56,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:00:56,010 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-11-02 21:00:56,010 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:00:56,011 INFO L748 eck$LassoCheckResult]: Stem: 281#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(10, 2); 282#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 291#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 298#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 299#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 294#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 295#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 303#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 302#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 301#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 300#L34-3 assume !(main_~i~1#1 < 10); 283#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 284#L20-3 [2022-11-02 21:00:56,011 INFO L750 eck$LassoCheckResult]: Loop: 284#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 297#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 284#L20-3 [2022-11-02 21:00:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-11-02 21:00:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:56,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744853639] [2022-11-02 21:00:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:56,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:56,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:56,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744853639] [2022-11-02 21:00:56,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744853639] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:56,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255308192] [2022-11-02 21:00:56,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:00:56,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:56,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:56,145 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:56,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 21:00:56,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:00:56,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:00:56,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:00:56,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:56,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:00:56,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255308192] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:00:56,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:00:56,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-02 21:00:56,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560804488] [2022-11-02 21:00:56,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:00:56,352 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 21:00:56,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2022-11-02 21:00:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:56,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235014727] [2022-11-02 21:00:56,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:56,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:00:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:56,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:00:56,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:56,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:00:56,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:00:56,422 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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) [2022-11-02 21:00:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:56,474 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-11-02 21:00:56,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2022-11-02 21:00:56,475 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-11-02 21:00:56,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2022-11-02 21:00:56,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-11-02 21:00:56,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-11-02 21:00:56,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2022-11-02 21:00:56,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:00:56,477 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-11-02 21:00:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2022-11-02 21:00:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-02 21:00:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 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) [2022-11-02 21:00:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-11-02 21:00:56,481 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-11-02 21:00:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:00:56,482 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-11-02 21:00:56,482 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-02 21:00:56,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2022-11-02 21:00:56,485 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-11-02 21:00:56,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:00:56,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:00:56,487 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2022-11-02 21:00:56,487 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:00:56,488 INFO L748 eck$LassoCheckResult]: Stem: 423#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(10, 2); 424#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 435#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 442#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 443#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 438#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 439#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 459#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 458#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 457#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 456#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 455#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 454#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 453#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 452#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 451#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 450#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 449#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 448#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 447#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 446#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 445#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 444#L34-3 assume !(main_~i~1#1 < 10); 427#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 428#L20-3 [2022-11-02 21:00:56,489 INFO L750 eck$LassoCheckResult]: Loop: 428#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 441#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 428#L20-3 [2022-11-02 21:00:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:56,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2022-11-02 21:00:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:56,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124015319] [2022-11-02 21:00:56,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:56,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:56,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:00:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:56,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:00:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:56,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2022-11-02 21:00:56,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:56,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098538958] [2022-11-02 21:00:56,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:56,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:56,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:00:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:56,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:00:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2022-11-02 21:00:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:56,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959425933] [2022-11-02 21:00:56,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:56,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:56,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:00:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:00:56,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:01:01,851 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 21:01:01,851 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 21:01:01,851 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 21:01:01,852 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 21:01:01,852 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 21:01:01,852 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:01,852 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 21:01:01,852 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 21:01:01,852 INFO L133 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration5_Lasso [2022-11-02 21:01:01,852 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 21:01:01,853 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 21:01:01,856 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:01,859 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:01,862 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:01,864 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:01,867 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:01,870 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:01,873 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,176 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,179 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,181 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,184 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,187 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,189 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,192 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,195 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,197 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,200 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,202 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,205 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,208 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,210 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,213 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 21:01:03,674 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 21:01:03,674 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 21:01:03,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:03,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:03,688 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:03,697 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 [2022-11-02 21:01:03,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:01:03,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 21:01:03,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-02 21:01:03,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:01:03,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:01:03,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:01:03,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 21:01:03,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 21:01:03,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:01:03,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:03,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:03,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:03,735 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:03,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-02 21:01:03,741 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 [2022-11-02 21:01:03,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:01:03,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 21:01:03,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:01:03,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:01:03,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:01:03,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 21:01:03,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 21:01:03,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:01:03,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:03,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:03,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:03,778 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:03,781 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 [2022-11-02 21:01:03,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-02 21:01:03,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:01:03,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 21:01:03,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:01:03,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:01:03,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:01:03,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 21:01:03,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 21:01:03,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:01:03,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-11-02 21:01:03,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:03,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:03,818 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:03,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-02 21:01:03,821 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 [2022-11-02 21:01:03,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:01:03,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 21:01:03,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:01:03,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:01:03,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:01:03,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 21:01:03,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 21:01:03,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:01:03,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:03,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:03,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:03,860 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:03,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-02 21:01:03,861 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 [2022-11-02 21:01:03,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:01:03,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:01:03,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:01:03,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:01:03,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:01:03,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:01:03,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:01:03,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:03,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:03,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:03,901 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:03,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-02 21:01:03,903 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 [2022-11-02 21:01:03,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:01:03,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 21:01:03,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:01:03,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:01:03,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:01:03,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 21:01:03,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 21:01:03,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:01:03,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:03,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:03,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:03,939 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:03,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-02 21:01:03,941 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 [2022-11-02 21:01:03,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:01:03,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:01:03,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:01:03,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:01:03,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:01:03,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:01:03,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:01:04,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:04,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:04,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:04,023 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:04,029 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 [2022-11-02 21:01:04,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-02 21:01:04,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:01:04,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:01:04,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:01:04,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:01:04,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:01:04,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:01:04,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:01:04,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:04,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:04,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:04,098 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:04,102 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 [2022-11-02 21:01:04,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:01:04,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:01:04,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:01:04,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:01:04,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-02 21:01:04,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:01:04,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:01:04,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:01:04,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:04,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:04,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:04,174 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:04,176 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 [2022-11-02 21:01:04,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-02 21:01:04,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:01:04,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:01:04,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:01:04,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:01:04,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:01:04,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:01:04,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 21:01:04,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-11-02 21:01:04,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:04,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:04,213 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:04,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-02 21:01:04,216 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 [2022-11-02 21:01:04,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 21:01:04,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 21:01:04,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 21:01:04,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 21:01:04,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 21:01:04,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 21:01:04,244 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 21:01:04,271 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-11-02 21:01:04,271 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-11-02 21:01:04,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:01:04,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:04,273 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:04,275 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 21:01:04,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-02 21:01:04,289 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-02 21:01:04,289 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 21:01:04,289 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~i~0#1) = -2*ULTIMATE.start_avg_~i~0#1 + 19 Supporting invariants [] [2022-11-02 21:01:04,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:04,495 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2022-11-02 21:01:04,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:01:04,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 21:01:04,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:01:04,606 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-02 21:01:04,606 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:04,620 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 48 transitions. Complement of second has 7 states. [2022-11-02 21:01:04,621 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 [2022-11-02 21:01:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-11-02 21:01:04,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 2 letters. [2022-11-02 21:01:04,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 21:01:04,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 26 letters. Loop has 2 letters. [2022-11-02 21:01:04,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 21:01:04,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 4 letters. [2022-11-02 21:01:04,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 21:01:04,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2022-11-02 21:01:04,625 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-11-02 21:01:04,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 43 transitions. [2022-11-02 21:01:04,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-11-02 21:01:04,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-11-02 21:01:04,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2022-11-02 21:01:04,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:01:04,626 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-11-02 21:01:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2022-11-02 21:01:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-02 21:01:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 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) [2022-11-02 21:01:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-11-02 21:01:04,629 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-11-02 21:01:04,629 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-11-02 21:01:04,630 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-02 21:01:04,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2022-11-02 21:01:04,630 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-11-02 21:01:04,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:01:04,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:01:04,631 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:04,631 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:01:04,632 INFO L748 eck$LassoCheckResult]: Stem: 756#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(10, 2); 757#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 766#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 774#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 775#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 769#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 770#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 791#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 790#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 789#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 788#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 787#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 786#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 785#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 784#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 783#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 782#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 781#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 780#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 779#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 778#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 777#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 776#L34-3 assume !(main_~i~1#1 < 10); 758#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 759#L20-3 assume !(avg_~i~0#1 < 10); 767#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 768#L23 main_#t~ret5#1 := avg_#res#1;assume { :end_inline_avg } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 764#L20-8 [2022-11-02 21:01:04,632 INFO L750 eck$LassoCheckResult]: Loop: 764#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 765#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 764#L20-8 [2022-11-02 21:01:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:04,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2022-11-02 21:01:04,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:04,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489210231] [2022-11-02 21:01:04,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:04,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-02 21:01:04,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:04,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489210231] [2022-11-02 21:01:04,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489210231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:04,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:04,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:04,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252242807] [2022-11-02 21:01:04,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:04,763 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 21:01:04,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:04,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2022-11-02 21:01:04,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:04,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706846315] [2022-11-02 21:01:04,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:04,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:04,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:04,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:01:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:04,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:01:04,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:04,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:04,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:04,815 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-11-02 21:01:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:04,842 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-02 21:01:04,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2022-11-02 21:01:04,843 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-11-02 21:01:04,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2022-11-02 21:01:04,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-11-02 21:01:04,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-11-02 21:01:04,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2022-11-02 21:01:04,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:01:04,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-02 21:01:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2022-11-02 21:01:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-11-02 21:01:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 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) [2022-11-02 21:01:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-02 21:01:04,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-02 21:01:04,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:04,848 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-02 21:01:04,848 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-02 21:01:04,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2022-11-02 21:01:04,849 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-11-02 21:01:04,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:01:04,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:01:04,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:04,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:01:04,850 INFO L748 eck$LassoCheckResult]: Stem: 841#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(10, 2); 842#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 853#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 856#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 857#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 862#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 879#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 878#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 877#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 876#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 875#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 874#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 873#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 872#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 871#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 870#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 869#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 868#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 867#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 866#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 865#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 864#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 863#L34-3 assume !(main_~i~1#1 < 10); 845#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 846#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 859#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 860#L20-3 assume !(avg_~i~0#1 < 10); 854#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 855#L23 main_#t~ret5#1 := avg_#res#1;assume { :end_inline_avg } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 851#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 852#L20-7 [2022-11-02 21:01:04,850 INFO L750 eck$LassoCheckResult]: Loop: 852#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 861#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 852#L20-7 [2022-11-02 21:01:04,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:04,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2022-11-02 21:01:04,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:04,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288936093] [2022-11-02 21:01:04,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:04,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-02 21:01:04,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:04,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288936093] [2022-11-02 21:01:04,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288936093] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:01:04,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805640484] [2022-11-02 21:01:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:04,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:04,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:04,952 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:01:04,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-02 21:01:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:05,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 21:01:05,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-02 21:01:05,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:01:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-02 21:01:05,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805640484] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:01:05,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:01:05,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-02 21:01:05,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775322716] [2022-11-02 21:01:05,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:01:05,075 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 21:01:05,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:05,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2022-11-02 21:01:05,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:05,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429950397] [2022-11-02 21:01:05,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:05,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:05,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:01:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:05,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:01:05,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:05,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:01:05,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:05,134 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2022-11-02 21:01:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:05,210 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-02 21:01:05,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2022-11-02 21:01:05,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-11-02 21:01:05,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 62 transitions. [2022-11-02 21:01:05,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-11-02 21:01:05,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-11-02 21:01:05,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 62 transitions. [2022-11-02 21:01:05,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:01:05,213 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-11-02 21:01:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 62 transitions. [2022-11-02 21:01:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-11-02 21:01:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 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) [2022-11-02 21:01:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-11-02 21:01:05,216 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-11-02 21:01:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:01:05,217 INFO L428 stractBuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-11-02 21:01:05,217 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-02 21:01:05,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2022-11-02 21:01:05,218 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-11-02 21:01:05,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:01:05,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:01:05,219 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:05,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:01:05,220 INFO L748 eck$LassoCheckResult]: Stem: 1122#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(10, 2); 1123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1134#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1144#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1145#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1137#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1138#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1172#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1171#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1170#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1169#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1168#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1167#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1166#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1165#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1164#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1163#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1162#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1161#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1160#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1159#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1158#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1157#L34-3 assume !(main_~i~1#1 < 10); 1126#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1127#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1140#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1141#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1142#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1156#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1155#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1153#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1150#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1149#L20-3 assume !(avg_~i~0#1 < 10); 1135#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 1136#L23 main_#t~ret5#1 := avg_#res#1;assume { :end_inline_avg } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1132#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1133#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1143#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1154#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1152#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1151#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1148#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1147#L20-7 [2022-11-02 21:01:05,220 INFO L750 eck$LassoCheckResult]: Loop: 1147#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1146#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1147#L20-7 [2022-11-02 21:01:05,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 1 times [2022-11-02 21:01:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:05,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235761175] [2022-11-02 21:01:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-02 21:01:05,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:05,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235761175] [2022-11-02 21:01:05,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235761175] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:01:05,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423860145] [2022-11-02 21:01:05,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:05,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:05,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:05,400 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:01:05,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-02 21:01:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:05,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:01:05,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-02 21:01:05,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:01:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-02 21:01:05,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423860145] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:01:05,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:01:05,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-02 21:01:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534654750] [2022-11-02 21:01:05,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:01:05,615 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 21:01:05,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2022-11-02 21:01:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:05,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868201330] [2022-11-02 21:01:05,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:05,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:01:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:05,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:01:05,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:05,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:01:05,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:01:05,665 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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) [2022-11-02 21:01:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:05,823 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-11-02 21:01:05,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2022-11-02 21:01:05,824 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-11-02 21:01:05,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2022-11-02 21:01:05,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-11-02 21:01:05,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-11-02 21:01:05,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2022-11-02 21:01:05,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:01:05,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-11-02 21:01:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2022-11-02 21:01:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2022-11-02 21:01:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 74 states have internal predecessors, (79), 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) [2022-11-02 21:01:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2022-11-02 21:01:05,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-11-02 21:01:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:01:05,831 INFO L428 stractBuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-11-02 21:01:05,831 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-02 21:01:05,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2022-11-02 21:01:05,832 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-11-02 21:01:05,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:01:05,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:01:05,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:05,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:01:05,834 INFO L748 eck$LassoCheckResult]: Stem: 1529#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(10, 2); 1530#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1541#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1544#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1545#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1551#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1603#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1602#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1601#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1600#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1599#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1598#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1597#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1596#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1595#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1594#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1593#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1592#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1591#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1590#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1589#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1588#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1587#L34-3 assume !(main_~i~1#1 < 10); 1533#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1534#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1547#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1548#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1549#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1586#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1585#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1583#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1581#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1579#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1577#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1575#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1573#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1571#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1569#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1567#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1565#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1563#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1561#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1559#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1556#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1555#L20-3 assume !(avg_~i~0#1 < 10); 1542#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 1543#L23 main_#t~ret5#1 := avg_#res#1;assume { :end_inline_avg } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1539#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1540#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1550#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1584#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1582#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1580#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1578#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1576#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1574#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1572#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1570#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1568#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1566#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1564#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1562#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1560#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1558#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1557#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1554#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1553#L20-7 [2022-11-02 21:01:05,834 INFO L750 eck$LassoCheckResult]: Loop: 1553#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1552#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1553#L20-7 [2022-11-02 21:01:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:05,835 INFO L85 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 2 times [2022-11-02 21:01:05,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:05,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780891608] [2022-11-02 21:01:05,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:05,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:01:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:06,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:01:06,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2022-11-02 21:01:06,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:06,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501252878] [2022-11-02 21:01:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:06,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:01:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:06,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:01:06,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:06,122 INFO L85 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 3 times [2022-11-02 21:01:06,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:06,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555887892] [2022-11-02 21:01:06,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:06,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 81 proven. 19 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-11-02 21:01:06,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:06,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555887892] [2022-11-02 21:01:06,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555887892] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:01:06,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850370848] [2022-11-02 21:01:06,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:01:06,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:06,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:06,542 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:01:06,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d49fa99-6ab3-4ba8-91c8-904aefb56dcf/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-02 21:01:06,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-02 21:01:06,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:01:06,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 21:01:06,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-11-02 21:01:06,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:01:06,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850370848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:06,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:01:06,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2022-11-02 21:01:06,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466820584] [2022-11-02 21:01:06,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:06,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:06,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:01:06,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:01:06,891 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 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) [2022-11-02 21:01:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:07,095 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-11-02 21:01:07,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2022-11-02 21:01:07,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-02 21:01:07,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2022-11-02 21:01:07,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-11-02 21:01:07,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-11-02 21:01:07,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2022-11-02 21:01:07,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:01:07,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-11-02 21:01:07,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2022-11-02 21:01:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-02 21:01:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 71 states have internal predecessors, (73), 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) [2022-11-02 21:01:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-11-02 21:01:07,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-11-02 21:01:07,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:01:07,102 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-11-02 21:01:07,102 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-02 21:01:07,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2022-11-02 21:01:07,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-02 21:01:07,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:01:07,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:01:07,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:07,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 21:01:07,104 INFO L748 eck$LassoCheckResult]: Stem: 1918#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(10, 2); 1919#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1928#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1936#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1937#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1931#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1932#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1989#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1988#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1987#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1986#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1985#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1984#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1983#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1982#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1981#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1980#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1979#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1978#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1977#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1976#L34-3 assume !!(main_~i~1#1 < 10);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1975#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1974#L34-3 assume !(main_~i~1#1 < 10); 1922#L34-4 assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1923#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1933#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1934#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1973#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1972#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1971#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1970#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1968#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1966#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1964#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1962#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1960#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1958#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1956#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1954#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1952#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1950#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1948#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1946#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1944#L20-2 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1942#L20-3 assume !(avg_~i~0#1 < 10); 1929#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 1930#L23 main_#t~ret5#1 := avg_#res#1;assume { :end_inline_avg } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem2#1, avg_#t~post1#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1926#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1927#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1935#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1969#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1967#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1965#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1963#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1961#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1959#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1957#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1955#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1953#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1951#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1949#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1947#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1945#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1943#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1941#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1940#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem2#1 := read~int(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem2#1;havoc avg_#t~mem2#1; 1939#L20-7 avg_#t~post1#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post1#1;havoc avg_#t~post1#1; 1938#L20-8 assume !(avg_~i~0#1 < 10); 1920#L20-9 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 1921#L23-1 main_#t~ret8#1 := avg_#res#1;assume { :end_inline_avg } true;main_~ret2~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;main_~i~2#1 := 0; 1925#L43-3 [2022-11-02 21:01:07,104 INFO L750 eck$LassoCheckResult]: Loop: 1925#L43-3 assume !!(main_~i~2#1 < 9);call main_#t~mem11#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem11#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem11#1; 1924#L43-2 main_#t~post10#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1925#L43-3 [2022-11-02 21:01:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2022-11-02 21:01:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:07,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460092343] [2022-11-02 21:01:07,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:07,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:07,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:01:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:07,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:01:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:07,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2022-11-02 21:01:07,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:07,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993761735] [2022-11-02 21:01:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:07,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:07,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:01:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:07,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:01:07,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:07,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2022-11-02 21:01:07,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:07,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719926203] [2022-11-02 21:01:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:07,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:01:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:01:07,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:01:47,515 WARN L234 SmtUtils]: Spent 39.67s on a formula simplification. DAG size of input: 557 DAG size of output: 419 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 21:02:03,075 WARN L234 SmtUtils]: Spent 12.26s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)