./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array12_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array12_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8 --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 b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 --- 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-2329fc7 [2022-12-13 22:25:02,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:25:02,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:25:02,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:25:02,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:25:02,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:25:02,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:25:02,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:25:02,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:25:02,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:25:02,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:25:02,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:25:02,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:25:02,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:25:02,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:25:02,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:25:02,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:25:02,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:25:02,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:25:02,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:25:02,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:25:02,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:25:02,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:25:02,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:25:02,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:25:02,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:25:02,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:25:02,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:25:02,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:25:02,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:25:02,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:25:02,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:25:02,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:25:02,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:25:02,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:25:02,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:25:02,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:25:02,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:25:02,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:25:02,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:25:02,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:25:02,135 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-12-13 22:25:02,155 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:25:02,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:25:02,156 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:25:02,156 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:25:02,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:25:02,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:25:02,163 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:25:02,163 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 22:25:02,163 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 22:25:02,164 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 22:25:02,164 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 22:25:02,164 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 22:25:02,164 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 22:25:02,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:25:02,165 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 22:25:02,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:25:02,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:25:02,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 22:25:02,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 22:25:02,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 22:25:02,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:25:02,166 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 22:25:02,166 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:25:02,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 22:25:02,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:25:02,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:25:02,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:25:02,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:25:02,168 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 22:25:02,168 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_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/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_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8 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 -> b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 [2022-12-13 22:25:02,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:25:02,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:25:02,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:25:02,358 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:25:02,358 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:25:02,359 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/termination-15/array12_alloca.i [2022-12-13 22:25:04,984 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:25:05,168 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:25:05,168 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/sv-benchmarks/c/termination-15/array12_alloca.i [2022-12-13 22:25:05,174 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/data/5316e9528/76be1646645d408cae6cfd845c72287c/FLAGba3fc3fbf [2022-12-13 22:25:05,185 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/data/5316e9528/76be1646645d408cae6cfd845c72287c [2022-12-13 22:25:05,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:25:05,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:25:05,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:25:05,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:25:05,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:25:05,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ccc3fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05, skipping insertion in model container [2022-12-13 22:25:05,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:25:05,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:25:05,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:25:05,407 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:25:05,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:25:05,459 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:25:05,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05 WrapperNode [2022-12-13 22:25:05,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:25:05,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:25:05,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:25:05,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:25:05,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,493 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-12-13 22:25:05,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:25:05,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:25:05,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:25:05,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:25:05,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,511 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:25:05,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:25:05,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:25:05,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:25:05,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05" (1/1) ... [2022-12-13 22:25:05,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:05,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:05,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:05,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 22:25:05,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 22:25:05,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 22:25:05,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 22:25:05,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 22:25:05,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:25:05,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:25:05,641 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:25:05,642 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:25:05,744 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:25:05,749 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:25:05,749 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 22:25:05,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:25:05 BoogieIcfgContainer [2022-12-13 22:25:05,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:25:05,752 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 22:25:05,752 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 22:25:05,756 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 22:25:05,756 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 22:25:05,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 10:25:05" (1/3) ... [2022-12-13 22:25:05,757 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@215e2460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 10:25:05, skipping insertion in model container [2022-12-13 22:25:05,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 22:25:05,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:25:05" (2/3) ... [2022-12-13 22:25:05,758 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@215e2460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 10:25:05, skipping insertion in model container [2022-12-13 22:25:05,758 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 22:25:05,758 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:25:05" (3/3) ... [2022-12-13 22:25:05,759 INFO L332 chiAutomizerObserver]: Analyzing ICFG array12_alloca.i [2022-12-13 22:25:05,806 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 22:25:05,806 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 22:25:05,806 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 22:25:05,806 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 22:25:05,806 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 22:25:05,806 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 22:25:05,806 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 22:25:05,807 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 22:25:05,811 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-12-13 22:25:05,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-12-13 22:25:05,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:05,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:05,830 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-12-13 22:25:05,831 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 22:25:05,831 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 22:25:05,842 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-12-13 22:25:05,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-12-13 22:25:05,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:05,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:05,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-12-13 22:25:05,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 22:25:05,852 INFO L748 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 6#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; 3#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4#L370-3true [2022-12-13 22:25:05,852 INFO L750 eck$LassoCheckResult]: Loop: 4#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; 4#L370-3true [2022-12-13 22:25:05,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:05,857 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-12-13 22:25:05,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:05,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621125386] [2022-12-13 22:25:05,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:05,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:05,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:05,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:05,978 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2022-12-13 22:25:05,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:05,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42060722] [2022-12-13 22:25:05,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:05,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:05,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:05,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2022-12-13 22:25:06,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:06,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635884733] [2022-12-13 22:25:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:06,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:06,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:06,255 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 22:25:06,255 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 22:25:06,256 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 22:25:06,256 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 22:25:06,256 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 22:25:06,256 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:06,256 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 22:25:06,256 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 22:25:06,256 INFO L133 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration1_Lasso [2022-12-13 22:25:06,256 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 22:25:06,256 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 22:25:06,268 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:06,276 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:06,279 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:06,282 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:06,284 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:06,286 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:06,390 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:06,392 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:06,394 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:06,395 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:06,397 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:06,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-12-13 22:25:06,594 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 22:25:06,597 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 22:25:06,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:06,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:06,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:06,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-12-13 22:25:06,601 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-12-13 22:25:06,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:06,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 22:25:06,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:06,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:06,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:06,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 22:25:06,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 22:25:06,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:06,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:06,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:06,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:06,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:06,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-12-13 22:25:06,624 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-12-13 22:25:06,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:06,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:06,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:06,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:06,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:06,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:06,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:06,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-12-13 22:25:06,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:06,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:06,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:06,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-12-13 22:25:06,647 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-12-13 22:25:06,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:06,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 22:25:06,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:06,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:06,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:06,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 22:25:06,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 22:25:06,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:06,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:06,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:06,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:06,664 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:06,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-12-13 22:25:06,666 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-12-13 22:25:06,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:06,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 22:25:06,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:06,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:06,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:06,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 22:25:06,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 22:25:06,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:06,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-12-13 22:25:06,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:06,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:06,683 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:06,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-12-13 22:25:06,685 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-12-13 22:25:06,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:06,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 22:25:06,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:06,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:06,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:06,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 22:25:06,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 22:25:06,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:06,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-12-13 22:25:06,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:06,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:06,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:06,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-12-13 22:25:06,704 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-12-13 22:25:06,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:06,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 22:25:06,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:06,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:06,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:06,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 22:25:06,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 22:25:06,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:06,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:06,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:06,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:06,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:06,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-12-13 22:25:06,723 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-12-13 22:25:06,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:06,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:06,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:06,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:06,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:06,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:06,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:06,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-12-13 22:25:06,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:06,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:06,744 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:06,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-12-13 22:25:06,746 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-12-13 22:25:06,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:06,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:06,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:06,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:06,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:06,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:06,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:06,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-12-13 22:25:06,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:06,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:06,770 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:06,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-12-13 22:25:06,772 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-12-13 22:25:06,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:06,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:06,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:06,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:06,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:06,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:06,801 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 22:25:06,835 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-12-13 22:25:06,835 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-12-13 22:25:06,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:06,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:06,876 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:06,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-12-13 22:25:06,878 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 22:25:06,889 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 22:25:06,890 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 22:25:06,890 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~arr~0#1.offset) = 1*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 Supporting invariants [] [2022-12-13 22:25:06,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-12-13 22:25:06,905 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-12-13 22:25:06,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:06,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 22:25:06,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:06,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 22:25:06,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:07,023 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-12-13 22:25:07,025 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-12-13 22:25:07,065 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-12-13 22:25:07,067 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-12-13 22:25:07,071 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-12-13 22:25:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-13 22:25:07,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2022-12-13 22:25:07,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 22:25:07,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2022-12-13 22:25:07,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 22:25:07,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2022-12-13 22:25:07,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 22:25:07,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2022-12-13 22:25:07,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:07,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2022-12-13 22:25:07,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-12-13 22:25:07,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-12-13 22:25:07,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-12-13 22:25:07,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:07,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-12-13 22:25:07,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-12-13 22:25:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-12-13 22:25:07,100 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-12-13 22:25:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-12-13 22:25:07,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-12-13 22:25:07,101 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-12-13 22:25:07,101 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 22:25:07,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-12-13 22:25:07,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:07,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:07,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:07,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:07,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:07,103 INFO L748 eck$LassoCheckResult]: Stem: 118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 119#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); 112#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; 113#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 114#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 115#L370-4 main_~j~0#1 := 0; 116#L378-2 [2022-12-13 22:25:07,103 INFO L750 eck$LassoCheckResult]: Loop: 116#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); 117#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; 116#L378-2 [2022-12-13 22:25:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2022-12-13 22:25:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:07,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572869570] [2022-12-13 22:25:07,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:07,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:07,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:07,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572869570] [2022-12-13 22:25:07,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572869570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:25:07,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:25:07,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:25:07,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100628258] [2022-12-13 22:25:07,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:25:07,180 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 22:25:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2022-12-13 22:25:07,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:07,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793950056] [2022-12-13 22:25:07,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:07,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:07,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:07,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:07,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:07,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:25:07,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:25:07,236 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-12-13 22:25:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:07,258 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-12-13 22:25:07,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-12-13 22:25:07,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:07,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2022-12-13 22:25:07,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-12-13 22:25:07,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-12-13 22:25:07,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-12-13 22:25:07,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:07,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-12-13 22:25:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-12-13 22:25:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-12-13 22:25:07,261 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-12-13 22:25:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-12-13 22:25:07,261 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-12-13 22:25:07,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:25:07,262 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-12-13 22:25:07,263 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 22:25:07,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-12-13 22:25:07,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:07,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:07,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:07,264 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:07,264 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:07,264 INFO L748 eck$LassoCheckResult]: Stem: 151#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 152#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); 145#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; 146#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 147#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); 148#L370-4 main_~j~0#1 := 0; 149#L378-2 [2022-12-13 22:25:07,264 INFO L750 eck$LassoCheckResult]: Loop: 149#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); 150#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; 149#L378-2 [2022-12-13 22:25:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2022-12-13 22:25:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:07,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372405686] [2022-12-13 22:25:07,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:07,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:07,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2022-12-13 22:25:07,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:07,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138080282] [2022-12-13 22:25:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:07,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:07,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2022-12-13 22:25:07,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:07,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686204093] [2022-12-13 22:25:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:07,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-12-13 22:25:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:07,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686204093] [2022-12-13 22:25:07,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686204093] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:07,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066087217] [2022-12-13 22:25:07,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:07,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:07,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:07,576 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:07,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 22:25:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:07,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 22:25:07,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:07,657 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-12-13 22:25:07,710 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-12-13 22:25:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:07,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:07,776 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-12-13 22:25:07,781 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 26 treesize of output 24 [2022-12-13 22:25:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:07,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066087217] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:07,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:07,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-12-13 22:25:07,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273903632] [2022-12-13 22:25:07,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:07,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:07,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 22:25:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-12-13 22:25:07,835 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-12-13 22:25:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:07,930 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-12-13 22:25:07,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2022-12-13 22:25:07,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 22:25:07,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2022-12-13 22:25:07,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-12-13 22:25:07,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-12-13 22:25:07,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-12-13 22:25:07,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:07,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-12-13 22:25:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-12-13 22:25:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-12-13 22:25:07,935 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-12-13 22:25:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-12-13 22:25:07,936 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-12-13 22:25:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 22:25:07,937 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-12-13 22:25:07,937 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 22:25:07,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-12-13 22:25:07,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:07,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:07,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:07,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:07,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:07,941 INFO L748 eck$LassoCheckResult]: Stem: 275#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 276#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); 269#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; 270#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 271#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; 282#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); 272#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; 273#L378-2 [2022-12-13 22:25:07,941 INFO L750 eck$LassoCheckResult]: Loop: 273#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); 284#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; 273#L378-2 [2022-12-13 22:25:07,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2022-12-13 22:25:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:07,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087193617] [2022-12-13 22:25:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:07,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:07,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:07,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2022-12-13 22:25:07,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:07,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724681606] [2022-12-13 22:25:07,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:07,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:07,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:07,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:07,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:07,977 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2022-12-13 22:25:07,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:07,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459096421] [2022-12-13 22:25:07,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:07,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:08,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:08,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459096421] [2022-12-13 22:25:08,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459096421] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:08,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628359342] [2022-12-13 22:25:08,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:08,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:08,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:08,051 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:08,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 22:25:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:08,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 22:25:08,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:08,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:08,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628359342] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:08,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:08,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 22:25:08,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124552541] [2022-12-13 22:25:08,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:08,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:08,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 22:25:08,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 22:25:08,219 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-12-13 22:25:08,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:08,311 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-12-13 22:25:08,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2022-12-13 22:25:08,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 22:25:08,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 51 transitions. [2022-12-13 22:25:08,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-12-13 22:25:08,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-12-13 22:25:08,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2022-12-13 22:25:08,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:08,313 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-12-13 22:25:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2022-12-13 22:25:08,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-12-13 22:25:08,315 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-12-13 22:25:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-12-13 22:25:08,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-12-13 22:25:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 22:25:08,317 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-12-13 22:25:08,317 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 22:25:08,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2022-12-13 22:25:08,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 22:25:08,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:08,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:08,319 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:08,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:08,319 INFO L748 eck$LassoCheckResult]: Stem: 444#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 445#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; 442#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 435#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; 436#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 437#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); 467#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 465#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 466#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); 464#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); 462#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 459#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 438#L370-4 main_~j~0#1 := 0; 439#L378-2 [2022-12-13 22:25:08,319 INFO L750 eck$LassoCheckResult]: Loop: 439#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; 439#L378-2 [2022-12-13 22:25:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:08,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2022-12-13 22:25:08,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:08,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419630906] [2022-12-13 22:25:08,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:08,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:08,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:08,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419630906] [2022-12-13 22:25:08,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419630906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:08,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951351656] [2022-12-13 22:25:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:08,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:08,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:08,361 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:08,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 22:25:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:08,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 22:25:08,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:08,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:25:08,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951351656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:25:08,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:25:08,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-13 22:25:08,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035831328] [2022-12-13 22:25:08,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:25:08,435 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 22:25:08,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:08,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2022-12-13 22:25:08,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:08,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873892165] [2022-12-13 22:25:08,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:08,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:08,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:08,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:08,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:08,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:25:08,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:25:08,482 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-12-13 22:25:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:08,498 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-12-13 22:25:08,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2022-12-13 22:25:08,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:08,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2022-12-13 22:25:08,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-12-13 22:25:08,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-12-13 22:25:08,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-12-13 22:25:08,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:08,500 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-12-13 22:25:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-12-13 22:25:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-12-13 22:25:08,501 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-12-13 22:25:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-12-13 22:25:08,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-12-13 22:25:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:25:08,502 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-12-13 22:25:08,502 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 22:25:08,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-12-13 22:25:08,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:08,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:08,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:08,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:08,503 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:08,503 INFO L748 eck$LassoCheckResult]: Stem: 548#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 549#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; 550#L367 assume !(main_~length~0#1 < 1); 542#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; 543#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 544#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); 551#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 554#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 552#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); 553#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); 545#L370-4 main_~j~0#1 := 0; 546#L378-2 [2022-12-13 22:25:08,503 INFO L750 eck$LassoCheckResult]: Loop: 546#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); 555#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; 546#L378-2 [2022-12-13 22:25:08,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2022-12-13 22:25:08,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:08,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658475641] [2022-12-13 22:25:08,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:08,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:08,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:08,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:08,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:08,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2022-12-13 22:25:08,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:08,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535965129] [2022-12-13 22:25:08,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:08,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:08,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:08,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:08,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:08,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2022-12-13 22:25:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:08,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12260577] [2022-12-13 22:25:08,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:08,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:08,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:08,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12260577] [2022-12-13 22:25:08,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12260577] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:08,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870572045] [2022-12-13 22:25:08,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:08,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:08,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:08,806 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:08,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 22:25:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:08,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 22:25:08,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:08,863 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-12-13 22:25:08,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:25:08,908 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-12-13 22:25:08,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:25:08,922 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-12-13 22:25:08,954 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-12-13 22:25:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:08,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:09,113 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-12-13 22:25:09,117 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 64 treesize of output 62 [2022-12-13 22:25:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:09,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870572045] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:09,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:09,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 22:25:09,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412040362] [2022-12-13 22:25:09,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:09,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 22:25:09,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-12-13 22:25:09,188 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-12-13 22:25:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:09,302 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-12-13 22:25:09,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2022-12-13 22:25:09,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:09,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 29 transitions. [2022-12-13 22:25:09,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-12-13 22:25:09,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-12-13 22:25:09,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2022-12-13 22:25:09,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:09,304 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-12-13 22:25:09,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2022-12-13 22:25:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2022-12-13 22:25:09,306 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-12-13 22:25:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-12-13 22:25:09,306 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-12-13 22:25:09,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 22:25:09,307 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-12-13 22:25:09,307 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 22:25:09,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2022-12-13 22:25:09,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:09,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:09,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:09,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:09,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:09,308 INFO L748 eck$LassoCheckResult]: Stem: 706#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 707#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; 705#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; 700#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); 701#L370-4 main_~j~0#1 := 0; 702#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); 703#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; 704#L378-2 [2022-12-13 22:25:09,309 INFO L750 eck$LassoCheckResult]: Loop: 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); 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; 704#L378-2 [2022-12-13 22:25:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:09,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2022-12-13 22:25:09,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:09,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123563887] [2022-12-13 22:25:09,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:09,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:09,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:09,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:09,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:09,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2022-12-13 22:25:09,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:09,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317707643] [2022-12-13 22:25:09,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:09,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:09,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:09,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:09,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2022-12-13 22:25:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:09,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241842311] [2022-12-13 22:25:09,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:09,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:09,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:09,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241842311] [2022-12-13 22:25:09,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241842311] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:09,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522539139] [2022-12-13 22:25:09,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 22:25:09,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:09,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:09,477 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:09,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 22:25:09,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 22:25:09,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:25:09,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 22:25:09,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:09,561 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-12-13 22:25:09,631 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-12-13 22:25:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:09,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:09,688 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-12-13 22:25:09,691 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-12-13 22:25:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:09,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522539139] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:09,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:09,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 22:25:09,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800077878] [2022-12-13 22:25:09,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:09,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:09,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 22:25:09,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-12-13 22:25:09,734 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-12-13 22:25:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:09,866 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-12-13 22:25:09,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2022-12-13 22:25:09,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 22:25:09,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2022-12-13 22:25:09,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-12-13 22:25:09,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-12-13 22:25:09,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-12-13 22:25:09,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:09,867 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-12-13 22:25:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-12-13 22:25:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-12-13 22:25:09,869 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-12-13 22:25:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-12-13 22:25:09,870 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-12-13 22:25:09,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 22:25:09,870 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-12-13 22:25:09,870 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 22:25:09,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2022-12-13 22:25:09,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:09,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:09,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:09,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:09,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:09,871 INFO L748 eck$LassoCheckResult]: Stem: 878#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 879#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); 872#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; 873#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 874#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); 877#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; 876#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-12-13 22:25:09,871 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-12-13 22:25:09,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2022-12-13 22:25:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:09,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438635986] [2022-12-13 22:25:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:09,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:09,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2022-12-13 22:25:09,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:09,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315260865] [2022-12-13 22:25:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:09,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:09,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:09,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:09,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2022-12-13 22:25:09,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:09,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083689745] [2022-12-13 22:25:09,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:09,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:09,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:09,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083689745] [2022-12-13 22:25:09,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083689745] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:09,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203357912] [2022-12-13 22:25:09,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 22:25:09,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:09,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:09,955 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:09,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 22:25:10,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 22:25:10,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:25:10,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 22:25:10,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:10,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:10,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203357912] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:10,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:10,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 22:25:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205353054] [2022-12-13 22:25:10,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:10,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:10,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 22:25:10,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-13 22:25:10,123 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-12-13 22:25:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:10,188 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-12-13 22:25:10,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2022-12-13 22:25:10,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:10,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2022-12-13 22:25:10,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-12-13 22:25:10,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-12-13 22:25:10,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-12-13 22:25:10,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:10,189 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-12-13 22:25:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-12-13 22:25:10,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-12-13 22:25:10,190 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-12-13 22:25:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-12-13 22:25:10,191 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-12-13 22:25:10,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 22:25:10,192 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-12-13 22:25:10,192 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 22:25:10,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2022-12-13 22:25:10,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:10,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:10,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:10,193 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:10,193 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:10,193 INFO L748 eck$LassoCheckResult]: Stem: 1074#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1075#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; 1073#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; 1068#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; 1079#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1080#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); 1090#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; 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); 1089#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1081#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1082#L370-4 main_~j~0#1 := 0; 1072#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); 1088#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; 1087#L378-2 [2022-12-13 22:25:10,193 INFO L750 eck$LassoCheckResult]: Loop: 1087#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); 1086#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; 1087#L378-2 [2022-12-13 22:25:10,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:10,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222883, now seen corresponding path program 1 times [2022-12-13 22:25:10,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:10,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845271943] [2022-12-13 22:25:10,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:10,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:10,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2022-12-13 22:25:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:10,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418564227] [2022-12-13 22:25:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:10,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:10,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:10,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash -761053530, now seen corresponding path program 1 times [2022-12-13 22:25:10,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:10,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17505993] [2022-12-13 22:25:10,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:10,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:10,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17505993] [2022-12-13 22:25:10,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17505993] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:10,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678651601] [2022-12-13 22:25:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:10,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:10,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:10,406 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:10,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 22:25:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:10,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 22:25:10,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:10,501 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-12-13 22:25:10,563 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-12-13 22:25:10,572 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-12-13 22:25:10,648 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-12-13 22:25:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:10,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:10,744 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-12-13 22:25:10,746 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-12-13 22:25:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:10,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678651601] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:10,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:10,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2022-12-13 22:25:10,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662369403] [2022-12-13 22:25:10,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:10,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:10,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 22:25:10,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-12-13 22:25:10,790 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-12-13 22:25:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:11,039 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2022-12-13 22:25:11,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 100 transitions. [2022-12-13 22:25:11,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-12-13 22:25:11,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 100 transitions. [2022-12-13 22:25:11,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-12-13 22:25:11,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-12-13 22:25:11,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 100 transitions. [2022-12-13 22:25:11,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:11,042 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 100 transitions. [2022-12-13 22:25:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 100 transitions. [2022-12-13 22:25:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 41. [2022-12-13 22:25:11,045 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-12-13 22:25:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2022-12-13 22:25:11,045 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 58 transitions. [2022-12-13 22:25:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 22:25:11,046 INFO L428 stractBuchiCegarLoop]: Abstraction has 41 states and 58 transitions. [2022-12-13 22:25:11,046 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 22:25:11,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 58 transitions. [2022-12-13 22:25:11,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:11,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:11,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:11,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:11,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:11,048 INFO L748 eck$LassoCheckResult]: Stem: 1339#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1340#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); 1333#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; 1334#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1335#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; 1348#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1349#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); 1336#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; 1337#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-12-13 22:25:11,048 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-12-13 22:25:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash -761053528, now seen corresponding path program 2 times [2022-12-13 22:25:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:11,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873343249] [2022-12-13 22:25:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:11,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:11,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:11,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2022-12-13 22:25:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:11,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323695456] [2022-12-13 22:25:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:11,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:11,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:11,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1227998741, now seen corresponding path program 2 times [2022-12-13 22:25:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:11,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306663331] [2022-12-13 22:25:11,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:11,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:11,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306663331] [2022-12-13 22:25:11,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306663331] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:11,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266843644] [2022-12-13 22:25:11,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 22:25:11,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:11,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:11,263 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:11,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 22:25:11,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 22:25:11,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:25:11,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 22:25:11,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:11,361 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-12-13 22:25:11,449 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-12-13 22:25:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:11,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:11,523 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-12-13 22:25:11,526 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 28 treesize of output 24 [2022-12-13 22:25:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:11,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266843644] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:11,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:11,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-12-13 22:25:11,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568946628] [2022-12-13 22:25:11,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:11,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:11,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 22:25:11,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-12-13 22:25:11,579 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-12-13 22:25:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:11,789 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-12-13 22:25:11,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 68 transitions. [2022-12-13 22:25:11,790 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 22:25:11,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 68 transitions. [2022-12-13 22:25:11,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-12-13 22:25:11,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-12-13 22:25:11,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2022-12-13 22:25:11,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:11,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-12-13 22:25:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2022-12-13 22:25:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-12-13 22:25:11,794 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-12-13 22:25:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2022-12-13 22:25:11,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-12-13 22:25:11,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 22:25:11,795 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-12-13 22:25:11,795 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-12-13 22:25:11,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 61 transitions. [2022-12-13 22:25:11,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 22:25:11,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:11,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:11,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:11,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:11,797 INFO L748 eck$LassoCheckResult]: Stem: 1597#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1598#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); 1591#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; 1592#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1593#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); 1594#L370-4 main_~j~0#1 := 0; 1595#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-12-13 22:25:11,797 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-12-13 22:25:11,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:11,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1570400154, now seen corresponding path program 4 times [2022-12-13 22:25:11,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:11,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414959059] [2022-12-13 22:25:11,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:11,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:11,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:11,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:11,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2022-12-13 22:25:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:11,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266787970] [2022-12-13 22:25:11,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:11,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:11,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:11,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:11,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025751, now seen corresponding path program 4 times [2022-12-13 22:25:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:11,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489410392] [2022-12-13 22:25:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:11,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:11,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489410392] [2022-12-13 22:25:11,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489410392] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:11,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209029434] [2022-12-13 22:25:11,966 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 22:25:11,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:11,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:11,967 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:11,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 22:25:12,008 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 22:25:12,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:25:12,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 22:25:12,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:12,026 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-12-13 22:25:12,112 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-12-13 22:25:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:12,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:12,157 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-12-13 22:25:12,160 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-12-13 22:25:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:12,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209029434] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:12,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:12,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-12-13 22:25:12,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548014252] [2022-12-13 22:25:12,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:12,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:12,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 22:25:12,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-12-13 22:25:12,220 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-12-13 22:25:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:12,321 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-12-13 22:25:12,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2022-12-13 22:25:12,322 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-12-13 22:25:12,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2022-12-13 22:25:12,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-12-13 22:25:12,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-12-13 22:25:12,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2022-12-13 22:25:12,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:12,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-12-13 22:25:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2022-12-13 22:25:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2022-12-13 22:25:12,328 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-12-13 22:25:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2022-12-13 22:25:12,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 83 transitions. [2022-12-13 22:25:12,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 22:25:12,329 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 83 transitions. [2022-12-13 22:25:12,329 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-12-13 22:25:12,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 83 transitions. [2022-12-13 22:25:12,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 22:25:12,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:12,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:12,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:12,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:12,330 INFO L748 eck$LassoCheckResult]: Stem: 1863#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1864#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); 1857#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; 1858#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1859#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; 1876#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1877#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); 1875#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); 1862#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; 1861#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-12-13 22:25:12,330 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-12-13 22:25:12,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:12,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1227998739, now seen corresponding path program 3 times [2022-12-13 22:25:12,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:12,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014516979] [2022-12-13 22:25:12,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:12,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:12,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:12,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:12,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2022-12-13 22:25:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:12,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615705284] [2022-12-13 22:25:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:12,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:12,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:12,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:12,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1009219568, now seen corresponding path program 3 times [2022-12-13 22:25:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:12,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210455012] [2022-12-13 22:25:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:12,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:12,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210455012] [2022-12-13 22:25:12,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210455012] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:12,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450857693] [2022-12-13 22:25:12,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 22:25:12,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:12,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:12,428 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:12,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 22:25:12,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 22:25:12,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:25:12,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 22:25:12,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:12,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:12,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450857693] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:12,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:12,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-13 22:25:12,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070738910] [2022-12-13 22:25:12,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:12,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:12,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 22:25:12,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-12-13 22:25:12,628 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-12-13 22:25:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:12,708 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2022-12-13 22:25:12,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 90 transitions. [2022-12-13 22:25:12,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 22:25:12,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 59 states and 81 transitions. [2022-12-13 22:25:12,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-12-13 22:25:12,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-12-13 22:25:12,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 81 transitions. [2022-12-13 22:25:12,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:12,709 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-12-13 22:25:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 81 transitions. [2022-12-13 22:25:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-12-13 22:25:12,711 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-12-13 22:25:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2022-12-13 22:25:12,711 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-12-13 22:25:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 22:25:12,712 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-12-13 22:25:12,712 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-12-13 22:25:12,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 81 transitions. [2022-12-13 22:25:12,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 22:25:12,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:12,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:12,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:12,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:12,713 INFO L748 eck$LassoCheckResult]: Stem: 2160#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2161#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); 2153#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; 2154#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2155#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); 2188#L370-4 main_~j~0#1 := 0; 2159#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); 2181#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; 2171#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); 2175#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; 2174#L378-2 [2022-12-13 22:25:12,713 INFO L750 eck$LassoCheckResult]: Loop: 2174#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); 2173#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; 2174#L378-2 [2022-12-13 22:25:12,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash 775133344, now seen corresponding path program 4 times [2022-12-13 22:25:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:12,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238940790] [2022-12-13 22:25:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:12,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:12,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:12,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2022-12-13 22:25:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:12,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635893164] [2022-12-13 22:25:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:12,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:12,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:12,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:12,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1873802723, now seen corresponding path program 4 times [2022-12-13 22:25:12,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:12,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707020654] [2022-12-13 22:25:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:12,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:12,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:12,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707020654] [2022-12-13 22:25:12,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707020654] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:12,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321039251] [2022-12-13 22:25:12,924 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 22:25:12,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:12,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:12,925 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:12,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 22:25:12,983 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 22:25:12,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:25:12,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 22:25:12,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:13,006 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-12-13 22:25:13,062 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-13 22:25:13,062 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-12-13 22:25:13,079 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-13 22:25:13,080 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-12-13 22:25:13,207 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-13 22:25:13,208 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-12-13 22:25:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:13,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:14,208 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 25 treesize of output 23 [2022-12-13 22:25:14,211 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 66 treesize of output 62 [2022-12-13 22:25:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:14,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321039251] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:14,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:14,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-12-13 22:25:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911161567] [2022-12-13 22:25:14,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 22:25:14,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-12-13 22:25:14,282 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-12-13 22:25:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:14,555 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2022-12-13 22:25:14,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 120 transitions. [2022-12-13 22:25:14,556 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-12-13 22:25:14,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 120 transitions. [2022-12-13 22:25:14,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-12-13 22:25:14,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-12-13 22:25:14,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 120 transitions. [2022-12-13 22:25:14,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:14,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 120 transitions. [2022-12-13 22:25:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 120 transitions. [2022-12-13 22:25:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2022-12-13 22:25:14,560 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-12-13 22:25:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2022-12-13 22:25:14,560 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-12-13 22:25:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 22:25:14,561 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-12-13 22:25:14,561 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-12-13 22:25:14,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 81 transitions. [2022-12-13 22:25:14,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 22:25:14,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:14,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:14,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:14,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:14,563 INFO L748 eck$LassoCheckResult]: Stem: 2493#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2494#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); 2486#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; 2487#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2488#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; 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; 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); 2506#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2501#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2502#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); 2510#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2511#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; 2503#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2504#L370-4 main_~j~0#1 := 0; 2490#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-12-13 22:25:14,563 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-12-13 22:25:14,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1476197922, now seen corresponding path program 5 times [2022-12-13 22:25:14,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:14,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432641754] [2022-12-13 22:25:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:14,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:14,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:14,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 13 times [2022-12-13 22:25:14,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:14,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131099595] [2022-12-13 22:25:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:14,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:14,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:14,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996709, now seen corresponding path program 5 times [2022-12-13 22:25:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:14,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473003457] [2022-12-13 22:25:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:14,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:14,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:14,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473003457] [2022-12-13 22:25:14,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473003457] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:14,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38947698] [2022-12-13 22:25:14,818 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 22:25:14,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:14,819 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:14,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 22:25:14,885 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-12-13 22:25:14,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:25:14,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 22:25:14,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:14,950 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-12-13 22:25:15,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:25:15,012 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-12-13 22:25:15,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:25:15,023 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-12-13 22:25:15,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 22:25:15,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:25:15,170 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-12-13 22:25:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:15,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:15,299 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-12-13 22:25:15,301 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-12-13 22:25:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:15,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38947698] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:15,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:15,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 28 [2022-12-13 22:25:15,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172998862] [2022-12-13 22:25:15,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:15,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:15,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 22:25:15,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-12-13 22:25:15,351 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-12-13 22:25:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:15,600 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-12-13 22:25:15,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2022-12-13 22:25:15,601 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-12-13 22:25:15,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 96 transitions. [2022-12-13 22:25:15,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-12-13 22:25:15,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-12-13 22:25:15,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 96 transitions. [2022-12-13 22:25:15,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:15,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 96 transitions. [2022-12-13 22:25:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 96 transitions. [2022-12-13 22:25:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2022-12-13 22:25:15,603 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-12-13 22:25:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2022-12-13 22:25:15,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 66 transitions. [2022-12-13 22:25:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 22:25:15,604 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2022-12-13 22:25:15,604 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-12-13 22:25:15,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 66 transitions. [2022-12-13 22:25:15,605 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 22:25:15,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:15,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:15,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:15,605 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:15,605 INFO L748 eck$LassoCheckResult]: Stem: 2814#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2815#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); 2807#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; 2808#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2809#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; 2828#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); 2830#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2826#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2827#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); 2833#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); 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; 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); 2810#L370-4 main_~j~0#1 := 0; 2811#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); 2812#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; 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); 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-12-13 22:25:15,605 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-12-13 22:25:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:15,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1480775715, now seen corresponding path program 6 times [2022-12-13 22:25:15,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:15,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435220013] [2022-12-13 22:25:15,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:15,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:15,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:15,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:15,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 14 times [2022-12-13 22:25:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:15,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919079452] [2022-12-13 22:25:15,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:15,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:15,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:15,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:15,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:15,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1391288486, now seen corresponding path program 6 times [2022-12-13 22:25:15,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:15,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205417498] [2022-12-13 22:25:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:15,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:15,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205417498] [2022-12-13 22:25:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205417498] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:15,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443184399] [2022-12-13 22:25:15,820 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 22:25:15,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:15,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:15,821 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:15,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 22:25:15,889 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-12-13 22:25:15,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:25:15,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 22:25:15,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:15,945 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-12-13 22:25:16,199 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 22:25:16,199 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-12-13 22:25:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:16,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:16,521 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 20 treesize of output 18 [2022-12-13 22:25:16,530 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 34 treesize of output 28 [2022-12-13 22:25:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:16,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443184399] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:16,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:16,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2022-12-13 22:25:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894862272] [2022-12-13 22:25:16,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:16,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:16,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 22:25:16,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 22:25:16,605 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-12-13 22:25:18,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:18,290 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-12-13 22:25:18,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2022-12-13 22:25:18,290 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-12-13 22:25:18,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 76 transitions. [2022-12-13 22:25:18,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-12-13 22:25:18,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-12-13 22:25:18,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 76 transitions. [2022-12-13 22:25:18,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:18,291 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-12-13 22:25:18,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 76 transitions. [2022-12-13 22:25:18,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2022-12-13 22:25:18,292 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-12-13 22:25:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2022-12-13 22:25:18,292 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 59 transitions. [2022-12-13 22:25:18,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 22:25:18,293 INFO L428 stractBuchiCegarLoop]: Abstraction has 43 states and 59 transitions. [2022-12-13 22:25:18,293 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-12-13 22:25:18,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 59 transitions. [2022-12-13 22:25:18,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 22:25:18,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:18,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:18,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:18,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:18,294 INFO L748 eck$LassoCheckResult]: Stem: 3165#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3166#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); 3159#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; 3160#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3161#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; 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; 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); 3179#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3174#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);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); 3183#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); 3184#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; 3176#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3162#L370-4 main_~j~0#1 := 0; 3163#L378-2 [2022-12-13 22:25:18,294 INFO L750 eck$LassoCheckResult]: Loop: 3163#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); 3164#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; 3163#L378-2 [2022-12-13 22:25:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1824010476, now seen corresponding path program 2 times [2022-12-13 22:25:18,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:18,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751600264] [2022-12-13 22:25:18,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:18,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:18,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:18,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:18,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2022-12-13 22:25:18,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:18,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092404212] [2022-12-13 22:25:18,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:18,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:18,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:18,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:18,310 INFO L85 PathProgramCache]: Analyzing trace with hash -527409319, now seen corresponding path program 7 times [2022-12-13 22:25:18,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:18,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299218965] [2022-12-13 22:25:18,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:18,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:18,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:18,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:19,046 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 22:25:19,047 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 22:25:19,047 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 22:25:19,047 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 22:25:19,047 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 22:25:19,047 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,047 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 22:25:19,047 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 22:25:19,047 INFO L133 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration16_Lasso [2022-12-13 22:25:19,047 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 22:25:19,047 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 22:25:19,050 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:19,052 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:19,053 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:19,054 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:19,221 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:19,222 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:19,223 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:19,224 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:19,225 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:19,226 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:19,227 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:19,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 22:25:19,399 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 22:25:19,399 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 22:25:19,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:19,400 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:19,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-12-13 22:25:19,402 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-12-13 22:25:19,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:19,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:19,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:19,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:19,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:19,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:19,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:19,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:19,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:19,420 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:19,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-12-13 22:25:19,422 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-12-13 22:25:19,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:19,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 22:25:19,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:19,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:19,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:19,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 22:25:19,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 22:25:19,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:19,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:19,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:19,439 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:19,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-12-13 22:25:19,441 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-12-13 22:25:19,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:19,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:19,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:19,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:19,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:19,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:19,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:19,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:19,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:19,462 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:19,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-12-13 22:25:19,465 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-12-13 22:25:19,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:19,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:19,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:19,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:19,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:19,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:19,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:19,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:19,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:19,484 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:19,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-12-13 22:25:19,486 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-12-13 22:25:19,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:19,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:19,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:19,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:19,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:19,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:19,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:19,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:19,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:19,509 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:19,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-12-13 22:25:19,511 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-12-13 22:25:19,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:19,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:19,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:19,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:19,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:19,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:19,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:19,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-12-13 22:25:19,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:19,531 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:19,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-12-13 22:25:19,533 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-12-13 22:25:19,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:19,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:19,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:19,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:19,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:19,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:19,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:19,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-12-13 22:25:19,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:19,554 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:19,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-12-13 22:25:19,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-12-13 22:25:19,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:19,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:19,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:19,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:19,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:19,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:19,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:19,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:19,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:19,577 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:19,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-12-13 22:25:19,579 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-12-13 22:25:19,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:19,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:19,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:19,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:19,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:19,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:19,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:19,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-12-13 22:25:19,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:19,598 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:19,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-12-13 22:25:19,600 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-12-13 22:25:19,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:19,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:19,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:19,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:19,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:19,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:19,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 22:25:19,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-12-13 22:25:19,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:19,620 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:19,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-12-13 22:25:19,622 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-12-13 22:25:19,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 22:25:19,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 22:25:19,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 22:25:19,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 22:25:19,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 22:25:19,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 22:25:19,650 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 22:25:19,670 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-12-13 22:25:19,670 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-12-13 22:25:19,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 22:25:19,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:19,671 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 22:25:19,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-12-13 22:25:19,673 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 22:25:19,683 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 22:25:19,684 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 22:25:19,684 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-12-13 22:25:19,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:19,702 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-12-13 22:25:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:19,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 22:25:19,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:19,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 22:25:19,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:19,757 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-12-13 22:25:19,758 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-12-13 22:25:19,768 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-12-13 22:25:19,769 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-12-13 22:25:19,769 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-12-13 22:25:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-12-13 22:25:19,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 2 letters. [2022-12-13 22:25:19,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 22:25:19,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 21 letters. Loop has 2 letters. [2022-12-13 22:25:19,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 22:25:19,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2022-12-13 22:25:19,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 22:25:19,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2022-12-13 22:25:19,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 22:25:19,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 44 states and 56 transitions. [2022-12-13 22:25:19,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-12-13 22:25:19,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-12-13 22:25:19,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 56 transitions. [2022-12-13 22:25:19,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:19,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-12-13 22:25:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 56 transitions. [2022-12-13 22:25:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-13 22:25:19,772 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-12-13 22:25:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-12-13 22:25:19,772 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-12-13 22:25:19,772 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-12-13 22:25:19,772 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-12-13 22:25:19,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2022-12-13 22:25:19,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 22:25:19,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 22:25:19,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 22:25:19,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:25:19,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 22:25:19,773 INFO L748 eck$LassoCheckResult]: Stem: 3371#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3372#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); 3364#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; 3365#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3366#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); 3367#L370-4 main_~j~0#1 := 0; 3368#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-12-13 22:25:19,773 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-12-13 22:25:19,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash 134458908, now seen corresponding path program 7 times [2022-12-13 22:25:19,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:19,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561978697] [2022-12-13 22:25:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:19,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-12-13 22:25:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:25:20,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:25:20,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561978697] [2022-12-13 22:25:20,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561978697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:25:20,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729782281] [2022-12-13 22:25:20,161 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 22:25:20,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:25:20,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:25:20,163 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:25:20,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-13 22:25:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:25:20,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 22:25:20,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:25:20,299 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-12-13 22:25:20,365 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-12-13 22:25:20,375 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-12-13 22:25:20,410 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-12-13 22:25:20,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:25:20,450 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-12-13 22:25:20,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:25:20,487 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-12-13 22:25:20,566 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-12-13 22:25:20,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-12-13 22:25:20,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:20,780 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-12-13 22:25:20,783 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-12-13 22:25:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 22:25:20,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729782281] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:20,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:20,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 28 [2022-12-13 22:25:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311090173] [2022-12-13 22:25:20,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:20,795 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 22:25:20,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:25:20,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 15 times [2022-12-13 22:25:20,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:25:20,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389233352] [2022-12-13 22:25:20,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:25:20,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:25:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:20,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:25:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:25:20,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:25:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 22:25:20,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-12-13 22:25:20,836 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-12-13 22:25:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:25:21,061 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-12-13 22:25:21,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2022-12-13 22:25:21,062 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 22:25:21,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2022-12-13 22:25:21,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-12-13 22:25:21,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-12-13 22:25:21,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-12-13 22:25:21,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:25:21,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 22:25:21,062 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 22:25:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 22:25:21,063 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 22:25:21,063 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-12-13 22:25:21,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-12-13 22:25:21,063 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 22:25:21,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-12-13 22:25:21,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 10:25:21 BoogieIcfgContainer [2022-12-13 22:25:21,068 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 22:25:21,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:25:21,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:25:21,069 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:25:21,069 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:25:05" (3/4) ... [2022-12-13 22:25:21,071 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 22:25:21,071 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:25:21,071 INFO L158 Benchmark]: Toolchain (without parser) took 15883.24ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 79.3MB in the beginning and 117.6MB in the end (delta: -38.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 22:25:21,071 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:25:21,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.19ms. Allocated memory is still 113.2MB. Free memory was 79.0MB in the beginning and 61.8MB in the end (delta: 17.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 22:25:21,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.42ms. Allocated memory is still 113.2MB. Free memory was 61.8MB in the beginning and 60.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:25:21,072 INFO L158 Benchmark]: Boogie Preprocessor took 18.85ms. Allocated memory is still 113.2MB. Free memory was 60.2MB in the beginning and 58.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:25:21,072 INFO L158 Benchmark]: RCFGBuilder took 238.26ms. Allocated memory is still 113.2MB. Free memory was 58.7MB in the beginning and 48.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 22:25:21,072 INFO L158 Benchmark]: BuchiAutomizer took 15316.28ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 48.2MB in the beginning and 117.6MB in the end (delta: -69.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:25:21,072 INFO L158 Benchmark]: Witness Printer took 2.28ms. Allocated memory is still 163.6MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:25:21,074 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.19ms. Allocated memory is still 113.2MB. Free memory was 79.0MB in the beginning and 61.8MB in the end (delta: 17.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.42ms. Allocated memory is still 113.2MB. Free memory was 61.8MB in the beginning and 60.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.85ms. Allocated memory is still 113.2MB. Free memory was 60.2MB in the beginning and 58.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 238.26ms. Allocated memory is still 113.2MB. Free memory was 58.7MB in the beginning and 48.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 15316.28ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 48.2MB in the beginning and 117.6MB in the end (delta: -69.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.28ms. Allocated memory is still 163.6MB. Free memory is still 117.6MB. 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 15.2s and 18 iterations. TraceHistogramMax:6. Analysis of lassos took 11.2s. Construction of modules took 1.9s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 17. Minimization of nondet autom 0. Automata minimization 0.0s 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: 1 mSolverCounterUnknown, 676 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 674 mSDsluCounter, 957 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 797 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2903 IncrementalHoareTripleChecker+Invalid, 3106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 160 mSDtfsCounter, 2903 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 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: 20ms 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-12-13 22:25:21,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-13 22:25:21,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 22:25:21,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:21,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 22:25:21,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 22:25:22,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:22,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 22:25:22,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 22:25:22,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 22:25:22,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 22:25:23,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:23,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 22:25:23,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 22:25:23,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 22:25:23,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3940243c-48ab-4a45-998b-2fb62d167f61/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE