./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array13_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 38b53e6a 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_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array13_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff --- Real Ultimate output --- [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-38b53e6 [2022-11-25 15:35:37,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:35:37,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:35:37,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:35:37,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:35:37,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:35:37,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:35:37,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:35:37,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:35:37,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:35:37,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:35:37,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:35:37,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:35:37,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:35:37,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:35:37,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:35:37,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:35:37,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:35:37,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:35:37,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:35:37,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:35:37,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:35:37,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:35:37,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:35:37,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:35:37,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:35:37,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:35:37,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:35:37,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:35:37,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:35:37,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:35:37,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:35:37,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:35:37,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:35:37,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:35:37,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:35:37,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:35:37,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:35:37,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:35:37,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:35:37,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:35:37,484 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-25 15:35:37,511 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:35:37,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:35:37,512 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:35:37,513 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:35:37,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:35:37,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:35:37,514 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:35:37,515 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-25 15:35:37,515 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-25 15:35:37,515 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-25 15:35:37,516 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-25 15:35:37,516 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-25 15:35:37,516 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-25 15:35:37,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:35:37,517 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:35:37,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:35:37,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:35:37,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-25 15:35:37,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-25 15:35:37,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-25 15:35:37,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:35:37,519 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-25 15:35:37,519 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:35:37,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-25 15:35:37,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:35:37,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:35:37,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:35:37,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:35:37,522 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-25 15:35:37,523 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_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/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_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff [2022-11-25 15:35:37,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:35:37,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:35:37,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:35:37,807 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:35:37,807 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:35:37,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/termination-15/array13_alloca.i [2022-11-25 15:35:41,001 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:35:41,250 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:35:41,251 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/sv-benchmarks/c/termination-15/array13_alloca.i [2022-11-25 15:35:41,263 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/data/523a115ba/423fad21ce234c23894afd7b2220e0f4/FLAGdc7fb8a62 [2022-11-25 15:35:41,280 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/data/523a115ba/423fad21ce234c23894afd7b2220e0f4 [2022-11-25 15:35:41,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:35:41,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:35:41,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:35:41,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:35:41,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:35:41,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:41,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510578e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41, skipping insertion in model container [2022-11-25 15:35:41,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:41,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:35:41,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:35:41,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:35:41,826 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:35:41,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:35:41,950 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:35:41,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41 WrapperNode [2022-11-25 15:35:41,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:35:41,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:35:41,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:35:41,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:35:41,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:41,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:42,023 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-11-25 15:35:42,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:35:42,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:35:42,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:35:42,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:35:42,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:42,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:42,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:42,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:42,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:42,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:42,076 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:42,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:42,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:35:42,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:35:42,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:35:42,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:35:42,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41" (1/1) ... [2022-11-25 15:35:42,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:35:42,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:42,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:35:42,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-25 15:35:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:35:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:35:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:35:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:35:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:35:42,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:35:42,272 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:35:42,274 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:35:42,404 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:35:42,410 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:35:42,410 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 15:35:42,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:35:42 BoogieIcfgContainer [2022-11-25 15:35:42,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:35:42,414 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-25 15:35:42,414 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-25 15:35:42,418 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-25 15:35:42,419 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 15:35:42,419 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 03:35:41" (1/3) ... [2022-11-25 15:35:42,420 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34d2f564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 03:35:42, skipping insertion in model container [2022-11-25 15:35:42,420 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 15:35:42,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:41" (2/3) ... [2022-11-25 15:35:42,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34d2f564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 03:35:42, skipping insertion in model container [2022-11-25 15:35:42,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 15:35:42,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:35:42" (3/3) ... [2022-11-25 15:35:42,423 INFO L332 chiAutomizerObserver]: Analyzing ICFG array13_alloca.i [2022-11-25 15:35:42,484 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-25 15:35:42,484 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-25 15:35:42,484 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-25 15:35:42,484 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-25 15:35:42,485 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-25 15:35:42,485 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-25 15:35:42,485 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-25 15:35:42,485 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-25 15:35:42,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:42,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-11-25 15:35:42,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:42,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:42,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-25 15:35:42,517 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 15:35:42,517 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-25 15:35:42,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:42,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-11-25 15:35:42,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:42,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:42,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-25 15:35:42,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 15:35:42,529 INFO L748 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 10#L367true assume !(main_~length~0#1 < 1); 7#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 4#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 5#L370-3true [2022-11-25 15:35:42,529 INFO L750 eck$LassoCheckResult]: Loop: 5#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L372true assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 5#L370-3true [2022-11-25 15:35:42,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:42,536 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-11-25 15:35:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:42,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91277353] [2022-11-25 15:35:42,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:42,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:42,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:42,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:42,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:42,707 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2022-11-25 15:35:42,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:42,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080782338] [2022-11-25 15:35:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:42,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:42,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:42,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:42,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:42,739 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2022-11-25 15:35:42,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:42,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707969084] [2022-11-25 15:35:42,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:42,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:42,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:42,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:43,327 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 15:35:43,328 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 15:35:43,328 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 15:35:43,328 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 15:35:43,328 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 15:35:43,328 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:35:43,329 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 15:35:43,329 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 15:35:43,329 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration1_Lasso [2022-11-25 15:35:43,329 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 15:35:43,329 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 15:35:43,366 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-25 15:35:43,393 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-25 15:35:43,399 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-25 15:35:43,404 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-25 15:35:43,408 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-25 15:35:43,411 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-25 15:35:43,580 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-25 15:35:43,583 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-25 15:35:43,586 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-25 15:35:43,589 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-25 15:35:43,593 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-25 15:35:43,597 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-25 15:35:43,915 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 15:35:43,920 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 15:35:43,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:35:43,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:43,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:35:43,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-25 15:35:43,932 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-25 15:35:43,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:35:43,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:35:43,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:35:43,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:35:43,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:35:43,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:35:43,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:35:43,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:35:43,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:43,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:35:43,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:43,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:35:43,984 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-25 15:35:43,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-25 15:35:44,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:35:44,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:35:44,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:35:44,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:35:44,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:35:44,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:35:44,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:35:44,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:44,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:35:44,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:44,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:35:44,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-25 15:35:44,044 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-25 15:35:44,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:35:44,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:35:44,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:35:44,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:35:44,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:35:44,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:35:44,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:35:44,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:35:44,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:44,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:35:44,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:44,079 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:35:44,088 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-25 15:35:44,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:35:44,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:35:44,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:35:44,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:35:44,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:35:44,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:35:44,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:35:44,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-25 15:35:44,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:35:44,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:44,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:35:44,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:44,125 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:35:44,132 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-25 15:35:44,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:35:44,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:35:44,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:35:44,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:35:44,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:35:44,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:35:44,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:35:44,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-25 15:35:44,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:35:44,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:44,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:35:44,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:44,173 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:35:44,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-25 15:35:44,178 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-25 15:35:44,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:35:44,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:35:44,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:35:44,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:35:44,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:35:44,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:35:44,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:35:44,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:35:44,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-11-25 15:35:44,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:35:44,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:44,214 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:35:44,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-25 15:35:44,218 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-25 15:35:44,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:35:44,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:35:44,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:35:44,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:35:44,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:35:44,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:35:44,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:35:44,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:44,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:35:44,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:44,257 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:35:44,269 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-25 15:35:44,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:35:44,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:35:44,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:35:44,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:35:44,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-25 15:35:44,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:35:44,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:35:44,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:35:44,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:44,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:35:44,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:44,321 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:35:44,330 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-25 15:35:44,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:35:44,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:35:44,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:35:44,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:35:44,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-25 15:35:44,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:35:44,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:35:44,387 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 15:35:44,437 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-11-25 15:35:44,437 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-11-25 15:35:44,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:35:44,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:44,482 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:35:44,484 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 15:35:44,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-25 15:35:44,503 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-25 15:35:44,503 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 15:35:44,503 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1) = -4*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 Supporting invariants [] [2022-11-25 15:35:44,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:44,520 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-11-25 15:35:44,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:44,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 15:35:44,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:44,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 15:35:44,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:44,617 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-25 15:35:44,651 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-25 15:35:44,653 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:44,717 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 50 transitions. Complement of second has 7 states. [2022-11-25 15:35:44,719 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-25 15:35:44,724 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-25 15:35:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-11-25 15:35:44,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2022-11-25 15:35:44,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 15:35:44,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2022-11-25 15:35:44,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 15:35:44,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2022-11-25 15:35:44,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 15:35:44,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2022-11-25 15:35:44,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:44,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2022-11-25 15:35:44,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-11-25 15:35:44,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-11-25 15:35:44,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-11-25 15:35:44,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:44,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-11-25 15:35:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-11-25 15:35:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-25 15:35:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-11-25 15:35:44,780 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-11-25 15:35:44,780 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-11-25 15:35:44,781 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-25 15:35:44,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-11-25 15:35:44,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:44,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:44,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:44,784 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:44,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:44,784 INFO L748 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 120#L367 assume !(main_~length~0#1 < 1); 114#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 115#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 116#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 117#L370-4 main_~j~0#1 := 0; 118#L378-2 [2022-11-25 15:35:44,784 INFO L750 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 119#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 118#L378-2 [2022-11-25 15:35:44,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:44,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2022-11-25 15:35:44,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:44,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534861048] [2022-11-25 15:35:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:44,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:44,953 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-25 15:35:44,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:44,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534861048] [2022-11-25 15:35:44,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534861048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:44,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:35:44,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:35:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040407746] [2022-11-25 15:35:44,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:44,958 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 15:35:44,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2022-11-25 15:35:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:44,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195787278] [2022-11-25 15:35:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:44,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:44,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:44,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:45,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:35:45,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:35:45,048 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:45,086 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-11-25 15:35:45,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-11-25 15:35:45,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:45,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2022-11-25 15:35:45,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-11-25 15:35:45,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-11-25 15:35:45,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-11-25 15:35:45,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:45,092 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-11-25 15:35:45,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-11-25 15:35:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-11-25 15:35:45,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-25 15:35:45,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-25 15:35:45,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:35:45,097 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-25 15:35:45,097 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-25 15:35:45,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-11-25 15:35:45,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:45,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:45,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:45,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:45,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:45,101 INFO L748 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 146#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 153#L367 assume !(main_~length~0#1 < 1); 147#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 148#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 149#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 154#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 156#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 155#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 150#L370-4 main_~j~0#1 := 0; 151#L378-2 [2022-11-25 15:35:45,102 INFO L750 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 152#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 151#L378-2 [2022-11-25 15:35:45,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:45,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2022-11-25 15:35:45,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:45,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195908808] [2022-11-25 15:35:45,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:45,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:45,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:45,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2022-11-25 15:35:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:45,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407661639] [2022-11-25 15:35:45,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:45,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:45,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:45,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:45,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2022-11-25 15:35:45,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:45,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329954192] [2022-11-25 15:35:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:45,269 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2022-11-25 15:35:45,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-25 15:35:45,587 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-25 15:35:45,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:45,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329954192] [2022-11-25 15:35:45,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329954192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:45,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475247792] [2022-11-25 15:35:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:45,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:45,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:45,595 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:45,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 15:35:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:45,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 15:35:45,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:45,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 15:35:45,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 15:35:45,780 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-25 15:35:45,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:45,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-25 15:35:45,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-25 15:35:45,898 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-25 15:35:45,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475247792] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:45,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:35:45,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-11-25 15:35:45,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149038752] [2022-11-25 15:35:45,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:45,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 15:35:45,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:35:45,959 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 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-25 15:35:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:46,104 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-11-25 15:35:46,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2022-11-25 15:35:46,105 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-25 15:35:46,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2022-11-25 15:35:46,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-25 15:35:46,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-25 15:35:46,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-11-25 15:35:46,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:46,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-11-25 15:35:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-11-25 15:35:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-11-25 15:35:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-11-25 15:35:46,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-11-25 15:35:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:35:46,110 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-11-25 15:35:46,110 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-25 15:35:46,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-11-25 15:35:46,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:46,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:46,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:46,112 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:46,112 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:46,113 INFO L748 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 277#L367 assume !(main_~length~0#1 < 1); 271#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 272#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 273#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 278#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 283#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 279#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 280#L370-4 main_~j~0#1 := 0; 284#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 274#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 275#L378-2 [2022-11-25 15:35:46,113 INFO L750 eck$LassoCheckResult]: Loop: 275#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 282#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 275#L378-2 [2022-11-25 15:35:46,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2022-11-25 15:35:46,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:46,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108177327] [2022-11-25 15:35:46,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:46,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:46,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:46,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:46,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:46,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2022-11-25 15:35:46,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:46,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769765776] [2022-11-25 15:35:46,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:46,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:46,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:46,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:46,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2022-11-25 15:35:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:46,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270183767] [2022-11-25 15:35:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:46,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:46,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:46,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270183767] [2022-11-25 15:35:46,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270183767] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:46,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546076187] [2022-11-25 15:35:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:46,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:46,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:46,224 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:46,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 15:35:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:46,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:35:46,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:46,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:46,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546076187] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:46,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:35:46,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-25 15:35:46,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594686388] [2022-11-25 15:35:46,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:46,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:46,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 15:35:46,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:35:46,487 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-25 15:35:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:46,619 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-11-25 15:35:46,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2022-11-25 15:35:46,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-25 15:35:46,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 51 transitions. [2022-11-25 15:35:46,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-11-25 15:35:46,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-25 15:35:46,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2022-11-25 15:35:46,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:46,622 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-11-25 15:35:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2022-11-25 15:35:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-11-25 15:35:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-11-25 15:35:46,629 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-11-25 15:35:46,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:35:46,631 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-11-25 15:35:46,631 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-25 15:35:46,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2022-11-25 15:35:46,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-25 15:35:46,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:46,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:46,634 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:46,634 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:46,634 INFO L748 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 444#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 445#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 461#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 460#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 457#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 455#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 456#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 458#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 452#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 453#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 440#L370-4 main_~j~0#1 := 0; 441#L378-2 [2022-11-25 15:35:46,634 INFO L750 eck$LassoCheckResult]: Loop: 441#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 451#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 441#L378-2 [2022-11-25 15:35:46,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:46,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2022-11-25 15:35:46,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:46,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245088893] [2022-11-25 15:35:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:46,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:46,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245088893] [2022-11-25 15:35:46,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245088893] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:46,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442298641] [2022-11-25 15:35:46,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:46,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:46,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:46,711 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:46,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 15:35:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:46,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 15:35:46,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:46,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:46,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:35:46,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442298641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:35:46,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:35:46,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-25 15:35:46,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115689425] [2022-11-25 15:35:46,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:35:46,852 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 15:35:46,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:46,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2022-11-25 15:35:46,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:46,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388639807] [2022-11-25 15:35:46,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:46,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:46,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:46,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:46,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:35:46,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:35:46,924 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:46,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:46,947 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-11-25 15:35:46,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2022-11-25 15:35:46,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:46,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2022-11-25 15:35:46,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-11-25 15:35:46,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-11-25 15:35:46,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-11-25 15:35:46,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:46,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-25 15:35:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-11-25 15:35:46,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-25 15:35:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-11-25 15:35:46,962 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-25 15:35:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:35:46,965 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-25 15:35:46,965 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-25 15:35:46,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-11-25 15:35:46,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:46,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:46,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:46,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:46,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:46,970 INFO L748 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 543#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 551#L367 assume !(main_~length~0#1 < 1); 544#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 545#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 546#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 552#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 555#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 553#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 554#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 561#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 558#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 557#L370-4 main_~j~0#1 := 0; 550#L378-2 [2022-11-25 15:35:46,971 INFO L750 eck$LassoCheckResult]: Loop: 550#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 556#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 550#L378-2 [2022-11-25 15:35:46,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:46,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2022-11-25 15:35:46,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:46,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488126484] [2022-11-25 15:35:46,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:46,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:46,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:47,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:47,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2022-11-25 15:35:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:47,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414687487] [2022-11-25 15:35:47,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:47,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:47,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:47,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2022-11-25 15:35:47,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:47,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875500177] [2022-11-25 15:35:47,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:47,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:47,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875500177] [2022-11-25 15:35:47,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875500177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:47,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272675488] [2022-11-25 15:35:47,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:47,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:47,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:47,459 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:47,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 15:35:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:47,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 15:35:47,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:47,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 15:35:47,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:35:47,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 15:35:47,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:35:47,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 15:35:47,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 15:35:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:47,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:47,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-11-25 15:35:47,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2022-11-25 15:35:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:48,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272675488] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:48,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:35:48,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-11-25 15:35:48,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681641907] [2022-11-25 15:35:48,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:48,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:48,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 15:35:48,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-11-25 15:35:48,060 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 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-25 15:35:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:48,247 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-11-25 15:35:48,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2022-11-25 15:35:48,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:48,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 29 transitions. [2022-11-25 15:35:48,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-25 15:35:48,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-25 15:35:48,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2022-11-25 15:35:48,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:48,252 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-11-25 15:35:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2022-11-25 15:35:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2022-11-25 15:35:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-25 15:35:48,257 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-25 15:35:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:35:48,259 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-25 15:35:48,260 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-25 15:35:48,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2022-11-25 15:35:48,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:48,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:48,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:48,261 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:48,262 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:48,262 INFO L748 eck$LassoCheckResult]: Stem: 700#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 701#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 707#L367 assume !(main_~length~0#1 < 1); 698#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 699#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 702#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 708#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 713#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 709#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 710#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 711#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 712#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 703#L370-4 main_~j~0#1 := 0; 704#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 705#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 706#L378-2 [2022-11-25 15:35:48,262 INFO L750 eck$LassoCheckResult]: Loop: 706#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 714#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 706#L378-2 [2022-11-25 15:35:48,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:48,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2022-11-25 15:35:48,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:48,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304377162] [2022-11-25 15:35:48,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:48,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:48,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:48,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2022-11-25 15:35:48,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:48,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825478254] [2022-11-25 15:35:48,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:48,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:48,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:48,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:48,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2022-11-25 15:35:48,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:48,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611291154] [2022-11-25 15:35:48,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:48,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:48,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:48,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611291154] [2022-11-25 15:35:48,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611291154] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:48,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284513670] [2022-11-25 15:35:48,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:35:48,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:48,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:48,607 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:48,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 15:35:48,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:35:48,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:35:48,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 15:35:48,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:48,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:35:48,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 15:35:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:48,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:48,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-25 15:35:48,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-25 15:35:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:49,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284513670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:49,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:35:49,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-11-25 15:35:49,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845275851] [2022-11-25 15:35:49,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:49,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 15:35:49,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-11-25 15:35:49,077 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:49,287 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-11-25 15:35:49,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2022-11-25 15:35:49,288 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-25 15:35:49,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2022-11-25 15:35:49,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-11-25 15:35:49,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-11-25 15:35:49,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-11-25 15:35:49,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:49,289 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-11-25 15:35:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-11-25 15:35:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-11-25 15:35:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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-25 15:35:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-11-25 15:35:49,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-11-25 15:35:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:35:49,297 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-11-25 15:35:49,297 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-25 15:35:49,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2022-11-25 15:35:49,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:49,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:49,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:49,298 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:49,299 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:49,299 INFO L748 eck$LassoCheckResult]: Stem: 872#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 873#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 880#L367 assume !(main_~length~0#1 < 1); 874#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 875#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 876#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 881#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 889#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 882#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 883#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 884#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 886#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 887#L370-4 main_~j~0#1 := 0; 892#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 879#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 878#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 885#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 891#L378-2 [2022-11-25 15:35:49,299 INFO L750 eck$LassoCheckResult]: Loop: 891#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 890#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 891#L378-2 [2022-11-25 15:35:49,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2022-11-25 15:35:49,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:49,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994135793] [2022-11-25 15:35:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:49,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:49,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:49,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:49,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:49,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2022-11-25 15:35:49,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:49,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074033850] [2022-11-25 15:35:49,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:49,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:49,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:49,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:49,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:49,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2022-11-25 15:35:49,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:49,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371098814] [2022-11-25 15:35:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:49,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:49,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371098814] [2022-11-25 15:35:49,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371098814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:49,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970720685] [2022-11-25 15:35:49,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:35:49,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:49,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:49,490 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:49,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 15:35:49,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 15:35:49,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:35:49,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:35:49,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:49,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:49,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970720685] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:49,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:35:49,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-25 15:35:49,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36376360] [2022-11-25 15:35:49,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:49,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:49,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 15:35:49,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-25 15:35:49,763 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 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-25 15:35:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:49,874 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-11-25 15:35:49,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2022-11-25 15:35:49,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:49,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2022-11-25 15:35:49,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-25 15:35:49,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-25 15:35:49,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-11-25 15:35:49,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:49,895 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-11-25 15:35:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-11-25 15:35:49,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-11-25 15:35:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 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-25 15:35:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-25 15:35:49,897 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-25 15:35:49,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:35:49,899 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-25 15:35:49,899 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-25 15:35:49,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2022-11-25 15:35:49,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:49,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:49,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:49,900 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:49,900 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:49,901 INFO L748 eck$LassoCheckResult]: Stem: 1068#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1069#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1075#L367 assume !(main_~length~0#1 < 1); 1066#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1067#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1070#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1076#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1091#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1090#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1079#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1080#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1077#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1078#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1088#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1086#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1085#L370-4 main_~j~0#1 := 0; 1074#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1084#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1083#L378-2 [2022-11-25 15:35:49,901 INFO L750 eck$LassoCheckResult]: Loop: 1083#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1082#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1083#L378-2 [2022-11-25 15:35:49,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222883, now seen corresponding path program 1 times [2022-11-25 15:35:49,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:49,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249509214] [2022-11-25 15:35:49,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:49,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:49,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:49,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:49,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2022-11-25 15:35:49,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:49,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736964064] [2022-11-25 15:35:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:49,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:49,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:49,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:49,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash -761053530, now seen corresponding path program 1 times [2022-11-25 15:35:49,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:49,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027129257] [2022-11-25 15:35:49,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:50,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:50,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027129257] [2022-11-25 15:35:50,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027129257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:50,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998516714] [2022-11-25 15:35:50,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:50,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:50,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:50,283 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:50,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 15:35:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:50,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 15:35:50,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:50,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 15:35:50,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-25 15:35:50,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 15:35:50,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 15:35:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:50,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:50,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-11-25 15:35:50,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-11-25 15:35:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:50,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998516714] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:50,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:35:50,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2022-11-25 15:35:50,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402492098] [2022-11-25 15:35:50,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:50,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:50,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 15:35:50,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-11-25 15:35:50,922 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 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-25 15:35:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:51,334 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2022-11-25 15:35:51,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 100 transitions. [2022-11-25 15:35:51,335 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-11-25 15:35:51,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 100 transitions. [2022-11-25 15:35:51,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-11-25 15:35:51,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-11-25 15:35:51,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 100 transitions. [2022-11-25 15:35:51,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:51,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 100 transitions. [2022-11-25 15:35:51,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 100 transitions. [2022-11-25 15:35:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 41. [2022-11-25 15:35:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2022-11-25 15:35:51,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 58 transitions. [2022-11-25 15:35:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 15:35:51,372 INFO L428 stractBuchiCegarLoop]: Abstraction has 41 states and 58 transitions. [2022-11-25 15:35:51,373 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-25 15:35:51,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 58 transitions. [2022-11-25 15:35:51,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:51,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:51,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:51,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:51,378 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:51,378 INFO L748 eck$LassoCheckResult]: Stem: 1333#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1334#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1341#L367 assume !(main_~length~0#1 < 1); 1335#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1336#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1337#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1342#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1353#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1354#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1355#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1356#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1343#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1344#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1346#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1373#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1351#L370-4 main_~j~0#1 := 0; 1359#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1338#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1339#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1345#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1358#L378-2 [2022-11-25 15:35:51,378 INFO L750 eck$LassoCheckResult]: Loop: 1358#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1357#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1358#L378-2 [2022-11-25 15:35:51,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash -761053528, now seen corresponding path program 2 times [2022-11-25 15:35:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:51,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30700364] [2022-11-25 15:35:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:51,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:51,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:51,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:51,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2022-11-25 15:35:51,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:51,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828573387] [2022-11-25 15:35:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:51,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:51,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:51,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:51,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1227998741, now seen corresponding path program 2 times [2022-11-25 15:35:51,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:51,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509257098] [2022-11-25 15:35:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:51,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:51,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:51,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509257098] [2022-11-25 15:35:51,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509257098] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:51,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702075300] [2022-11-25 15:35:51,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:35:51,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:51,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:51,715 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:51,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 15:35:51,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:35:51,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:35:51,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 15:35:51,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:51,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 15:35:52,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 15:35:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:52,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:52,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-25 15:35:52,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-25 15:35:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:52,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702075300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:52,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:35:52,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-11-25 15:35:52,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278882255] [2022-11-25 15:35:52,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:52,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:52,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 15:35:52,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-11-25 15:35:52,282 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. cyclomatic complexity: 20 Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 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-25 15:35:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:52,628 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-11-25 15:35:52,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 68 transitions. [2022-11-25 15:35:52,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-25 15:35:52,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 68 transitions. [2022-11-25 15:35:52,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-25 15:35:52,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-11-25 15:35:52,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2022-11-25 15:35:52,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:52,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-11-25 15:35:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2022-11-25 15:35:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-11-25 15:35:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2022-11-25 15:35:52,633 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-11-25 15:35:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:35:52,634 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-11-25 15:35:52,634 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-25 15:35:52,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 61 transitions. [2022-11-25 15:35:52,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 15:35:52,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:52,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:52,635 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:52,635 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:52,636 INFO L748 eck$LassoCheckResult]: Stem: 1591#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1592#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1599#L367 assume !(main_~length~0#1 < 1); 1593#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1594#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1595#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1600#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1611#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1612#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1613#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1614#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1601#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1602#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1604#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1634#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1596#L370-4 main_~j~0#1 := 0; 1597#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1618#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1616#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1615#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1610#L378-2 [2022-11-25 15:35:52,636 INFO L750 eck$LassoCheckResult]: Loop: 1610#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1609#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1610#L378-2 [2022-11-25 15:35:52,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:52,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1570400154, now seen corresponding path program 4 times [2022-11-25 15:35:52,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:52,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360295797] [2022-11-25 15:35:52,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:52,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:52,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:52,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2022-11-25 15:35:52,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:52,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966768952] [2022-11-25 15:35:52,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:52,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:52,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:52,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:52,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025751, now seen corresponding path program 4 times [2022-11-25 15:35:52,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:52,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874150955] [2022-11-25 15:35:52,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:52,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:52,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874150955] [2022-11-25 15:35:52,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874150955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:52,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758891975] [2022-11-25 15:35:52,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 15:35:52,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:52,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:52,960 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:52,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 15:35:53,049 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 15:35:53,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:35:53,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 15:35:53,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:53,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 15:35:53,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 15:35:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:53,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:53,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-25 15:35:53,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-25 15:35:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:53,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758891975] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:53,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:35:53,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-11-25 15:35:53,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911306850] [2022-11-25 15:35:53,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:53,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:53,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 15:35:53,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-25 15:35:53,427 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. cyclomatic complexity: 20 Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 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-25 15:35:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:53,619 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-11-25 15:35:53,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2022-11-25 15:35:53,620 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-11-25 15:35:53,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2022-11-25 15:35:53,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-25 15:35:53,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-25 15:35:53,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2022-11-25 15:35:53,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:53,622 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-11-25 15:35:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2022-11-25 15:35:53,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2022-11-25 15:35:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 58 states have internal predecessors, (83), 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-25 15:35:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2022-11-25 15:35:53,630 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 83 transitions. [2022-11-25 15:35:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 15:35:53,635 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 83 transitions. [2022-11-25 15:35:53,635 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-25 15:35:53,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 83 transitions. [2022-11-25 15:35:53,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 15:35:53,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:53,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:53,636 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:53,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:53,637 INFO L748 eck$LassoCheckResult]: Stem: 1857#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1858#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1865#L367 assume !(main_~length~0#1 < 1); 1859#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1860#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1861#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1866#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1873#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1874#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1878#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1879#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1867#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1868#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1903#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1902#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1876#L370-4 main_~j~0#1 := 0; 1909#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1864#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1863#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1872#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1882#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1885#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1883#L378-2 [2022-11-25 15:35:53,637 INFO L750 eck$LassoCheckResult]: Loop: 1883#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1884#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1883#L378-2 [2022-11-25 15:35:53,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:53,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1227998739, now seen corresponding path program 3 times [2022-11-25 15:35:53,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:53,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731434846] [2022-11-25 15:35:53,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:53,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:53,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:53,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:53,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2022-11-25 15:35:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:53,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606526708] [2022-11-25 15:35:53,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:53,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:53,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:53,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:53,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1009219568, now seen corresponding path program 3 times [2022-11-25 15:35:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:53,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763371003] [2022-11-25 15:35:53,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:53,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:53,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:53,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763371003] [2022-11-25 15:35:53,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763371003] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:53,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339419847] [2022-11-25 15:35:53,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:35:53,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:53,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:53,811 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:53,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 15:35:53,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 15:35:53,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:35:53,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 15:35:53,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:54,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:54,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339419847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:54,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:35:54,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-25 15:35:54,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583954782] [2022-11-25 15:35:54,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:54,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:54,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 15:35:54,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-11-25 15:35:54,160 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. cyclomatic complexity: 29 Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:54,324 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2022-11-25 15:35:54,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 90 transitions. [2022-11-25 15:35:54,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 15:35:54,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 59 states and 81 transitions. [2022-11-25 15:35:54,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-11-25 15:35:54,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-11-25 15:35:54,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 81 transitions. [2022-11-25 15:35:54,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:54,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-25 15:35:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 81 transitions. [2022-11-25 15:35:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 15:35:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 58 states have internal predecessors, (81), 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-25 15:35:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2022-11-25 15:35:54,330 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-25 15:35:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 15:35:54,334 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-25 15:35:54,334 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-25 15:35:54,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 81 transitions. [2022-11-25 15:35:54,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 15:35:54,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:54,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:54,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:54,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:54,336 INFO L748 eck$LassoCheckResult]: Stem: 2153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2162#L367 assume !(main_~length~0#1 < 1); 2155#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2156#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2157#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2163#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2166#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2164#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2165#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2211#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2209#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2208#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2206#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2204#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2201#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2200#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2198#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2189#L370-4 main_~j~0#1 := 0; 2161#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2182#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2172#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2176#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2175#L378-2 [2022-11-25 15:35:54,336 INFO L750 eck$LassoCheckResult]: Loop: 2175#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2174#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2175#L378-2 [2022-11-25 15:35:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:54,336 INFO L85 PathProgramCache]: Analyzing trace with hash 775133344, now seen corresponding path program 4 times [2022-11-25 15:35:54,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:54,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373836625] [2022-11-25 15:35:54,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:54,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:54,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:54,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:54,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:54,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2022-11-25 15:35:54,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:54,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949443368] [2022-11-25 15:35:54,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:54,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:54,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:54,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:54,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1873802723, now seen corresponding path program 4 times [2022-11-25 15:35:54,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:54,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138546983] [2022-11-25 15:35:54,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:54,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:54,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138546983] [2022-11-25 15:35:54,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138546983] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:54,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461257050] [2022-11-25 15:35:54,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 15:35:54,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:54,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:54,835 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:54,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-25 15:35:54,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 15:35:54,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:35:54,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 15:35:54,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:54,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 15:35:55,056 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-25 15:35:55,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-25 15:35:55,086 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-25 15:35:55,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-25 15:35:55,317 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 15:35:55,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-11-25 15:35:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:55,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:55,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-11-25 15:35:55,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-11-25 15:35:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:55,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461257050] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:55,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:35:55,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-25 15:35:55,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235903058] [2022-11-25 15:35:55,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 15:35:55,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-11-25 15:35:55,800 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. cyclomatic complexity: 27 Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 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-25 15:35:56,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:56,274 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2022-11-25 15:35:56,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 120 transitions. [2022-11-25 15:35:56,275 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-11-25 15:35:56,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 120 transitions. [2022-11-25 15:35:56,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-11-25 15:35:56,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-11-25 15:35:56,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 120 transitions. [2022-11-25 15:35:56,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:56,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 120 transitions. [2022-11-25 15:35:56,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 120 transitions. [2022-11-25 15:35:56,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2022-11-25 15:35:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 58 states have internal predecessors, (81), 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-25 15:35:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2022-11-25 15:35:56,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-25 15:35:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 15:35:56,282 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-25 15:35:56,282 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-25 15:35:56,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 81 transitions. [2022-11-25 15:35:56,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 15:35:56,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:56,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:56,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:56,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:56,285 INFO L748 eck$LassoCheckResult]: Stem: 2486#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2487#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2495#L367 assume !(main_~length~0#1 < 1); 2488#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2489#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2490#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2496#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2506#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2507#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2508#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2504#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2505#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2511#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2512#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2497#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2498#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2499#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2501#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2502#L370-4 main_~j~0#1 := 0; 2492#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2534#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2515#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2518#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2516#L378-2 [2022-11-25 15:35:56,285 INFO L750 eck$LassoCheckResult]: Loop: 2516#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2517#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2516#L378-2 [2022-11-25 15:35:56,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:56,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1476197922, now seen corresponding path program 5 times [2022-11-25 15:35:56,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:56,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520814581] [2022-11-25 15:35:56,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:56,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:56,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:56,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:56,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 13 times [2022-11-25 15:35:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:56,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176566111] [2022-11-25 15:35:56,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:56,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:56,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:56,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:56,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996709, now seen corresponding path program 5 times [2022-11-25 15:35:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:56,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781746321] [2022-11-25 15:35:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:56,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:56,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781746321] [2022-11-25 15:35:56,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781746321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:56,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803559576] [2022-11-25 15:35:56,667 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 15:35:56,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:56,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:56,671 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:56,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-25 15:35:56,762 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-25 15:35:56,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:35:56,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 15:35:56,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:56,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 15:35:56,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:35:56,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 15:35:56,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:35:56,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 15:35:57,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:35:57,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 15:35:57,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-11-25 15:35:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:57,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:57,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-11-25 15:35:57,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-25 15:35:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:57,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803559576] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:57,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:35:57,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 28 [2022-11-25 15:35:57,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146335525] [2022-11-25 15:35:57,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:57,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 15:35:57,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-11-25 15:35:57,574 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. cyclomatic complexity: 27 Second operand has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 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-25 15:35:58,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:35:58,033 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-11-25 15:35:58,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2022-11-25 15:35:58,034 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-25 15:35:58,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 96 transitions. [2022-11-25 15:35:58,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-25 15:35:58,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-25 15:35:58,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 96 transitions. [2022-11-25 15:35:58,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:35:58,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 96 transitions. [2022-11-25 15:35:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 96 transitions. [2022-11-25 15:35:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2022-11-25 15:35:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.346938775510204) internal successors, (66), 48 states have internal predecessors, (66), 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-25 15:35:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2022-11-25 15:35:58,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 66 transitions. [2022-11-25 15:35:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 15:35:58,046 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2022-11-25 15:35:58,046 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-25 15:35:58,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 66 transitions. [2022-11-25 15:35:58,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 15:35:58,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:35:58,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:35:58,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:35:58,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:35:58,048 INFO L748 eck$LassoCheckResult]: Stem: 2807#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2808#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2816#L367 assume !(main_~length~0#1 < 1); 2809#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2810#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2811#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2817#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2834#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2829#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2828#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2822#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2823#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2832#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2833#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2818#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2819#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2855#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2846#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2812#L370-4 main_~j~0#1 := 0; 2813#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2814#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2815#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2844#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2837#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2839#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2840#L378-2 [2022-11-25 15:35:58,048 INFO L750 eck$LassoCheckResult]: Loop: 2840#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2841#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2840#L378-2 [2022-11-25 15:35:58,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1480775715, now seen corresponding path program 6 times [2022-11-25 15:35:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:58,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361258924] [2022-11-25 15:35:58,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:58,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:58,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:58,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:58,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 14 times [2022-11-25 15:35:58,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:58,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382671687] [2022-11-25 15:35:58,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:58,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:58,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:35:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:35:58,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:35:58,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:35:58,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1391288486, now seen corresponding path program 6 times [2022-11-25 15:35:58,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:35:58,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420488711] [2022-11-25 15:35:58,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:35:58,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:35:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:35:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:58,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:35:58,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420488711] [2022-11-25 15:35:58,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420488711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:35:58,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901549853] [2022-11-25 15:35:58,366 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 15:35:58,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:35:58,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:35:58,371 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:35:58,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-25 15:35:58,479 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-11-25 15:35:58,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:35:58,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 15:35:58,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:35:58,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 15:35:58,950 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-25 15:35:58,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-25 15:35:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:58,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:35:59,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-25 15:35:59,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-11-25 15:35:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:35:59,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901549853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:35:59,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:35:59,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2022-11-25 15:35:59,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815412271] [2022-11-25 15:35:59,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:35:59,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:35:59,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 15:35:59,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 15:35:59,691 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. cyclomatic complexity: 21 Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:36:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:36:01,687 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-11-25 15:36:01,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2022-11-25 15:36:01,688 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-11-25 15:36:01,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 76 transitions. [2022-11-25 15:36:01,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-11-25 15:36:01,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-11-25 15:36:01,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 76 transitions. [2022-11-25 15:36:01,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:01,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-11-25 15:36:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 76 transitions. [2022-11-25 15:36:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2022-11-25 15:36:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:36:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2022-11-25 15:36:01,692 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 59 transitions. [2022-11-25 15:36:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 15:36:01,693 INFO L428 stractBuchiCegarLoop]: Abstraction has 43 states and 59 transitions. [2022-11-25 15:36:01,693 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-25 15:36:01,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 59 transitions. [2022-11-25 15:36:01,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 15:36:01,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:36:01,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:36:01,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:01,694 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:36:01,695 INFO L748 eck$LassoCheckResult]: Stem: 3159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3160#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3167#L367 assume !(main_~length~0#1 < 1); 3161#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3162#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3163#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3168#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3179#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3180#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3181#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3177#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3178#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3184#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3185#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3169#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3170#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3172#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3175#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3164#L370-4 main_~j~0#1 := 0; 3165#L378-2 [2022-11-25 15:36:01,695 INFO L750 eck$LassoCheckResult]: Loop: 3165#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3166#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3165#L378-2 [2022-11-25 15:36:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:01,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1824010476, now seen corresponding path program 2 times [2022-11-25 15:36:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:01,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878351077] [2022-11-25 15:36:01,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:36:01,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:36:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:36:01,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:36:01,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:01,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2022-11-25 15:36:01,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:01,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544431646] [2022-11-25 15:36:01,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:01,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:36:01,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:36:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:36:01,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:36:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash -527409319, now seen corresponding path program 7 times [2022-11-25 15:36:01,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:01,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702498897] [2022-11-25 15:36:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:36:01,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:36:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:36:01,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:36:02,821 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 15:36:02,821 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 15:36:02,821 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 15:36:02,821 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 15:36:02,821 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 15:36:02,822 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:02,822 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 15:36:02,822 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 15:36:02,822 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration16_Lasso [2022-11-25 15:36:02,822 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 15:36:02,822 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 15:36:02,824 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-25 15:36:02,828 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-25 15:36:02,830 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-25 15:36:02,834 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-25 15:36:03,137 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-25 15:36:03,139 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-25 15:36:03,142 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-25 15:36:03,144 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-25 15:36:03,146 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-25 15:36:03,149 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-25 15:36:03,151 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-25 15:36:03,154 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-25 15:36:03,486 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 15:36:03,486 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 15:36:03,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:03,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:03,491 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:03,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-25 15:36:03,493 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-25 15:36:03,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:36:03,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:36:03,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:36:03,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:36:03,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:36:03,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:36:03,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:36:03,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:03,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:03,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:03,522 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:03,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-25 15:36:03,526 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-25 15:36:03,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:36:03,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 15:36:03,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:36:03,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:36:03,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:36:03,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 15:36:03,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 15:36:03,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:36:03,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-11-25 15:36:03,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:03,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:03,549 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:03,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-25 15:36:03,556 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-25 15:36:03,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:36:03,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:36:03,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:36:03,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:36:03,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:36:03,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:36:03,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:36:03,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-11-25 15:36:03,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:03,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:03,581 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:03,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-25 15:36:03,584 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-25 15:36:03,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:36:03,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:36:03,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:36:03,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:36:03,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:36:03,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:36:03,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:36:03,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:03,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:03,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:03,606 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:03,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-25 15:36:03,610 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-25 15:36:03,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:36:03,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:36:03,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:36:03,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:36:03,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:36:03,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:36:03,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:36:03,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:03,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:03,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:03,661 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:03,672 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-25 15:36:03,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-25 15:36:03,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:36:03,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:36:03,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:36:03,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:36:03,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:36:03,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:36:03,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:36:03,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:03,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:03,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:03,713 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:03,719 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-25 15:36:03,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-25 15:36:03,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:36:03,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:36:03,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:36:03,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:36:03,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:36:03,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:36:03,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:36:03,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:03,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:03,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:03,772 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:03,776 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-25 15:36:03,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:36:03,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:36:03,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:36:03,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:36:03,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:36:03,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:36:03,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-25 15:36:03,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:36:03,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:03,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:03,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:03,820 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:03,825 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-25 15:36:03,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:36:03,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:36:03,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:36:03,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:36:03,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:36:03,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:36:03,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-25 15:36:03,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:36:03,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:03,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:03,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:03,860 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:03,865 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-25 15:36:03,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:36:03,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:36:03,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:36:03,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:36:03,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:36:03,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:36:03,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-25 15:36:03,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 15:36:03,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:03,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:03,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:03,904 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:03,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-25 15:36:03,908 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-25 15:36:03,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 15:36:03,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 15:36:03,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 15:36:03,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 15:36:03,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 15:36:03,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 15:36:03,942 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 15:36:04,010 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-11-25 15:36:04,011 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-11-25 15:36:04,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 15:36:04,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:04,019 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:04,028 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 15:36:04,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-25 15:36:04,059 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-25 15:36:04,060 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 15:36:04,060 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~arr~0#1.offset, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 1*ULTIMATE.start_main_~arr~0#1.offset - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-11-25 15:36:04,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:04,088 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-11-25 15:36:04,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:04,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 15:36:04,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:36:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:04,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 15:36:04,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:36:04,185 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-25 15:36:04,186 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-25 15:36:04,186 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 59 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:36:04,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 59 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51 states and 69 transitions. Complement of second has 5 states. [2022-11-25 15:36:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-11-25 15:36:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:36:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-11-25 15:36:04,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 2 letters. [2022-11-25 15:36:04,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 15:36:04,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 21 letters. Loop has 2 letters. [2022-11-25 15:36:04,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 15:36:04,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2022-11-25 15:36:04,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 15:36:04,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2022-11-25 15:36:04,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 15:36:04,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 44 states and 56 transitions. [2022-11-25 15:36:04,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-25 15:36:04,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-11-25 15:36:04,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 56 transitions. [2022-11-25 15:36:04,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:04,210 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-25 15:36:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 56 transitions. [2022-11-25 15:36:04,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-25 15:36:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:36:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-11-25 15:36:04,219 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-25 15:36:04,219 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-25 15:36:04,219 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-25 15:36:04,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2022-11-25 15:36:04,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 15:36:04,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 15:36:04,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 15:36:04,225 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:04,225 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 15:36:04,226 INFO L748 eck$LassoCheckResult]: Stem: 3364#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3365#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3373#L367 assume !(main_~length~0#1 < 1); 3366#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3367#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3368#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3374#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3402#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3375#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3376#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3377#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3380#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3401#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3400#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3398#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3396#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3394#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3392#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3390#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3388#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3387#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3382#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3383#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3381#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3369#L370-4 main_~j~0#1 := 0; 3370#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3405#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3406#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3403#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3378#L378-2 [2022-11-25 15:36:04,226 INFO L750 eck$LassoCheckResult]: Loop: 3378#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3379#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3378#L378-2 [2022-11-25 15:36:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash 134458908, now seen corresponding path program 7 times [2022-11-25 15:36:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:04,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622926429] [2022-11-25 15:36:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:04,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:04,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:04,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:04,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622926429] [2022-11-25 15:36:04,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622926429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:36:04,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728907313] [2022-11-25 15:36:04,969 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 15:36:04,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:36:04,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:04,971 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:36:04,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-25 15:36:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:05,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 15:36:05,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:36:05,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 15:36:05,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-25 15:36:05,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-25 15:36:05,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-25 15:36:05,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:05,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 15:36:05,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:05,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 15:36:05,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 15:36:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:05,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:36:05,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-11-25 15:36:05,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-25 15:36:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 15:36:05,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728907313] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:36:05,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:36:05,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 28 [2022-11-25 15:36:05,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842620317] [2022-11-25 15:36:05,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:36:05,909 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 15:36:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:05,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 15 times [2022-11-25 15:36:05,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:05,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32951892] [2022-11-25 15:36:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:36:05,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:36:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:36:05,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:36:05,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:05,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 15:36:05,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-11-25 15:36:05,979 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. cyclomatic complexity: 16 Second operand has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 29 states have internal predecessors, (64), 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-25 15:36:06,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:36:06,389 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-11-25 15:36:06,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2022-11-25 15:36:06,390 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-25 15:36:06,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2022-11-25 15:36:06,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-11-25 15:36:06,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-11-25 15:36:06,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-11-25 15:36:06,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:06,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 15:36:06,391 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 15:36:06,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 15:36:06,391 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 15:36:06,391 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-25 15:36:06,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-11-25 15:36:06,391 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-25 15:36:06,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-11-25 15:36:06,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 03:36:06 BoogieIcfgContainer [2022-11-25 15:36:06,402 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-25 15:36:06,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:36:06,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:36:06,432 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:36:06,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:35:42" (3/4) ... [2022-11-25 15:36:06,436 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:36:06,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:36:06,437 INFO L158 Benchmark]: Toolchain (without parser) took 25152.47ms. Allocated memory was 195.0MB in the beginning and 343.9MB in the end (delta: 148.9MB). Free memory was 148.8MB in the beginning and 300.1MB in the end (delta: -151.3MB). Peak memory consumption was 279.1kB. Max. memory is 16.1GB. [2022-11-25 15:36:06,437 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 142.6MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:36:06,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 665.09ms. Allocated memory is still 195.0MB. Free memory was 148.8MB in the beginning and 130.9MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 15:36:06,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.69ms. Allocated memory is still 195.0MB. Free memory was 130.9MB in the beginning and 129.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:36:06,439 INFO L158 Benchmark]: Boogie Preprocessor took 53.71ms. Allocated memory is still 195.0MB. Free memory was 129.0MB in the beginning and 127.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:36:06,439 INFO L158 Benchmark]: RCFGBuilder took 332.94ms. Allocated memory is still 195.0MB. Free memory was 127.8MB in the beginning and 117.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 15:36:06,439 INFO L158 Benchmark]: BuchiAutomizer took 23988.21ms. Allocated memory was 195.0MB in the beginning and 285.2MB in the end (delta: 90.2MB). Free memory was 117.0MB in the beginning and 86.1MB in the end (delta: 30.9MB). Peak memory consumption was 123.2MB. Max. memory is 16.1GB. [2022-11-25 15:36:06,440 INFO L158 Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 343.9MB. Free memory is still 300.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:36:06,441 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 142.6MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 665.09ms. Allocated memory is still 195.0MB. Free memory was 148.8MB in the beginning and 130.9MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.69ms. Allocated memory is still 195.0MB. Free memory was 130.9MB in the beginning and 129.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.71ms. Allocated memory is still 195.0MB. Free memory was 129.0MB in the beginning and 127.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 332.94ms. Allocated memory is still 195.0MB. Free memory was 127.8MB in the beginning and 117.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 23988.21ms. Allocated memory was 195.0MB in the beginning and 285.2MB in the end (delta: 90.2MB). Free memory was 117.0MB in the beginning and 86.1MB in the end (delta: 30.9MB). Peak memory consumption was 123.2MB. Max. memory is 16.1GB. * Witness Printer took 5.05ms. Allocated memory is still 343.9MB. Free memory is still 300.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (15 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[arr] + -1 * arr and consists of 5 locations. One deterministic module has affine ranking function -4 * j + unknown-#length-unknown[arr] + -1 * arr and consists of 3 locations. 15 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.9s and 18 iterations. TraceHistogramMax:6. Analysis of lassos took 17.9s. Construction of modules took 2.3s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 17. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 152 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 676 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 674 mSDsluCounter, 957 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 797 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2903 IncrementalHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 160 mSDtfsCounter, 2903 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc12 concLT0 SILN0 SILU3 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital136 mio100 ax100 hnf100 lsp93 ukn83 mio100 lsp58 div163 bol100 ite100 ukn100 eq150 hnf93 smp73 dnf100 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-11-25 15:36:06,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:06,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:06,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:07,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:07,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-25 15:36:07,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:07,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-25 15:36:07,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:08,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-25 15:36:08,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-25 15:36:08,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-25 15:36:08,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-25 15:36:08,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-25 15:36:09,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-25 15:36:09,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5deabcb-b48a-4f8d-accf-34faccf8a357/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE