./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array12_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 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-38b53e6 [2022-11-25 17:58:55,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:58:55,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:58:55,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:58:55,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:58:55,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:58:55,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:58:55,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:58:55,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:58:55,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:58:55,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:58:55,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:58:55,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:58:55,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:58:55,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:58:55,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:58:55,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:58:55,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:58:55,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:58:55,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:58:55,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:58:55,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:58:55,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:58:55,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:58:55,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:58:55,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:58:55,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:58:55,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:58:55,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:58:55,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:58:55,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:58:55,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:58:55,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:58:55,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:58:55,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:58:55,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:58:55,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:58:55,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:58:55,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:58:55,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:58:55,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:58:55,154 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-25 17:58:55,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:58:55,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:58:55,201 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:58:55,201 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:58:55,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:58:55,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:58:55,203 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:58:55,203 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-25 17:58:55,203 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-25 17:58:55,204 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-25 17:58:55,205 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-25 17:58:55,205 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-25 17:58:55,205 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-25 17:58:55,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:58:55,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:58:55,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:58:55,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:58:55,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-25 17:58:55,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-25 17:58:55,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-25 17:58:55,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:58:55,208 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-25 17:58:55,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:58:55,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-25 17:58:55,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:58:55,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:58:55,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:58:55,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:58:55,212 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-25 17:58:55,212 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_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 [2022-11-25 17:58:55,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:58:55,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:58:55,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:58:55,587 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:58:55,588 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:58:55,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/termination-15/array12_alloca.i [2022-11-25 17:58:58,567 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:58:58,830 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:58:58,830 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/sv-benchmarks/c/termination-15/array12_alloca.i [2022-11-25 17:58:58,841 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/data/1bd609518/28c103a355cf47348169b70796a33050/FLAGa8c40e849 [2022-11-25 17:58:58,868 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/data/1bd609518/28c103a355cf47348169b70796a33050 [2022-11-25 17:58:58,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:58:58,872 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:58:58,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:58:58,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:58:58,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:58:58,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:58" (1/1) ... [2022-11-25 17:58:58,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ba8ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:58, skipping insertion in model container [2022-11-25 17:58:58,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:58" (1/1) ... [2022-11-25 17:58:58,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:58:58,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:58:59,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:58:59,310 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:58:59,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:58:59,412 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:58:59,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59 WrapperNode [2022-11-25 17:58:59,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:58:59,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:58:59,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:58:59,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:58:59,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59" (1/1) ... [2022-11-25 17:58:59,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59" (1/1) ... [2022-11-25 17:58:59,466 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-11-25 17:58:59,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:58:59,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:58:59,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:58:59,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:58:59,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59" (1/1) ... [2022-11-25 17:58:59,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59" (1/1) ... [2022-11-25 17:58:59,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59" (1/1) ... [2022-11-25 17:58:59,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59" (1/1) ... [2022-11-25 17:58:59,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59" (1/1) ... [2022-11-25 17:58:59,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59" (1/1) ... [2022-11-25 17:58:59,513 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59" (1/1) ... [2022-11-25 17:58:59,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59" (1/1) ... [2022-11-25 17:58:59,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:58:59,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:58:59,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:58:59,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:58:59,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59" (1/1) ... [2022-11-25 17:58:59,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:58:59,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:58:59,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:58:59,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-25 17:58:59,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:58:59,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:58:59,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:58:59,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:58:59,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:58:59,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:58:59,693 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:58:59,696 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:58:59,882 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:58:59,888 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:58:59,888 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 17:58:59,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:59 BoogieIcfgContainer [2022-11-25 17:58:59,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:58:59,906 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-25 17:58:59,906 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-25 17:58:59,910 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-25 17:58:59,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 17:58:59,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 05:58:58" (1/3) ... [2022-11-25 17:58:59,912 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a1c95a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 05:58:59, skipping insertion in model container [2022-11-25 17:58:59,912 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 17:58:59,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:59" (2/3) ... [2022-11-25 17:58:59,913 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a1c95a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 05:58:59, skipping insertion in model container [2022-11-25 17:58:59,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 17:58:59,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:59" (3/3) ... [2022-11-25 17:58:59,914 INFO L332 chiAutomizerObserver]: Analyzing ICFG array12_alloca.i [2022-11-25 17:59:00,025 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-25 17:59:00,026 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-25 17:59:00,026 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-25 17:59:00,026 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-25 17:59:00,026 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-25 17:59:00,026 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-25 17:59:00,027 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-25 17:59:00,027 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-25 17:59:00,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:00,079 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-11-25 17:59:00,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:00,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:00,087 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-25 17:59:00,087 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 17:59:00,087 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-25 17:59:00,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:00,089 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-11-25 17:59:00,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:00,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:00,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-25 17:59:00,090 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 17:59:00,097 INFO L748 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 10#L367true assume !(main_~length~0#1 < 1); 7#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 4#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 5#L370-3true [2022-11-25 17:59:00,098 INFO L750 eck$LassoCheckResult]: Loop: 5#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L372true assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 5#L370-3true [2022-11-25 17:59:00,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-11-25 17:59:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:00,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485327334] [2022-11-25 17:59:00,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:00,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:00,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:00,313 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2022-11-25 17:59:00,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:00,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852699140] [2022-11-25 17:59:00,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:00,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:00,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:00,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:00,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:00,369 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2022-11-25 17:59:00,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:00,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674948015] [2022-11-25 17:59:00,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:00,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:00,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:00,769 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 17:59:00,769 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 17:59:00,770 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 17:59:00,770 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 17:59:00,770 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 17:59:00,770 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:00,770 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 17:59:00,771 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 17:59:00,771 INFO L133 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration1_Lasso [2022-11-25 17:59:00,771 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 17:59:00,771 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 17:59:00,789 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:00,800 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:00,804 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:00,808 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:00,811 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:00,814 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:00,981 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:00,984 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:00,988 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:00,991 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:00,994 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:00,999 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:01,356 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 17:59:01,361 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 17:59:01,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:01,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:01,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:01,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:01,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:01,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:59:01,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:01,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:01,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:01,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:59:01,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:59:01,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-25 17:59:01,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:01,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:01,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:01,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:01,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:01,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:01,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:01,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:01,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:01,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:01,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:01,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:01,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-25 17:59:01,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:01,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:01,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:01,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:01,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:01,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-25 17:59:01,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-11-25 17:59:01,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:01,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:59:01,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:01,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:01,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:01,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:59:01,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:59:01,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:01,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:01,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:01,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:01,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:01,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-25 17:59:01,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:01,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:01,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:59:01,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:01,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:01,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:01,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:59:01,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:59:01,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:01,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-11-25 17:59:01,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:01,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:01,550 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:01,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-25 17:59:01,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:01,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:01,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:59:01,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:01,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:01,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:01,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:59:01,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:59:01,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:01,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:01,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:01,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:01,592 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:01,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-25 17:59:01,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:01,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:01,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:59:01,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:01,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:01,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:01,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:59:01,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:59:01,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:01,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:01,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:01,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:01,622 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:01,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-25 17:59:01,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:01,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:01,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:01,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:01,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:01,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:01,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:01,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:01,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:01,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:01,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:01,658 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:01,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-25 17:59:01,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:01,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:01,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:01,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:01,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:01,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:01,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:01,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:01,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:01,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:01,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:01,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:01,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:01,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:01,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:01,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:01,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:01,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-25 17:59:01,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:01,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:01,763 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 17:59:01,812 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-11-25 17:59:01,812 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-11-25 17:59:01,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:01,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:01,874 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:01,943 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 17:59:01,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-25 17:59:01,972 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-25 17:59:01,972 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 17:59:01,973 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~arr~0#1.offset) = -4*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 1*ULTIMATE.start_main_~arr~0#1.offset Supporting invariants [] [2022-11-25 17:59:01,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:02,007 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-11-25 17:59:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:02,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:59:02,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:02,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:59:02,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:02,204 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-25 17:59:02,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:02,258 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 50 transitions. Complement of second has 7 states. [2022-11-25 17:59:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-25 17:59:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-11-25 17:59:02,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2022-11-25 17:59:02,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:59:02,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2022-11-25 17:59:02,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:59:02,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2022-11-25 17:59:02,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:59:02,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2022-11-25 17:59:02,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:02,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2022-11-25 17:59:02,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-11-25 17:59:02,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-11-25 17:59:02,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-11-25 17:59:02,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:02,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-11-25 17:59:02,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-11-25 17:59:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-25 17:59:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-11-25 17:59:02,303 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-11-25 17:59:02,303 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-11-25 17:59:02,303 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-25 17:59:02,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-11-25 17:59:02,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:02,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:02,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:02,305 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:02,305 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:02,305 INFO L748 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 120#L367 assume !(main_~length~0#1 < 1); 114#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 115#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 116#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 117#L370-4 main_~j~0#1 := 0; 118#L378-2 [2022-11-25 17:59:02,305 INFO L750 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 119#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 118#L378-2 [2022-11-25 17:59:02,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:02,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2022-11-25 17:59:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:02,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086294724] [2022-11-25 17:59:02,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:02,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:02,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:02,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086294724] [2022-11-25 17:59:02,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086294724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:59:02,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:59:02,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:59:02,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206903673] [2022-11-25 17:59:02,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:59:02,389 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:59:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:02,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2022-11-25 17:59:02,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:02,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793210104] [2022-11-25 17:59:02,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:02,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:02,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:02,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:02,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:02,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:59:02,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:59:02,465 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:02,506 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-11-25 17:59:02,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-11-25 17:59:02,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:02,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2022-11-25 17:59:02,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-11-25 17:59:02,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-11-25 17:59:02,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-11-25 17:59:02,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:02,514 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-11-25 17:59:02,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-11-25 17:59:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-11-25 17:59:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-25 17:59:02,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-25 17:59:02,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:59:02,518 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-25 17:59:02,519 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-25 17:59:02,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-11-25 17:59:02,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:02,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:02,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:02,522 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:02,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:02,523 INFO L748 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 146#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 153#L367 assume !(main_~length~0#1 < 1); 147#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 148#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 149#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 154#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 156#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 155#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 150#L370-4 main_~j~0#1 := 0; 151#L378-2 [2022-11-25 17:59:02,523 INFO L750 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 152#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 151#L378-2 [2022-11-25 17:59:02,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2022-11-25 17:59:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:02,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581899161] [2022-11-25 17:59:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:02,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:02,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:02,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2022-11-25 17:59:02,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:02,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953495576] [2022-11-25 17:59:02,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:02,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:02,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:02,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2022-11-25 17:59:02,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:02,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170935259] [2022-11-25 17:59:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:02,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:02,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170935259] [2022-11-25 17:59:02,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170935259] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:02,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058537850] [2022-11-25 17:59:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:02,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:02,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:02,991 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:03,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:59:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:03,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 17:59:03,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:03,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:03,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:59:03,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:59:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:03,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:03,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-25 17:59:03,338 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-11-25 17:59:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:03,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058537850] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:03,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:03,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-11-25 17:59:03,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4404056] [2022-11-25 17:59:03,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:03,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:03,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 17:59:03,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:59:03,409 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:03,556 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-11-25 17:59:03,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2022-11-25 17:59:03,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-25 17:59:03,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2022-11-25 17:59:03,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-25 17:59:03,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-25 17:59:03,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-11-25 17:59:03,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:03,558 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-11-25 17:59:03,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-11-25 17:59:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-11-25 17:59:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-11-25 17:59:03,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-11-25 17:59:03,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:59:03,562 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-11-25 17:59:03,562 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-25 17:59:03,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-11-25 17:59:03,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:03,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:03,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:03,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:03,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:03,565 INFO L748 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 277#L367 assume !(main_~length~0#1 < 1); 271#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 272#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 273#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 278#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 283#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 279#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 280#L370-4 main_~j~0#1 := 0; 284#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 274#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 275#L378-2 [2022-11-25 17:59:03,565 INFO L750 eck$LassoCheckResult]: Loop: 275#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 282#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 275#L378-2 [2022-11-25 17:59:03,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:03,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2022-11-25 17:59:03,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:03,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184289310] [2022-11-25 17:59:03,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:03,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:03,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:03,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:03,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:03,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2022-11-25 17:59:03,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:03,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338342018] [2022-11-25 17:59:03,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:03,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:03,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:03,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:03,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:03,600 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2022-11-25 17:59:03,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:03,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928839725] [2022-11-25 17:59:03,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:03,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:03,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:03,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928839725] [2022-11-25 17:59:03,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928839725] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:03,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107041169] [2022-11-25 17:59:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:03,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:03,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:03,743 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:03,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 17:59:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:03,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:59:03,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:03,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:03,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107041169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:03,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:03,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-25 17:59:03,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612303933] [2022-11-25 17:59:03,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:03,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:03,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:59:03,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:59:03,950 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:04,077 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-11-25 17:59:04,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2022-11-25 17:59:04,079 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-25 17:59:04,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 51 transitions. [2022-11-25 17:59:04,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-11-25 17:59:04,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-25 17:59:04,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2022-11-25 17:59:04,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:04,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-11-25 17:59:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2022-11-25 17:59:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-11-25 17:59:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-11-25 17:59:04,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-11-25 17:59:04,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:59:04,086 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-11-25 17:59:04,086 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-25 17:59:04,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2022-11-25 17:59:04,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-25 17:59:04,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:04,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:04,088 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:04,088 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:04,088 INFO L748 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 444#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 445#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 461#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 460#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 457#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 455#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 456#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 458#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 452#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 453#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 440#L370-4 main_~j~0#1 := 0; 441#L378-2 [2022-11-25 17:59:04,089 INFO L750 eck$LassoCheckResult]: Loop: 441#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 451#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 441#L378-2 [2022-11-25 17:59:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:04,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2022-11-25 17:59:04,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:04,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043955246] [2022-11-25 17:59:04,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:04,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:04,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:04,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043955246] [2022-11-25 17:59:04,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043955246] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:04,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485252257] [2022-11-25 17:59:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:04,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:04,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:04,146 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:04,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 17:59:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:04,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:59:04,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:04,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:59:04,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485252257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:59:04,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:59:04,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-25 17:59:04,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186500380] [2022-11-25 17:59:04,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:59:04,272 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:59:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2022-11-25 17:59:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:04,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119441982] [2022-11-25 17:59:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:04,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:04,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:04,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:04,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:59:04,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:59:04,342 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:04,370 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-11-25 17:59:04,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2022-11-25 17:59:04,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:04,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2022-11-25 17:59:04,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-11-25 17:59:04,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-11-25 17:59:04,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-11-25 17:59:04,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:04,375 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-25 17:59:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-11-25 17:59:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-25 17:59:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-11-25 17:59:04,382 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-25 17:59:04,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:59:04,384 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-25 17:59:04,384 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-25 17:59:04,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-11-25 17:59:04,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:04,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:04,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:04,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:04,388 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:04,388 INFO L748 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 543#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 551#L367 assume !(main_~length~0#1 < 1); 544#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 545#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 546#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 552#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 555#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 553#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 554#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 561#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 558#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 557#L370-4 main_~j~0#1 := 0; 550#L378-2 [2022-11-25 17:59:04,388 INFO L750 eck$LassoCheckResult]: Loop: 550#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 556#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 550#L378-2 [2022-11-25 17:59:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2022-11-25 17:59:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:04,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609411898] [2022-11-25 17:59:04,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:04,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:04,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:04,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:04,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:04,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2022-11-25 17:59:04,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:04,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176564704] [2022-11-25 17:59:04,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:04,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:04,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:04,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:04,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2022-11-25 17:59:04,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:04,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346996016] [2022-11-25 17:59:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:04,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:04,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:04,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346996016] [2022-11-25 17:59:04,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346996016] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:04,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728561924] [2022-11-25 17:59:04,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:04,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:04,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:04,805 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:04,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 17:59:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:04,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 17:59:04,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:04,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 17:59:04,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:59:04,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 17:59:04,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:59:04,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 17:59:05,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:59:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:05,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:05,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-11-25 17:59:05,199 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-11-25 17:59:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:05,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728561924] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:05,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:05,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-11-25 17:59:05,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372917632] [2022-11-25 17:59:05,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:05,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:59:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:59:05,294 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:05,445 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-11-25 17:59:05,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2022-11-25 17:59:05,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:05,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 29 transitions. [2022-11-25 17:59:05,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-25 17:59:05,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-25 17:59:05,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2022-11-25 17:59:05,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:05,447 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-11-25 17:59:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2022-11-25 17:59:05,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2022-11-25 17:59:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-25 17:59:05,449 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-25 17:59:05,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:59:05,450 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-25 17:59:05,450 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-25 17:59:05,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2022-11-25 17:59:05,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:05,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:05,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:05,451 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:05,451 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:05,452 INFO L748 eck$LassoCheckResult]: Stem: 700#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 701#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 707#L367 assume !(main_~length~0#1 < 1); 698#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 699#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 702#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 708#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 713#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 709#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 710#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 711#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 712#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 703#L370-4 main_~j~0#1 := 0; 704#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 705#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 706#L378-2 [2022-11-25 17:59:05,452 INFO L750 eck$LassoCheckResult]: Loop: 706#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 714#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 706#L378-2 [2022-11-25 17:59:05,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:05,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2022-11-25 17:59:05,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:05,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967994782] [2022-11-25 17:59:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:05,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:05,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:05,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:05,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:05,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2022-11-25 17:59:05,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:05,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379059807] [2022-11-25 17:59:05,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:05,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:05,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:05,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:05,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:05,481 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2022-11-25 17:59:05,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:05,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277249085] [2022-11-25 17:59:05,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:05,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:05,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277249085] [2022-11-25 17:59:05,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277249085] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:05,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126604090] [2022-11-25 17:59:05,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:59:05,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:05,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:05,753 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:05,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 17:59:05,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:59:05,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:59:05,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 17:59:05,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:05,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:59:06,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:59:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:06,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:06,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-25 17:59:06,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-25 17:59:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:06,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126604090] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:06,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:06,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-11-25 17:59:06,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286128331] [2022-11-25 17:59:06,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:06,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:06,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:59:06,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:59:06,173 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:06,369 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-11-25 17:59:06,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2022-11-25 17:59:06,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-25 17:59:06,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2022-11-25 17:59:06,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-11-25 17:59:06,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-11-25 17:59:06,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-11-25 17:59:06,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:06,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-11-25 17:59:06,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-11-25 17:59:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-11-25 17:59:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-11-25 17:59:06,381 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-11-25 17:59:06,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:59:06,384 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-11-25 17:59:06,384 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-25 17:59:06,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2022-11-25 17:59:06,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:06,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:06,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:06,386 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:06,386 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:06,387 INFO L748 eck$LassoCheckResult]: Stem: 872#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 873#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 880#L367 assume !(main_~length~0#1 < 1); 874#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 875#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 876#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 881#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 889#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 882#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 883#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 884#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 886#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 887#L370-4 main_~j~0#1 := 0; 892#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 879#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 878#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 885#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 891#L378-2 [2022-11-25 17:59:06,387 INFO L750 eck$LassoCheckResult]: Loop: 891#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 890#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 891#L378-2 [2022-11-25 17:59:06,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:06,387 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2022-11-25 17:59:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:06,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869212557] [2022-11-25 17:59:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:06,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:06,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2022-11-25 17:59:06,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:06,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767660736] [2022-11-25 17:59:06,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:06,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:06,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:06,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:06,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2022-11-25 17:59:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:06,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543440650] [2022-11-25 17:59:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:06,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:06,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:06,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543440650] [2022-11-25 17:59:06,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543440650] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:06,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132645801] [2022-11-25 17:59:06,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:59:06,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:06,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:06,606 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:06,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 17:59:06,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 17:59:06,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:59:06,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:59:06,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:06,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:06,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132645801] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:06,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:06,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-25 17:59:06,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543738714] [2022-11-25 17:59:06,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:06,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:06,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:59:06,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:59:06,872 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:06,989 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-11-25 17:59:06,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2022-11-25 17:59:06,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:06,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2022-11-25 17:59:06,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-25 17:59:06,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-25 17:59:06,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-11-25 17:59:06,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:06,991 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-11-25 17:59:06,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-11-25 17:59:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-11-25 17:59:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-25 17:59:06,993 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-25 17:59:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:59:06,994 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-25 17:59:06,994 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-25 17:59:06,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2022-11-25 17:59:06,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:06,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:06,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:06,996 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:06,996 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:06,996 INFO L748 eck$LassoCheckResult]: Stem: 1068#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1069#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1075#L367 assume !(main_~length~0#1 < 1); 1066#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1067#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1070#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1076#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1091#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1090#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1079#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1080#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1077#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1078#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1088#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1086#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1085#L370-4 main_~j~0#1 := 0; 1074#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1084#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1083#L378-2 [2022-11-25 17:59:06,996 INFO L750 eck$LassoCheckResult]: Loop: 1083#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1082#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1083#L378-2 [2022-11-25 17:59:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:06,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222883, now seen corresponding path program 1 times [2022-11-25 17:59:06,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:06,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44988398] [2022-11-25 17:59:06,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:06,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:07,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:07,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:07,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:07,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2022-11-25 17:59:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:07,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330406147] [2022-11-25 17:59:07,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:07,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:07,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:07,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:07,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash -761053530, now seen corresponding path program 1 times [2022-11-25 17:59:07,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:07,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819543539] [2022-11-25 17:59:07,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:07,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:07,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819543539] [2022-11-25 17:59:07,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819543539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:07,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940264225] [2022-11-25 17:59:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:07,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:07,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:07,402 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:07,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 17:59:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:07,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 17:59:07,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:07,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 17:59:07,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-25 17:59:07,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 17:59: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 15 treesize of output 7 [2022-11-25 17:59:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:07,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:07,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-11-25 17:59:07,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-11-25 17:59:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:07,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940264225] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:07,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:07,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2022-11-25 17:59:07,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901971376] [2022-11-25 17:59:07,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:08,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:08,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 17:59:08,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:59:08,033 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:08,418 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2022-11-25 17:59:08,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 100 transitions. [2022-11-25 17:59:08,419 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-11-25 17:59:08,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 100 transitions. [2022-11-25 17:59:08,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-11-25 17:59:08,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-11-25 17:59:08,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 100 transitions. [2022-11-25 17:59:08,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:08,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 100 transitions. [2022-11-25 17:59:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 100 transitions. [2022-11-25 17:59:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 41. [2022-11-25 17:59:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2022-11-25 17:59:08,428 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 58 transitions. [2022-11-25 17:59:08,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 17:59:08,431 INFO L428 stractBuchiCegarLoop]: Abstraction has 41 states and 58 transitions. [2022-11-25 17:59:08,431 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-25 17:59:08,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 58 transitions. [2022-11-25 17:59:08,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:08,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:08,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:08,433 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:08,433 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:08,433 INFO L748 eck$LassoCheckResult]: Stem: 1333#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1334#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1341#L367 assume !(main_~length~0#1 < 1); 1335#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1336#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1337#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1342#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1353#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1354#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1355#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1356#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1343#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1344#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1346#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1373#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1351#L370-4 main_~j~0#1 := 0; 1359#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1338#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1339#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1345#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1358#L378-2 [2022-11-25 17:59:08,434 INFO L750 eck$LassoCheckResult]: Loop: 1358#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1357#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1358#L378-2 [2022-11-25 17:59:08,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:08,434 INFO L85 PathProgramCache]: Analyzing trace with hash -761053528, now seen corresponding path program 2 times [2022-11-25 17:59:08,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:08,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496611257] [2022-11-25 17:59:08,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:08,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:08,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2022-11-25 17:59:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:08,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207302747] [2022-11-25 17:59:08,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:08,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:08,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:08,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:08,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1227998741, now seen corresponding path program 2 times [2022-11-25 17:59:08,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:08,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214737410] [2022-11-25 17:59:08,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:08,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:08,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:08,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214737410] [2022-11-25 17:59:08,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214737410] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:08,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215772342] [2022-11-25 17:59:08,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:59:08,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:08,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:08,732 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:08,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 17:59:08,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:59:08,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:59:08,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 17:59:08,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:08,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:59:09,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:59:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:09,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:09,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-25 17:59:09,165 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-11-25 17:59:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:09,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215772342] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:09,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:09,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-11-25 17:59:09,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908088054] [2022-11-25 17:59:09,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 17:59:09,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-11-25 17:59:09,256 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. cyclomatic complexity: 20 Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:09,590 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-11-25 17:59:09,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 68 transitions. [2022-11-25 17:59:09,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-25 17:59:09,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 68 transitions. [2022-11-25 17:59:09,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-25 17:59:09,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-11-25 17:59:09,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2022-11-25 17:59:09,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:09,592 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-11-25 17:59:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2022-11-25 17:59:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-11-25 17:59:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2022-11-25 17:59:09,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-11-25 17:59:09,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:59:09,597 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-11-25 17:59:09,597 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-25 17:59:09,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 61 transitions. [2022-11-25 17:59:09,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-25 17:59:09,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:09,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:09,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:09,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:09,599 INFO L748 eck$LassoCheckResult]: Stem: 1591#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1592#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1599#L367 assume !(main_~length~0#1 < 1); 1593#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1594#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1595#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1600#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1611#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1612#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1613#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1614#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1601#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1602#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1604#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1634#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1596#L370-4 main_~j~0#1 := 0; 1597#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1618#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1616#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1615#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1610#L378-2 [2022-11-25 17:59:09,599 INFO L750 eck$LassoCheckResult]: Loop: 1610#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1609#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1610#L378-2 [2022-11-25 17:59:09,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1570400154, now seen corresponding path program 4 times [2022-11-25 17:59:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:09,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143903544] [2022-11-25 17:59:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:09,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:09,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2022-11-25 17:59:09,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:09,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146182064] [2022-11-25 17:59:09,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:09,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:09,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:09,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:09,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:09,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025751, now seen corresponding path program 4 times [2022-11-25 17:59:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:09,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14824049] [2022-11-25 17:59:09,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:09,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:09,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:09,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14824049] [2022-11-25 17:59:09,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14824049] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:09,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519433167] [2022-11-25 17:59:09,979 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:59:09,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:09,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:09,984 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:10,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 17:59:10,061 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:59:10,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:59:10,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 17:59:10,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:10,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 17:59:10,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 17:59:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:10,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:10,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-25 17:59:10,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-25 17:59:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:10,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519433167] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:10,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:10,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-11-25 17:59:10,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350167111] [2022-11-25 17:59:10,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 17:59:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:59:10,439 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. cyclomatic complexity: 20 Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:10,609 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-11-25 17:59:10,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2022-11-25 17:59:10,610 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-11-25 17:59:10,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2022-11-25 17:59:10,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-25 17:59:10,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-25 17:59:10,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2022-11-25 17:59:10,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:10,612 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-11-25 17:59:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2022-11-25 17:59:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2022-11-25 17:59:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 58 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2022-11-25 17:59:10,615 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 83 transitions. [2022-11-25 17:59:10,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:59:10,616 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 83 transitions. [2022-11-25 17:59:10,617 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-25 17:59:10,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 83 transitions. [2022-11-25 17:59:10,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 17:59:10,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:10,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:10,618 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:10,618 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:10,619 INFO L748 eck$LassoCheckResult]: Stem: 1857#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1858#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1865#L367 assume !(main_~length~0#1 < 1); 1859#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1860#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1861#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1866#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1873#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1874#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1878#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1879#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1867#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1868#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1903#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1902#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1876#L370-4 main_~j~0#1 := 0; 1909#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1864#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1863#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1872#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1882#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1885#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1883#L378-2 [2022-11-25 17:59:10,619 INFO L750 eck$LassoCheckResult]: Loop: 1883#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1884#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1883#L378-2 [2022-11-25 17:59:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:10,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1227998739, now seen corresponding path program 3 times [2022-11-25 17:59:10,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:10,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887691081] [2022-11-25 17:59:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:10,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:10,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:10,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:10,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:10,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2022-11-25 17:59:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:10,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770149820] [2022-11-25 17:59:10,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:10,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:10,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:10,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1009219568, now seen corresponding path program 3 times [2022-11-25 17:59:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:10,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907111455] [2022-11-25 17:59:10,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:10,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:10,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:10,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907111455] [2022-11-25 17:59:10,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907111455] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:10,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929014146] [2022-11-25 17:59:10,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:59:10,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:10,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:10,786 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:10,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 17:59:10,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 17:59:10,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:59:10,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:59:10,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:10,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:11,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929014146] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:11,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:11,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-25 17:59:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043256943] [2022-11-25 17:59:11,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:11,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 17:59:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:59:11,118 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. cyclomatic complexity: 29 Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:11,251 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2022-11-25 17:59:11,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 90 transitions. [2022-11-25 17:59:11,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 17:59:11,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 59 states and 81 transitions. [2022-11-25 17:59:11,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-11-25 17:59:11,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-11-25 17:59:11,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 81 transitions. [2022-11-25 17:59:11,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:11,253 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-25 17:59:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 81 transitions. [2022-11-25 17:59:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 17:59:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 58 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2022-11-25 17:59:11,256 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-25 17:59:11,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:59:11,257 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-25 17:59:11,257 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-25 17:59:11,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 81 transitions. [2022-11-25 17:59:11,258 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 17:59:11,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:11,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:11,258 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:11,258 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:11,259 INFO L748 eck$LassoCheckResult]: Stem: 2153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2162#L367 assume !(main_~length~0#1 < 1); 2155#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2156#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2157#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2163#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2166#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2164#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2165#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2211#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2209#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2208#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2206#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2204#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2201#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2200#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2198#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2189#L370-4 main_~j~0#1 := 0; 2161#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2182#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2172#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2176#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2175#L378-2 [2022-11-25 17:59:11,259 INFO L750 eck$LassoCheckResult]: Loop: 2175#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2174#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2175#L378-2 [2022-11-25 17:59:11,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:11,259 INFO L85 PathProgramCache]: Analyzing trace with hash 775133344, now seen corresponding path program 4 times [2022-11-25 17:59:11,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:11,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184679974] [2022-11-25 17:59:11,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:11,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:11,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:11,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:11,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2022-11-25 17:59:11,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:11,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111326022] [2022-11-25 17:59:11,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:11,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:11,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:11,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:11,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:11,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1873802723, now seen corresponding path program 4 times [2022-11-25 17:59:11,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:11,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633151732] [2022-11-25 17:59:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:11,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:11,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:11,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633151732] [2022-11-25 17:59:11,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633151732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:11,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357228555] [2022-11-25 17:59:11,644 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:59:11,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:11,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:11,650 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:11,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-25 17:59:11,737 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:59:11,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:59:11,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 17:59:11,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:11,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 17:59:11,854 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-25 17:59:11,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-25 17:59:11,884 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-25 17:59:11,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-25 17:59:12,092 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 17:59:12,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-11-25 17:59:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:12,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:13,330 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-11-25 17:59:13,337 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-11-25 17:59:13,396 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:13,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357228555] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:13,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:13,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-25 17:59:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222192355] [2022-11-25 17:59:13,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:13,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:13,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 17:59:13,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:59:13,450 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. cyclomatic complexity: 27 Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:13,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:13,872 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2022-11-25 17:59:13,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 120 transitions. [2022-11-25 17:59:13,873 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-11-25 17:59:13,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 120 transitions. [2022-11-25 17:59:13,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-11-25 17:59:13,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-11-25 17:59:13,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 120 transitions. [2022-11-25 17:59:13,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:13,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 120 transitions. [2022-11-25 17:59:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 120 transitions. [2022-11-25 17:59:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2022-11-25 17:59:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 58 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2022-11-25 17:59:13,877 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-25 17:59:13,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:59:13,882 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-25 17:59:13,883 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-25 17:59:13,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 81 transitions. [2022-11-25 17:59:13,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 17:59:13,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:13,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:13,884 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:13,885 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:13,885 INFO L748 eck$LassoCheckResult]: Stem: 2486#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2487#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2495#L367 assume !(main_~length~0#1 < 1); 2488#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2489#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2490#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2496#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2506#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2507#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2508#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2504#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2505#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2511#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2512#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2497#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2498#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2499#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2501#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2502#L370-4 main_~j~0#1 := 0; 2492#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2534#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2515#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2518#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2516#L378-2 [2022-11-25 17:59:13,887 INFO L750 eck$LassoCheckResult]: Loop: 2516#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2517#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2516#L378-2 [2022-11-25 17:59:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1476197922, now seen corresponding path program 5 times [2022-11-25 17:59:13,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:13,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352709774] [2022-11-25 17:59:13,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:13,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:13,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:13,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:13,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 13 times [2022-11-25 17:59:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:13,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246270347] [2022-11-25 17:59:13,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:13,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:13,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:13,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:13,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996709, now seen corresponding path program 5 times [2022-11-25 17:59:13,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:13,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847247194] [2022-11-25 17:59:13,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:13,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:14,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:14,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847247194] [2022-11-25 17:59:14,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847247194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:14,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025612051] [2022-11-25 17:59:14,302 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:59:14,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:14,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:14,310 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:14,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-25 17:59:14,403 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-25 17:59:14,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:59:14,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 17:59:14,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:14,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 17:59:14,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:59:14,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 17:59:14,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:59:14,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 17:59:14,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:59:14,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:59:14,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-11-25 17:59:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:14,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:15,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-11-25 17:59:15,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-25 17:59:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:15,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025612051] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:15,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:15,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 28 [2022-11-25 17:59:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21851095] [2022-11-25 17:59:15,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:15,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:15,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 17:59:15,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-11-25 17:59:15,130 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. cyclomatic complexity: 27 Second operand has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:15,544 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-11-25 17:59:15,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2022-11-25 17:59:15,547 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-25 17:59:15,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 96 transitions. [2022-11-25 17:59:15,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-25 17:59:15,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-25 17:59:15,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 96 transitions. [2022-11-25 17:59:15,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:15,549 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 96 transitions. [2022-11-25 17:59:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 96 transitions. [2022-11-25 17:59:15,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2022-11-25 17:59:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.346938775510204) internal successors, (66), 48 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2022-11-25 17:59:15,552 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 66 transitions. [2022-11-25 17:59:15,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:59:15,561 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2022-11-25 17:59:15,561 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-25 17:59:15,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 66 transitions. [2022-11-25 17:59:15,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 17:59:15,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:15,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:15,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:15,564 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:15,564 INFO L748 eck$LassoCheckResult]: Stem: 2807#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2808#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2816#L367 assume !(main_~length~0#1 < 1); 2809#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2810#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2811#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2817#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2834#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2829#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2828#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2822#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2823#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2832#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2833#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2818#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2819#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2855#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2846#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2812#L370-4 main_~j~0#1 := 0; 2813#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2814#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2815#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2844#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2837#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2839#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2840#L378-2 [2022-11-25 17:59:15,565 INFO L750 eck$LassoCheckResult]: Loop: 2840#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2841#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2840#L378-2 [2022-11-25 17:59:15,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1480775715, now seen corresponding path program 6 times [2022-11-25 17:59:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:15,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244547355] [2022-11-25 17:59:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:15,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:15,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:15,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:15,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 14 times [2022-11-25 17:59:15,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:15,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336551728] [2022-11-25 17:59:15,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:15,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:15,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:15,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:15,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1391288486, now seen corresponding path program 6 times [2022-11-25 17:59:15,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:15,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091855208] [2022-11-25 17:59:15,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:15,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:15,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:15,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091855208] [2022-11-25 17:59:15,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091855208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:15,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139523749] [2022-11-25 17:59:15,892 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 17:59:15,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:15,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:15,896 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:15,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-25 17:59:15,993 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-11-25 17:59:15,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:59:15,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 17:59:16,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:16,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 17:59:16,457 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-25 17:59:16,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-25 17:59:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:16,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:16,959 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-11-25 17:59:16,963 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-11-25 17:59:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:17,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139523749] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:17,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:17,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2022-11-25 17:59:17,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879913089] [2022-11-25 17:59:17,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:17,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:17,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 17:59:17,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 17:59:17,090 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. cyclomatic complexity: 21 Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:19,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:19,346 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-11-25 17:59:19,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2022-11-25 17:59:19,347 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-11-25 17:59:19,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 76 transitions. [2022-11-25 17:59:19,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-11-25 17:59:19,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-11-25 17:59:19,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 76 transitions. [2022-11-25 17:59:19,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:19,348 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-11-25 17:59:19,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 76 transitions. [2022-11-25 17:59:19,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2022-11-25 17:59:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2022-11-25 17:59:19,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 59 transitions. [2022-11-25 17:59:19,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 17:59:19,359 INFO L428 stractBuchiCegarLoop]: Abstraction has 43 states and 59 transitions. [2022-11-25 17:59:19,359 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-25 17:59:19,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 59 transitions. [2022-11-25 17:59:19,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 17:59:19,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:19,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:19,360 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:19,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:19,361 INFO L748 eck$LassoCheckResult]: Stem: 3159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3160#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3167#L367 assume !(main_~length~0#1 < 1); 3161#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3162#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3163#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3168#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3179#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3180#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3181#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3177#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3178#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3184#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3185#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3169#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3170#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3172#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3175#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3164#L370-4 main_~j~0#1 := 0; 3165#L378-2 [2022-11-25 17:59:19,361 INFO L750 eck$LassoCheckResult]: Loop: 3165#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3166#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3165#L378-2 [2022-11-25 17:59:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:19,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1824010476, now seen corresponding path program 2 times [2022-11-25 17:59:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:19,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836669607] [2022-11-25 17:59:19,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:19,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:19,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:19,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:19,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2022-11-25 17:59:19,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:19,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884123166] [2022-11-25 17:59:19,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:19,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:19,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:19,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:19,388 INFO L85 PathProgramCache]: Analyzing trace with hash -527409319, now seen corresponding path program 7 times [2022-11-25 17:59:19,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:19,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886127868] [2022-11-25 17:59:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:19,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:19,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:19,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:20,438 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 17:59:20,438 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 17:59:20,438 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 17:59:20,438 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 17:59:20,438 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 17:59:20,439 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:20,439 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 17:59:20,439 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 17:59:20,439 INFO L133 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration16_Lasso [2022-11-25 17:59:20,439 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 17:59:20,439 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 17:59:20,442 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:20,446 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:20,449 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:20,452 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:20,769 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:20,772 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:20,774 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:20,777 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:20,779 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:20,782 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:20,784 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:20,787 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:59:21,092 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 17:59:21,093 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 17:59:21,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:21,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:21,102 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:21,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-25 17:59:21,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:21,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:21,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:21,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:21,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:21,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:21,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:21,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:21,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:21,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:21,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:21,135 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:21,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-25 17:59:21,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:21,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:21,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:59:21,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:21,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:21,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:21,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:59:21,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:59:21,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:21,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:21,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:21,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:21,169 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:21,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-25 17:59:21,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:21,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:21,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:21,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:21,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:21,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:21,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:21,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:21,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:21,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:21,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:21,196 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:21,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:21,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-25 17:59:21,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:21,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:21,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:21,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:21,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:21,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:21,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:21,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:21,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:21,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:21,251 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:21,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:21,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:21,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:21,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:21,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:21,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-25 17:59:21,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:21,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:21,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:21,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:21,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:21,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:21,309 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:21,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-25 17:59:21,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:21,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:21,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:21,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:21,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:21,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:21,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:21,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:21,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:21,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:21,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:21,348 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:21,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:21,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:21,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:21,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:21,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:21,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-25 17:59:21,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:21,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:21,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:21,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:21,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:21,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:21,397 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:21,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-25 17:59:21,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:21,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:21,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:21,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:21,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:21,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:21,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:21,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:21,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:21,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:21,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:21,438 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:21,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-11-25 17:59:21,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:21,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:21,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:21,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:21,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:21,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:21,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-25 17:59:21,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:21,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:21,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:21,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:21,486 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:21,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:21,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:21,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:21,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:21,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:21,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-25 17:59:21,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:21,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:21,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:59:21,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:21,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:21,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:21,538 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:21,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-25 17:59:21,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:59:21,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:59:21,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:59:21,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:59:21,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:59:21,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:59:21,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:59:21,582 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 17:59:21,617 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-11-25 17:59:21,618 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-11-25 17:59:21,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:59:21,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:21,625 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:59:21,627 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 17:59:21,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-25 17:59:21,659 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-25 17:59:21,659 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 17:59:21,659 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~arr~0#1.offset, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 1*ULTIMATE.start_main_~arr~0#1.offset - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-11-25 17:59:21,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:21,691 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-11-25 17:59:21,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:21,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:59:21,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:21,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:59:21,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:21,778 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-25 17:59:21,778 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 59 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:21,791 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 59 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51 states and 69 transitions. Complement of second has 5 states. [2022-11-25 17:59:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-11-25 17:59:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-11-25 17:59:21,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 2 letters. [2022-11-25 17:59:21,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:59:21,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 21 letters. Loop has 2 letters. [2022-11-25 17:59:21,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:59:21,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2022-11-25 17:59:21,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:59:21,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2022-11-25 17:59:21,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 17:59:21,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 44 states and 56 transitions. [2022-11-25 17:59:21,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-25 17:59:21,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-11-25 17:59:21,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 56 transitions. [2022-11-25 17:59:21,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:21,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-25 17:59:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 56 transitions. [2022-11-25 17:59:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-25 17:59:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-11-25 17:59:21,799 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-25 17:59:21,799 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-25 17:59:21,799 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-25 17:59:21,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2022-11-25 17:59:21,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-25 17:59:21,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:59:21,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:59:21,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:59:21,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:59:21,801 INFO L748 eck$LassoCheckResult]: Stem: 3364#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3365#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3373#L367 assume !(main_~length~0#1 < 1); 3366#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3367#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3368#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3374#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3402#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3375#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3376#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3377#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3380#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3401#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3400#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3398#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3396#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3394#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3392#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3390#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3388#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3387#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3382#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3383#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3381#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3369#L370-4 main_~j~0#1 := 0; 3370#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3405#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3406#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3403#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3378#L378-2 [2022-11-25 17:59:21,801 INFO L750 eck$LassoCheckResult]: Loop: 3378#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3379#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3378#L378-2 [2022-11-25 17:59:21,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:21,801 INFO L85 PathProgramCache]: Analyzing trace with hash 134458908, now seen corresponding path program 7 times [2022-11-25 17:59:21,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:21,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906600304] [2022-11-25 17:59:21,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:21,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:22,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:22,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:59:22,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906600304] [2022-11-25 17:59:22,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906600304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:59:22,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206601349] [2022-11-25 17:59:22,366 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 17:59:22,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:59:22,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:59:22,367 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:59:22,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-25 17:59:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:59:22,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 17:59:22,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:59:22,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 17:59:22,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-25 17:59:22,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-25 17:59:22,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-25 17:59:22,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:59:22,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 17:59:22,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:59:22,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 17:59:22,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:59:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:59:22,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:59:23,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-11-25 17:59:23,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-25 17:59:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 17:59:23,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206601349] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:59:23,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:59:23,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 28 [2022-11-25 17:59:23,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245662585] [2022-11-25 17:59:23,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:59:23,240 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:59:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:59:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 15 times [2022-11-25 17:59:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:59:23,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696465065] [2022-11-25 17:59:23,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:59:23,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:59:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:23,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:59:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:59:23,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:59:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:59:23,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 17:59:23,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-11-25 17:59:23,299 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. cyclomatic complexity: 16 Second operand has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 29 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:59:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:59:23,666 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-11-25 17:59:23,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2022-11-25 17:59:23,666 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-25 17:59:23,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2022-11-25 17:59:23,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-11-25 17:59:23,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-11-25 17:59:23,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-11-25 17:59:23,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:59:23,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:59:23,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:59:23,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:59:23,667 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:59:23,667 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-25 17:59:23,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:59:23,668 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-25 17:59:23,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-11-25 17:59:23,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 05:59:23 BoogieIcfgContainer [2022-11-25 17:59:23,676 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-25 17:59:23,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:59:23,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:59:23,677 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:59:23,678 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:59" (3/4) ... [2022-11-25 17:59:23,681 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:59:23,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:59:23,682 INFO L158 Benchmark]: Toolchain (without parser) took 24810.09ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 160.3MB in the beginning and 143.0MB in the end (delta: 17.3MB). Peak memory consumption was 155.7MB. Max. memory is 16.1GB. [2022-11-25 17:59:23,683 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 130.0MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:59:23,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 540.94ms. Allocated memory is still 188.7MB. Free memory was 160.3MB in the beginning and 145.0MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 17:59:23,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.10ms. Allocated memory is still 188.7MB. Free memory was 144.9MB in the beginning and 142.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:59:23,684 INFO L158 Benchmark]: Boogie Preprocessor took 55.74ms. Allocated memory is still 188.7MB. Free memory was 142.9MB in the beginning and 141.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:59:23,684 INFO L158 Benchmark]: RCFGBuilder took 366.03ms. Allocated memory is still 188.7MB. Free memory was 141.8MB in the beginning and 130.3MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:59:23,685 INFO L158 Benchmark]: BuchiAutomizer took 23770.42ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 130.3MB in the beginning and 143.0MB in the end (delta: -12.7MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. [2022-11-25 17:59:23,685 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 327.2MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:59:23,687 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.26ms. Allocated memory is still 130.0MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 540.94ms. Allocated memory is still 188.7MB. Free memory was 160.3MB in the beginning and 145.0MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.10ms. Allocated memory is still 188.7MB. Free memory was 144.9MB in the beginning and 142.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.74ms. Allocated memory is still 188.7MB. Free memory was 142.9MB in the beginning and 141.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.03ms. Allocated memory is still 188.7MB. Free memory was 141.8MB in the beginning and 130.3MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 23770.42ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 130.3MB in the beginning and 143.0MB in the end (delta: -12.7MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 327.2MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (15 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[arr] + -1 * arr and consists of 5 locations. One deterministic module has affine ranking function -4 * j + unknown-#length-unknown[arr] + -1 * arr and consists of 3 locations. 15 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.6s and 18 iterations. TraceHistogramMax:6. Analysis of lassos took 17.6s. Construction of modules took 2.7s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 17. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 152 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 676 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 674 mSDsluCounter, 957 SdHoareTripleChecker+Invalid, 2.8s 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.1s 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: 49ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-11-25 17:59:23,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:23,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:24,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:24,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:24,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-25 17:59:24,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:24,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-25 17:59:25,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-25 17:59:25,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-25 17:59:25,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 17:59:25,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-25 17:59:25,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-25 17:59:26,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-25 17:59:26,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-25 17:59:26,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e21f5d92-bf4e-4063-a1d6-afd478898b10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE