./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b5237d83 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_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a --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 1e35e1f5dba77fd8ed843a6cdfa0fc21590233839dbc71bb991dc25008dd4b76 --- 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-b5237d8 [2022-11-21 17:21:58,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:21:58,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:21:58,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:21:58,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:21:58,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:21:58,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:21:58,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:21:58,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:21:58,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:21:58,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:21:58,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:21:58,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:21:58,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:21:58,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:21:58,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:21:58,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:21:58,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:21:58,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:21:58,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:21:58,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:21:58,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:21:58,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:21:58,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:21:58,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:21:58,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:21:58,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:21:58,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:21:58,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:21:58,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:21:58,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:21:58,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:21:58,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:21:58,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:21:58,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:21:58,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:21:58,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:21:58,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:21:58,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:21:58,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:21:58,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:21:58,535 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-21 17:21:58,574 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:21:58,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:21:58,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:21:58,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:21:58,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:21:58,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:21:58,578 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:21:58,578 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-21 17:21:58,578 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-21 17:21:58,579 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-21 17:21:58,580 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-21 17:21:58,580 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-21 17:21:58,581 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-21 17:21:58,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:21:58,581 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:21:58,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:21:58,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:21:58,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-21 17:21:58,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-21 17:21:58,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-21 17:21:58,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:21:58,583 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-21 17:21:58,584 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:21:58,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-21 17:21:58,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:21:58,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:21:58,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:21:58,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:21:58,587 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-21 17:21:58,587 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_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/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_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a 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 -> 1e35e1f5dba77fd8ed843a6cdfa0fc21590233839dbc71bb991dc25008dd4b76 [2022-11-21 17:21:58,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:21:58,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:21:58,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:21:58,978 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:21:58,978 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:21:58,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i [2022-11-21 17:22:02,597 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:22:02,946 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:22:02,947 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i [2022-11-21 17:22:02,969 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/data/8e20ed1dd/c1424191b39c4298af0890dc2df7c65d/FLAG7ad1882cd [2022-11-21 17:22:02,993 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/data/8e20ed1dd/c1424191b39c4298af0890dc2df7c65d [2022-11-21 17:22:02,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:22:02,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:22:03,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:22:03,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:22:03,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:22:03,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:22:02" (1/1) ... [2022-11-21 17:22:03,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56cbcfac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03, skipping insertion in model container [2022-11-21 17:22:03,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:22:02" (1/1) ... [2022-11-21 17:22:03,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:22:03,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:22:03,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:22:03,380 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:22:03,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:22:03,500 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:22:03,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03 WrapperNode [2022-11-21 17:22:03,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:22:03,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:22:03,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:22:03,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:22:03,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03" (1/1) ... [2022-11-21 17:22:03,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03" (1/1) ... [2022-11-21 17:22:03,579 INFO L138 Inliner]: procedures = 110, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2022-11-21 17:22:03,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:22:03,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:22:03,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:22:03,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:22:03,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03" (1/1) ... [2022-11-21 17:22:03,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03" (1/1) ... [2022-11-21 17:22:03,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03" (1/1) ... [2022-11-21 17:22:03,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03" (1/1) ... [2022-11-21 17:22:03,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03" (1/1) ... [2022-11-21 17:22:03,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03" (1/1) ... [2022-11-21 17:22:03,627 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03" (1/1) ... [2022-11-21 17:22:03,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03" (1/1) ... [2022-11-21 17:22:03,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:22:03,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:22:03,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:22:03,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:22:03,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03" (1/1) ... [2022-11-21 17:22:03,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:03,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:03,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:03,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-21 17:22:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 17:22:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:22:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:22:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:22:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:22:03,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:22:03,895 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:22:03,898 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:22:04,063 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:22:04,070 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:22:04,070 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-21 17:22:04,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:22:04 BoogieIcfgContainer [2022-11-21 17:22:04,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:22:04,075 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-21 17:22:04,075 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-21 17:22:04,080 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-21 17:22:04,081 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 17:22:04,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 05:22:02" (1/3) ... [2022-11-21 17:22:04,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33d32327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 05:22:04, skipping insertion in model container [2022-11-21 17:22:04,083 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 17:22:04,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:03" (2/3) ... [2022-11-21 17:22:04,084 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33d32327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 05:22:04, skipping insertion in model container [2022-11-21 17:22:04,084 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 17:22:04,085 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:22:04" (3/3) ... [2022-11-21 17:22:04,086 INFO L332 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i [2022-11-21 17:22:04,182 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-21 17:22:04,182 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-21 17:22:04,183 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-21 17:22:04,183 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-21 17:22:04,183 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-21 17:22:04,183 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-21 17:22:04,183 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-21 17:22:04,184 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-21 17:22:04,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:22:04,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-21 17:22:04,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:22:04,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:22:04,225 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 17:22:04,225 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-21 17:22:04,225 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-21 17:22:04,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:22:04,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-21 17:22:04,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:22:04,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:22:04,230 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 17:22:04,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-21 17:22:04,241 INFO L748 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 7#L554-3true [2022-11-21 17:22:04,242 INFO L750 eck$LassoCheckResult]: Loop: 7#L554-3true call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 9#L554-1true assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 6#L556-3true assume !true; 2#L556-4true call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 7#L554-3true [2022-11-21 17:22:04,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:04,256 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-21 17:22:04,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:04,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813852247] [2022-11-21 17:22:04,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:04,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:04,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:04,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:04,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2022-11-21 17:22:04,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:04,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239479532] [2022-11-21 17:22:04,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:04,760 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-21 17:22:04,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:04,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239479532] [2022-11-21 17:22:04,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239479532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:22:04,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:22:04,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:22:04,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143336731] [2022-11-21 17:22:04,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:22:04,770 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:22:04,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:04,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 17:22:04,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 17:22:04,815 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:22:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:22:04,823 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-11-21 17:22:04,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-11-21 17:22:04,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-21 17:22:04,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2022-11-21 17:22:04,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-11-21 17:22:04,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-11-21 17:22:04,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2022-11-21 17:22:04,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:22:04,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-11-21 17:22:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2022-11-21 17:22:04,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-11-21 17:22:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-21 17:22:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-11-21 17:22:04,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-11-21 17:22:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 17:22:04,876 INFO L428 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-11-21 17:22:04,876 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-21 17:22:04,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-11-21 17:22:04,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-21 17:22:04,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:22:04,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:22:04,878 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 17:22:04,878 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-21 17:22:04,879 INFO L748 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 31#L554-3 [2022-11-21 17:22:04,879 INFO L750 eck$LassoCheckResult]: Loop: 31#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 36#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 34#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 35#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 30#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 31#L554-3 [2022-11-21 17:22:04,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-21 17:22:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:04,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467162465] [2022-11-21 17:22:04,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:04,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:04,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:05,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2022-11-21 17:22:05,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:05,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367936223] [2022-11-21 17:22:05,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:05,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:05,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:05,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:05,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2022-11-21 17:22:05,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:05,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741044331] [2022-11-21 17:22:05,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:05,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:05,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:05,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:06,502 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 17:22:06,503 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 17:22:06,503 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 17:22:06,503 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 17:22:06,503 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 17:22:06,503 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:06,504 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 17:22:06,504 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 17:22:06,504 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i_Iteration2_Lasso [2022-11-21 17:22:06,504 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 17:22:06,504 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 17:22:06,541 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-21 17:22:06,559 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-21 17:22:06,563 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-21 17:22:06,570 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-21 17:22:06,576 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-21 17:22:06,580 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:22:06,584 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-21 17:22:06,590 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-21 17:22:06,594 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-21 17:22:06,598 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-21 17:22:07,581 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-21 17:22:07,585 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-21 17:22:07,589 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:22:07,593 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:22:07,596 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-21 17:22:07,601 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-21 17:22:07,605 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-21 17:22:08,184 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 17:22:08,193 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 17:22:08,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,209 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-21 17:22:08,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-21 17:22:08,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:08,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:08,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:08,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-11-21 17:22:08,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-21 17:22:08,254 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-21 17:22:08,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:08,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:08,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:08,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-11-21 17:22:08,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-21 17:22:08,292 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-21 17:22:08,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:08,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:08,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:08,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,332 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-21 17:22:08,344 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-21 17:22:08,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:08,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:08,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:08,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,389 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,405 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-21 17:22:08,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-21 17:22:08,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:08,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:08,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:08,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,459 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,467 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-21 17:22:08,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-21 17:22:08,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:08,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:08,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:08,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:08,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,510 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-21 17:22:08,519 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-21 17:22:08,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:08,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:08,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:08,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:08,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,558 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-21 17:22:08,567 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-21 17:22:08,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:08,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:08,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:08,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:08,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,601 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 17:22:08,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-21 17:22:08,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:08,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:08,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:08,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,650 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 17:22:08,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-21 17:22:08,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:08,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:08,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:08,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,726 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 17:22:08,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-21 17:22:08,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:08,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:08,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:08,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,790 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,799 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-21 17:22:08,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-21 17:22:08,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:08,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:08,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:08,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,850 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,860 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-21 17:22:08,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-21 17:22:08,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:08,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:08,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:08,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:08,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:08,906 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:08,912 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-21 17:22:08,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-21 17:22:08,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:08,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:08,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:08,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:08,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:08,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:08,954 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 17:22:08,993 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-21 17:22:08,993 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-11-21 17:22:08,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:08,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:09,011 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:09,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-21 17:22:09,027 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 17:22:09,068 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-21 17:22:09,068 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 17:22:09,069 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 Supporting invariants [] [2022-11-21 17:22:09,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:09,219 INFO L156 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-11-21 17:22:09,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:09,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:22:09,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:09,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 17:22:09,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:09,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:09,401 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 17:22:09,402 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 21 treesize of output 28 [2022-11-21 17:22:09,593 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-21 17:22:09,597 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-11-21 17:22:09,599 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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-21 17:22:09,791 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) Result 17 states and 20 transitions. Complement of second has 11 states. [2022-11-21 17:22:09,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-11-21 17:22:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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-21 17:22:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2022-11-21 17:22:09,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2022-11-21 17:22:09,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:09,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2022-11-21 17:22:09,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:09,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2022-11-21 17:22:09,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:09,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2022-11-21 17:22:09,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-21 17:22:09,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2022-11-21 17:22:09,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-11-21 17:22:09,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-11-21 17:22:09,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-11-21 17:22:09,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:22:09,802 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-11-21 17:22:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-11-21 17:22:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-21 17:22:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:22:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-11-21 17:22:09,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-11-21 17:22:09,812 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-11-21 17:22:09,813 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-21 17:22:09,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-11-21 17:22:09,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-21 17:22:09,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:22:09,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:22:09,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-21 17:22:09,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-21 17:22:09,816 INFO L748 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 209#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 218#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 216#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 210#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 211#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 217#L556-3 [2022-11-21 17:22:09,816 INFO L750 eck$LassoCheckResult]: Loop: 217#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 219#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 217#L556-3 [2022-11-21 17:22:09,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:09,822 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2022-11-21 17:22:09,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:09,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818997914] [2022-11-21 17:22:09,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:09,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:09,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:09,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2022-11-21 17:22:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:09,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393887850] [2022-11-21 17:22:09,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:09,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:09,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:09,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2022-11-21 17:22:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:09,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007773538] [2022-11-21 17:22:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:09,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:09,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:10,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:11,120 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 17:22:11,120 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 17:22:11,120 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 17:22:11,120 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 17:22:11,120 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 17:22:11,120 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:11,121 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 17:22:11,121 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 17:22:11,121 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i_Iteration3_Lasso [2022-11-21 17:22:11,121 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 17:22:11,121 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 17:22:11,125 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-21 17:22:11,129 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-21 17:22:11,131 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-21 17:22:11,134 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-21 17:22:11,137 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:22:11,144 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:22:11,150 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-21 17:22:11,153 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-21 17:22:11,157 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-21 17:22:11,160 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-21 17:22:11,721 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-21 17:22:11,726 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-21 17:22:11,729 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-21 17:22:11,733 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-21 17:22:11,741 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-21 17:22:11,745 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-21 17:22:11,748 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-21 17:22:12,261 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 17:22:12,261 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 17:22:12,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,265 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,283 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-21 17:22:12,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-21 17:22:12,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:12,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:12,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:12,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:12,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:12,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,326 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,337 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-21 17:22:12,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-21 17:22:12,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:12,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:12,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:12,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:12,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:12,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,383 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,393 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-21 17:22:12,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-21 17:22:12,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:12,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:12,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:12,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:12,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:12,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,439 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,449 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-21 17:22:12,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-21 17:22:12,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:12,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:12,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:12,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:12,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:12,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,503 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,514 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-21 17:22:12,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-21 17:22:12,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:12,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:12,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:12,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:12,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:12,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,559 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,564 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-21 17:22:12,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-21 17:22:12,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:12,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:12,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:12,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:12,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,609 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,614 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-21 17:22:12,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-21 17:22:12,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:12,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:12,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:12,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:12,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:12,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,659 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,664 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-21 17:22:12,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-21 17:22:12,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:12,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:12,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:12,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:12,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,711 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,716 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-21 17:22:12,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-21 17:22:12,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:12,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:12,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:12,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:12,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:12,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,759 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,765 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-21 17:22:12,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-21 17:22:12,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:12,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:12,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:12,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:12,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,804 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,809 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-21 17:22:12,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-21 17:22:12,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:12,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:12,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:12,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:12,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,863 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,872 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-21 17:22:12,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-21 17:22:12,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:12,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:12,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:12,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:12,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:12,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:12,947 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:12,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 17:22:12,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-21 17:22:12,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:12,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:12,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:12,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:12,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:12,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:12,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:13,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:13,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:13,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:13,008 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:13,013 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-21 17:22:13,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-21 17:22:13,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:13,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:13,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:13,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:13,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:13,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:13,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:13,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:13,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:13,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:13,063 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:13,068 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-21 17:22:13,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-21 17:22:13,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:13,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:13,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:13,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:13,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:13,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:13,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:13,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:13,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:13,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:13,122 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:13,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 17:22:13,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-21 17:22:13,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:13,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:13,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:13,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:13,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:13,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:13,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:13,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:13,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:13,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:13,186 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:13,192 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-21 17:22:13,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-21 17:22:13,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:13,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:13,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:13,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:13,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:13,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:13,237 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 17:22:13,258 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-11-21 17:22:13,259 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-11-21 17:22:13,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:13,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:13,263 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:13,267 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 17:22:13,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-21 17:22:13,305 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-11-21 17:22:13,305 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 17:22:13,305 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_2 + 2*v_rep(select (select #memory_int ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_2 + 1 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_2 >= 0] [2022-11-21 17:22:13,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:13,439 INFO L156 tatePredicateManager]: 17 out of 21 supporting invariants were superfluous and have been removed [2022-11-21 17:22:13,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:13,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 17:22:13,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:13,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:13,751 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 17:22:13,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-21 17:22:13,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-21 17:22:13,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-21 17:22:13,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-21 17:22:14,407 INFO L321 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-11-21 17:22:14,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 187 treesize of output 152 [2022-11-21 17:22:14,498 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 9 treesize of output 7 [2022-11-21 17:22:14,545 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 17:22:14,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 20 [2022-11-21 17:22:14,550 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 9 treesize of output 7 [2022-11-21 17:22:14,563 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:22:14,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-11-21 17:22:14,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:14,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:14,894 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:22:14,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 53 [2022-11-21 17:22:14,910 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 9 treesize of output 7 [2022-11-21 17:22:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:14,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 17:22:14,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:15,063 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-21 17:22:15,064 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2022-11-21 17:22:15,064 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-21 17:22:15,139 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 18 states and 22 transitions. Complement of second has 4 states. [2022-11-21 17:22:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-11-21 17:22:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-21 17:22:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-11-21 17:22:15,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2022-11-21 17:22:15,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:15,143 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 17:22:15,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:15,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-21 17:22:15,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:15,254 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:22:15,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 102 [2022-11-21 17:22:15,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:15,316 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-21 17:22:15,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 94 [2022-11-21 17:22:15,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-21 17:22:15,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-21 17:22:15,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 22 [2022-11-21 17:22:15,391 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 9 treesize of output 7 [2022-11-21 17:22:15,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:15,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:15,571 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:22:15,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2022-11-21 17:22:15,584 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 9 treesize of output 7 [2022-11-21 17:22:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:15,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 17:22:15,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:15,735 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-21 17:22:15,736 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2022-11-21 17:22:15,736 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-21 17:22:15,812 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 18 states and 22 transitions. Complement of second has 3 states. [2022-11-21 17:22:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-11-21 17:22:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-21 17:22:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2022-11-21 17:22:15,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2022-11-21 17:22:15,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:15,835 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 17:22:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:15,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 17:22:15,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:16,070 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 17:22:16,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-21 17:22:16,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-21 17:22:16,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-21 17:22:16,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-21 17:22:16,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:16,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:16,539 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 17:22:16,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 66 [2022-11-21 17:22:16,554 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 9 treesize of output 7 [2022-11-21 17:22:16,558 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 9 treesize of output 7 [2022-11-21 17:22:16,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:22:16,618 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-21 17:22:16,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 386 treesize of output 360 [2022-11-21 17:22:16,774 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 17 treesize of output 13 [2022-11-21 17:22:16,806 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 17 treesize of output 13 [2022-11-21 17:22:16,828 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 17 treesize of output 13 [2022-11-21 17:22:16,841 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 9 treesize of output 7 [2022-11-21 17:22:16,864 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:22:16,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-11-21 17:22:16,895 WARN L859 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_main_~i~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse0 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~j~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~n~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~i~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~j~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~n~0#1.base| v_DerPreprocessor_15)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|)) (.cse1 (select v_DerPreprocessor_15 |c_ULTIMATE.start_main_~n~0#1.offset|)) (.cse3 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~j~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~n~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~i~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~j~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~n~0#1.base| v_DerPreprocessor_21))) (and (= (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|) v_DerPreprocessor_13) (= .cse1 (select v_DerPreprocessor_21 |c_ULTIMATE.start_main_~n~0#1.offset|)) (= (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|) .cse2) (= (select .cse3 |c_ULTIMATE.start_main_~j~0#1.base|) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) .cse1) (= v_DerPreprocessor_19 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|))))) (= |c_ULTIMATE.start_main_~j~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~j~0#1.base|) c_unseeded (not (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (not (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~i~0#1.base|))) is different from true [2022-11-21 17:22:17,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:17,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:17,097 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:22:17,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 75 [2022-11-21 17:22:17,115 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 17 treesize of output 13 [2022-11-21 17:22:17,120 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 9 treesize of output 7 [2022-11-21 17:22:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:17,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 17:22:17,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:17,256 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-21 17:22:17,256 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2022-11-21 17:22:17,257 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-21 17:22:17,322 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 18 states and 22 transitions. Complement of second has 2 states. [2022-11-21 17:22:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-11-21 17:22:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-21 17:22:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2022-11-21 17:22:17,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2022-11-21 17:22:17,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:17,325 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 17:22:17,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:17,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 17:22:17,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:17,425 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:22:17,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 84 [2022-11-21 17:22:17,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:17,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:22:17,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-11-21 17:22:17,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-21 17:22:17,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-11-21 17:22:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:17,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 17:22:17,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:17,707 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-21 17:22:17,708 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2022-11-21 17:22:17,708 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-21 17:22:17,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 22 states and 27 transitions. Complement of second has 9 states. [2022-11-21 17:22:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-21 17:22:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-21 17:22:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2022-11-21 17:22:17,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 6 letters. Loop has 2 letters. [2022-11-21 17:22:17,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:17,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2022-11-21 17:22:17,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:17,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 6 letters. Loop has 4 letters. [2022-11-21 17:22:17,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:17,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2022-11-21 17:22:17,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-11-21 17:22:17,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 26 transitions. [2022-11-21 17:22:17,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-11-21 17:22:17,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-21 17:22:17,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2022-11-21 17:22:17,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:22:17,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-11-21 17:22:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2022-11-21 17:22:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-11-21 17:22:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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-21 17:22:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-11-21 17:22:17,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-11-21 17:22:17,811 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-11-21 17:22:17,811 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-21 17:22:17,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-11-21 17:22:17,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-21 17:22:17,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:22:17,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:22:17,813 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-21 17:22:17,813 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2022-11-21 17:22:17,813 INFO L748 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 539#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 549#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 547#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 540#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 541#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 551#L556-3 [2022-11-21 17:22:17,814 INFO L750 eck$LassoCheckResult]: Loop: 551#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 544#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 534#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 535#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 545#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 553#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 552#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 551#L556-3 [2022-11-21 17:22:17,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 3 times [2022-11-21 17:22:17,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:17,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110021757] [2022-11-21 17:22:17,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:17,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:17,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:17,911 INFO L85 PathProgramCache]: Analyzing trace with hash 247318912, now seen corresponding path program 1 times [2022-11-21 17:22:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:17,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110717156] [2022-11-21 17:22:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:17,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:17,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:17,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:17,962 INFO L85 PathProgramCache]: Analyzing trace with hash -474670092, now seen corresponding path program 1 times [2022-11-21 17:22:17,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:17,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010192848] [2022-11-21 17:22:17,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:18,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:18,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:19,593 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 17:22:19,593 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 17:22:19,594 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 17:22:19,594 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 17:22:19,594 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 17:22:19,594 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:19,594 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 17:22:19,594 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 17:22:19,594 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i_Iteration4_Lasso [2022-11-21 17:22:19,595 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 17:22:19,595 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 17:22:19,599 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-21 17:22:19,604 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-21 17:22:19,606 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-21 17:22:19,608 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-21 17:22:19,611 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-21 17:22:19,613 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-21 17:22:19,616 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-21 17:22:19,619 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-21 17:22:19,623 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-21 17:22:19,626 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-21 17:22:20,302 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-21 17:22:20,304 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-21 17:22:20,306 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-21 17:22:20,314 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-21 17:22:20,316 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-21 17:22:20,319 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-21 17:22:20,752 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 17:22:20,752 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 17:22:20,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:20,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:20,759 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:20,767 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-21 17:22:20,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:20,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:20,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:20,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:20,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-21 17:22:20,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:20,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:20,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:20,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:20,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:20,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:20,797 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:20,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-21 17:22:20,801 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-21 17:22:20,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:20,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:20,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:20,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:20,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:20,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:20,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:20,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:20,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:20,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:20,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:20,832 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:20,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-21 17:22:20,835 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-21 17:22:20,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:20,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:20,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:20,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:20,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:20,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:20,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:20,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:20,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:20,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:20,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:20,852 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:20,854 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-21 17:22:20,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-21 17:22:20,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:20,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:20,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:20,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:20,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:20,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:20,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:20,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:20,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:20,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:20,886 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:20,895 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-21 17:22:20,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:20,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:20,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:20,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:20,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:20,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-21 17:22:20,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:20,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:20,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:20,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:20,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:20,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:20,935 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:20,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-21 17:22:20,944 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-21 17:22:20,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:20,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:20,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:20,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:20,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:20,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:20,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:20,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:20,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-11-21 17:22:20,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:20,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:20,979 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:20,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-21 17:22:20,983 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-21 17:22:20,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:20,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:20,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:20,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:20,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:20,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:21,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:21,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:21,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:21,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:21,006 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:21,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-21 17:22:21,009 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-21 17:22:21,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:21,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:21,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:21,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:21,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:21,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:21,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:21,029 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:21,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-11-21 17:22:21,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:21,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:21,033 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:21,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-21 17:22:21,036 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-21 17:22:21,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:21,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:21,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:21,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:21,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:21,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:21,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:21,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:21,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-11-21 17:22:21,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:21,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:21,056 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:21,059 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-21 17:22:21,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-21 17:22:21,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:21,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:21,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:21,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:21,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:21,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:21,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:21,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:21,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:21,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:21,094 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:21,103 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-21 17:22:21,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-21 17:22:21,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:21,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:21,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:21,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:21,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:21,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:21,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:21,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:21,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:21,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:21,161 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:21,171 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-21 17:22:21,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-21 17:22:21,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:21,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:21,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:21,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:21,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:21,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:21,213 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 17:22:21,237 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-11-21 17:22:21,237 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-11-21 17:22:21,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:21,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:21,239 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:21,243 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 17:22:21,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-11-21 17:22:21,258 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-21 17:22:21,258 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 17:22:21,258 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_3 Supporting invariants [] [2022-11-21 17:22:21,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-11-21 17:22:21,389 INFO L156 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-11-21 17:22:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:21,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:22:21,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:21,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-21 17:22:21,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:21,604 INFO L321 Elim1Store]: treesize reduction 55, result has 44.4 percent of original size [2022-11-21 17:22:21,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 66 [2022-11-21 17:22:21,897 INFO L321 Elim1Store]: treesize reduction 64, result has 35.4 percent of original size [2022-11-21 17:22:21,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 73 [2022-11-21 17:22:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:22,104 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2022-11-21 17:22:22,104 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 7 Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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-21 17:22:22,276 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 7. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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 38 states and 48 transitions. Complement of second has 15 states. [2022-11-21 17:22:22,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2022-11-21 17:22:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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-21 17:22:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2022-11-21 17:22:22,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 6 letters. Loop has 7 letters. [2022-11-21 17:22:22,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:22,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 13 letters. Loop has 7 letters. [2022-11-21 17:22:22,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:22,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 6 letters. Loop has 14 letters. [2022-11-21 17:22:22,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:22,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2022-11-21 17:22:22,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-21 17:22:22,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 45 transitions. [2022-11-21 17:22:22,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-11-21 17:22:22,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-11-21 17:22:22,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2022-11-21 17:22:22,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:22:22,284 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-11-21 17:22:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2022-11-21 17:22:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-11-21 17:22:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 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-21 17:22:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-11-21 17:22:22,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-11-21 17:22:22,287 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-11-21 17:22:22,287 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-21 17:22:22,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2022-11-21 17:22:22,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-21 17:22:22,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:22:22,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:22:22,290 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1] [2022-11-21 17:22:22,290 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2022-11-21 17:22:22,290 INFO L748 eck$LassoCheckResult]: Stem: 771#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 772#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 782#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 784#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 792#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 791#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 787#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 776#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 775#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 774#L556-1 [2022-11-21 17:22:22,290 INFO L750 eck$LassoCheckResult]: Loop: 774#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 767#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 768#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 777#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 780#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 796#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 795#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 774#L556-1 [2022-11-21 17:22:22,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1271620447, now seen corresponding path program 4 times [2022-11-21 17:22:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:22,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974404928] [2022-11-21 17:22:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:22,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:22,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:22,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:22,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1230755424, now seen corresponding path program 2 times [2022-11-21 17:22:22,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:22,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409876575] [2022-11-21 17:22:22,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:22,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:22,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:22,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:22,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash -645799806, now seen corresponding path program 2 times [2022-11-21 17:22:22,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:22,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28882423] [2022-11-21 17:22:22,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:22,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:22,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:22,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:22,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:24,867 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 17:22:24,868 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 17:22:24,868 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 17:22:24,868 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 17:22:24,868 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 17:22:24,868 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:24,868 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 17:22:24,868 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 17:22:24,868 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i_Iteration5_Lasso [2022-11-21 17:22:24,868 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 17:22:24,868 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 17:22:24,872 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-21 17:22:24,882 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-21 17:22:24,885 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-21 17:22:24,889 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-21 17:22:24,892 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-21 17:22:24,894 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-21 17:22:24,897 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-21 17:22:24,899 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-21 17:22:24,902 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-21 17:22:24,905 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-21 17:22:25,844 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-21 17:22:25,847 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-21 17:22:25,853 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-21 17:22:25,856 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:22:25,864 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:22:26,543 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 17:22:26,544 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 17:22:26,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,546 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-11-21 17:22:26,550 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-21 17:22:26,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:26,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:26,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:26,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-11-21 17:22:26,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,570 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,580 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-21 17:22:26,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-11-21 17:22:26,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:26,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:26,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:26,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-11-21 17:22:26,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,600 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-11-21 17:22:26,603 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-21 17:22:26,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:26,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:26,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-11-21 17:22:26,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,627 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-11-21 17:22:26,630 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-21 17:22:26,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:26,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:26,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:26,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-11-21 17:22:26,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,652 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-11-21 17:22:26,654 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-21 17:22:26,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:26,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:26,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:26,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-11-21 17:22:26,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,674 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-11-21 17:22:26,678 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-21 17:22:26,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:26,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:26,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:26,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-11-21 17:22:26,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,697 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-11-21 17:22:26,700 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-21 17:22:26,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 17:22:26,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 17:22:26,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 17:22:26,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-11-21 17:22:26,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,720 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-11-21 17:22:26,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 17:22:26,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:26,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:26,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-11-21 17:22:26,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,746 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-11-21 17:22:26,749 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-21 17:22:26,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:26,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:26,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-11-21 17:22:26,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,772 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-11-21 17:22:26,774 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-21 17:22:26,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:26,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:26,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:26,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,819 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-11-21 17:22:26,822 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-21 17:22:26,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:26,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:26,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-11-21 17:22:26,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,848 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-11-21 17:22:26,852 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-21 17:22:26,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:26,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:26,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-11-21 17:22:26,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,880 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-11-21 17:22:26,883 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-21 17:22:26,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:26,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:26,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:26,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,907 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-11-21 17:22:26,910 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-21 17:22:26,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:26,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:26,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 17:22:26,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-11-21 17:22:26,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:26,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:26,945 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:26,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-11-21 17:22:26,948 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-21 17:22:26,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 17:22:26,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 17:22:26,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 17:22:26,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 17:22:26,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 17:22:26,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 17:22:26,984 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 17:22:27,011 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-11-21 17:22:27,011 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-11-21 17:22:27,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:22:27,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:27,012 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:27,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-11-21 17:22:27,015 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 17:22:27,028 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-11-21 17:22:27,028 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 17:22:27,028 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~mem11#1) = 1*ULTIMATE.start_main_#t~mem10#1 - 1*ULTIMATE.start_main_#t~mem11#1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_4 >= 0] [2022-11-21 17:22:27,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-11-21 17:22:27,158 INFO L156 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2022-11-21 17:22:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:27,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-21 17:22:27,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:27,271 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-21 17:22:27,318 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:27,427 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:22:27,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-11-21 17:22:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:27,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-21 17:22:27,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:27,587 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:27,648 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 17:22:27,649 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 19 treesize of output 26 [2022-11-21 17:22:27,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-11-21 17:22:27,857 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-21 17:22:27,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 54 [2022-11-21 17:22:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:27,928 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 6 loop predicates [2022-11-21 17:22:27,928 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-21 17:22:27,995 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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) Result 40 states and 51 transitions. Complement of second has 5 states. [2022-11-21 17:22:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2022-11-21 17:22:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-21 17:22:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2022-11-21 17:22:27,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 9 letters. Loop has 7 letters. [2022-11-21 17:22:27,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:27,997 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 17:22:28,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:28,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-21 17:22:28,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:28,111 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-21 17:22:28,158 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:28,273 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:22:28,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-11-21 17:22:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:28,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-21 17:22:28,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:28,424 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:28,476 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 17:22:28,477 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 19 treesize of output 26 [2022-11-21 17:22:28,584 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-21 17:22:28,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 51 [2022-11-21 17:22:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:28,650 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 5 loop predicates [2022-11-21 17:22:28,651 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 1.4545454545454546) 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-21 17:22:28,720 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12. Second operand has 11 states, 11 states have (on average 1.4545454545454546) 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) Result 40 states and 51 transitions. Complement of second has 5 states. [2022-11-21 17:22:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2022-11-21 17:22:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) 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-21 17:22:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2022-11-21 17:22:28,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 9 letters. Loop has 7 letters. [2022-11-21 17:22:28,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:28,729 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 17:22:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:28,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-21 17:22:28,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:28,834 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-21 17:22:28,882 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:29,008 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:22:29,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-11-21 17:22:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:29,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-21 17:22:29,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:29,152 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:29,204 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 17:22:29,205 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 19 treesize of output 26 [2022-11-21 17:22:29,322 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-21 17:22:29,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 51 [2022-11-21 17:22:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:29,425 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2022-11-21 17:22:29,426 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 1.4545454545454546) 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-21 17:22:29,847 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12. Second operand has 11 states, 11 states have (on average 1.4545454545454546) 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) Result 56 states and 67 transitions. Complement of second has 19 states. [2022-11-21 17:22:29,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 7 stem states 3 non-accepting loop states 2 accepting loop states [2022-11-21 17:22:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) 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-21 17:22:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-11-21 17:22:29,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 30 transitions. Stem has 9 letters. Loop has 7 letters. [2022-11-21 17:22:29,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:29,850 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 17:22:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:29,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-21 17:22:29,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:29,964 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-21 17:22:30,016 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:30,138 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:22:30,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-11-21 17:22:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:30,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-21 17:22:30,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:30,315 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:30,376 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 17:22:30,376 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 19 treesize of output 26 [2022-11-21 17:22:30,543 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-21 17:22:30,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 54 [2022-11-21 17:22:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:30,623 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.6 stem predicates 6 loop predicates [2022-11-21 17:22:30,624 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-21 17:22:31,092 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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) Result 56 states and 67 transitions. Complement of second has 19 states. [2022-11-21 17:22:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 7 stem states 3 non-accepting loop states 2 accepting loop states [2022-11-21 17:22:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-21 17:22:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-11-21 17:22:31,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 30 transitions. Stem has 9 letters. Loop has 7 letters. [2022-11-21 17:22:31,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:31,098 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-21 17:22:31,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:31,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-21 17:22:31,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:31,219 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-21 17:22:31,264 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:31,400 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:22:31,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-11-21 17:22:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:31,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-21 17:22:31,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:31,564 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:31,620 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 17:22:31,621 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 19 treesize of output 26 [2022-11-21 17:22:31,731 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-21 17:22:31,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 51 [2022-11-21 17:22:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:31,795 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2022-11-21 17:22:31,797 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 1.4545454545454546) 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-21 17:22:32,480 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 1.4545454545454546) 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) Result 333 states and 488 transitions. Complement of second has 134 states 23 powerset states111 rank states. The highest rank that occured is 5 [2022-11-21 17:22:32,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 7 stem states 7 non-accepting loop states 2 accepting loop states [2022-11-21 17:22:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) 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-21 17:22:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2022-11-21 17:22:32,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 9 letters. Loop has 7 letters. [2022-11-21 17:22:32,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:32,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 16 letters. Loop has 7 letters. [2022-11-21 17:22:32,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:32,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 9 letters. Loop has 14 letters. [2022-11-21 17:22:32,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 17:22:32,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 333 states and 488 transitions. [2022-11-21 17:22:32,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2022-11-21 17:22:32,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 333 states to 277 states and 406 transitions. [2022-11-21 17:22:32,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-11-21 17:22:32,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2022-11-21 17:22:32,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 277 states and 406 transitions. [2022-11-21 17:22:32,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:22:32,509 INFO L218 hiAutomatonCegarLoop]: Abstraction has 277 states and 406 transitions. [2022-11-21 17:22:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states and 406 transitions. [2022-11-21 17:22:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 128. [2022-11-21 17:22:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 1.6484375) internal successors, (211), 127 states have internal predecessors, (211), 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-21 17:22:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 211 transitions. [2022-11-21 17:22:32,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 128 states and 211 transitions. [2022-11-21 17:22:32,526 INFO L428 stractBuchiCegarLoop]: Abstraction has 128 states and 211 transitions. [2022-11-21 17:22:32,526 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-21 17:22:32,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 211 transitions. [2022-11-21 17:22:32,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2022-11-21 17:22:32,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:22:32,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:22:32,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-21 17:22:32,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2022-11-21 17:22:32,533 INFO L748 eck$LassoCheckResult]: Stem: 1968#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1969#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 1992#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 1990#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 1988#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1987#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 1986#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1985#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2066#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2065#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 1978#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 1971#L556-3 [2022-11-21 17:22:32,533 INFO L750 eck$LassoCheckResult]: Loop: 1971#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1972#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 1964#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 1965#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 1975#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2052#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2050#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 1971#L556-3 [2022-11-21 17:22:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:32,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2038480497, now seen corresponding path program 3 times [2022-11-21 17:22:32,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:32,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662411210] [2022-11-21 17:22:32,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:32,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:32,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:32,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash 247318912, now seen corresponding path program 3 times [2022-11-21 17:22:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:32,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110467678] [2022-11-21 17:22:32,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:32,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:32,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:32,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash -693482446, now seen corresponding path program 4 times [2022-11-21 17:22:32,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:32,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821237296] [2022-11-21 17:22:32,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:32,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:33,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:33,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821237296] [2022-11-21 17:22:33,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821237296] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:22:33,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452057448] [2022-11-21 17:22:33,428 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 17:22:33,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:22:33,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:33,431 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:22:33,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-11-21 17:22:33,565 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 17:22:33,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:22:33,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-21 17:22:33,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:33,599 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-21 17:22:33,687 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 17:22:33,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-11-21 17:22:33,867 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-21 17:22:33,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 32 [2022-11-21 17:22:33,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-21 17:22:33,989 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:22:33,990 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 29 treesize of output 17 [2022-11-21 17:22:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:34,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:22:34,476 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 93 treesize of output 81 [2022-11-21 17:22:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:34,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452057448] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:22:34,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:22:34,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2022-11-21 17:22:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550820406] [2022-11-21 17:22:34,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:22:34,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:34,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-21 17:22:34,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-11-21 17:22:34,752 INFO L87 Difference]: Start difference. First operand 128 states and 211 transitions. cyclomatic complexity: 93 Second operand has 28 states, 28 states have (on average 1.5) internal successors, (42), 28 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-21 17:22:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:22:35,630 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2022-11-21 17:22:35,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 208 transitions. [2022-11-21 17:22:35,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-11-21 17:22:35,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 87 states and 120 transitions. [2022-11-21 17:22:35,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-11-21 17:22:35,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-11-21 17:22:35,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 120 transitions. [2022-11-21 17:22:35,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:22:35,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 120 transitions. [2022-11-21 17:22:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 120 transitions. [2022-11-21 17:22:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2022-11-21 17:22:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.411764705882353) internal successors, (96), 67 states have internal predecessors, (96), 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-21 17:22:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2022-11-21 17:22:35,642 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 96 transitions. [2022-11-21 17:22:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 17:22:35,643 INFO L428 stractBuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2022-11-21 17:22:35,643 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-21 17:22:35,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2022-11-21 17:22:35,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2022-11-21 17:22:35,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:22:35,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:22:35,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 17:22:35,646 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 4, 2, 2, 2, 2] [2022-11-21 17:22:35,646 INFO L748 eck$LassoCheckResult]: Stem: 2399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 2398#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 2450#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2448#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2445#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2441#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2431#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2430#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2428#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2427#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2396#L554-3 [2022-11-21 17:22:35,646 INFO L750 eck$LassoCheckResult]: Loop: 2396#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 2405#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2411#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2455#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2403#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2404#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2453#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2439#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2460#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2458#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 2459#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2456#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2409#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2401#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2402#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2454#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2452#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2394#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2396#L554-3 [2022-11-21 17:22:35,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:35,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2038429147, now seen corresponding path program 5 times [2022-11-21 17:22:35,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:35,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335005032] [2022-11-21 17:22:35,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:35,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:35,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:35,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:35,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1300186431, now seen corresponding path program 4 times [2022-11-21 17:22:35,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:35,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112703935] [2022-11-21 17:22:35,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:35,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:37,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:37,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112703935] [2022-11-21 17:22:37,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112703935] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:22:37,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451854540] [2022-11-21 17:22:37,272 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 17:22:37,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:22:37,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:37,275 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:22:37,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-11-21 17:22:37,430 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 17:22:37,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:22:37,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-21 17:22:37,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:37,439 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-21 17:22:37,467 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:37,571 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:22:37,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-11-21 17:22:37,749 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 17:22:37,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-11-21 17:22:37,846 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:22:37,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-11-21 17:22:37,924 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:22:37,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:22:37,997 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 17:22:37,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2022-11-21 17:22:38,063 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:22:38,063 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 29 treesize of output 13 [2022-11-21 17:22:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:38,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:22:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:48,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451854540] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:22:48,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:22:48,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-11-21 17:22:48,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868348697] [2022-11-21 17:22:48,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:22:48,223 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:22:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:48,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-21 17:22:48,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2022-11-21 17:22:48,225 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 33 Second operand has 30 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 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-21 17:22:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:22:49,649 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2022-11-21 17:22:49,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 122 transitions. [2022-11-21 17:22:49,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-11-21 17:22:49,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 85 states and 117 transitions. [2022-11-21 17:22:49,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-11-21 17:22:49,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-11-21 17:22:49,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 117 transitions. [2022-11-21 17:22:49,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:22:49,653 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 117 transitions. [2022-11-21 17:22:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 117 transitions. [2022-11-21 17:22:49,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2022-11-21 17:22:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.394736842105263) internal successors, (106), 75 states have internal predecessors, (106), 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-21 17:22:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2022-11-21 17:22:49,658 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 106 transitions. [2022-11-21 17:22:49,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 17:22:49,667 INFO L428 stractBuchiCegarLoop]: Abstraction has 76 states and 106 transitions. [2022-11-21 17:22:49,667 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-21 17:22:49,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 106 transitions. [2022-11-21 17:22:49,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2022-11-21 17:22:49,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:22:49,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:22:49,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 17:22:49,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 6, 2, 2, 2, 2] [2022-11-21 17:22:49,672 INFO L748 eck$LassoCheckResult]: Stem: 2719#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 2732#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 2742#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2771#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2738#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2739#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2737#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2735#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2736#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2778#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2746#L554-3 [2022-11-21 17:22:49,672 INFO L750 eck$LassoCheckResult]: Loop: 2746#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 2783#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2731#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2728#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2729#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2762#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2789#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2755#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2787#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2756#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2786#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2785#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 2784#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2730#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2782#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2721#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2722#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2788#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2781#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2780#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2779#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2748#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2746#L554-3 [2022-11-21 17:22:49,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2038429147, now seen corresponding path program 6 times [2022-11-21 17:22:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:49,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657094214] [2022-11-21 17:22:49,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:49,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:49,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:49,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:49,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:49,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1398519455, now seen corresponding path program 5 times [2022-11-21 17:22:49,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:49,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592405395] [2022-11-21 17:22:49,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:49,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:51,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:51,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592405395] [2022-11-21 17:22:51,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592405395] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:22:51,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627767100] [2022-11-21 17:22:51,445 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 17:22:51,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:22:51,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:51,451 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:22:51,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-11-21 17:22:51,629 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-21 17:22:51,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:22:51,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-21 17:22:51,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:51,640 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-21 17:22:51,681 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:51,729 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:51,884 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:22:51,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-11-21 17:22:52,137 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 17:22:52,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-11-21 17:22:52,260 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:22:52,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-11-21 17:22:52,355 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:22:52,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:22:52,453 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:22:52,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:22:52,554 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 17:22:52,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2022-11-21 17:22:52,643 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:22:52,643 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 29 treesize of output 13 [2022-11-21 17:22:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 13 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:52,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:22:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:53,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627767100] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:22:53,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:22:53,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 35 [2022-11-21 17:22:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723410025] [2022-11-21 17:22:53,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:22:53,909 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:22:53,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:53,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-21 17:22:53,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=981, Unknown=0, NotChecked=0, Total=1190 [2022-11-21 17:22:53,910 INFO L87 Difference]: Start difference. First operand 76 states and 106 transitions. cyclomatic complexity: 35 Second operand has 35 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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-21 17:22:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:22:55,053 INFO L93 Difference]: Finished difference Result 142 states and 200 transitions. [2022-11-21 17:22:55,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 200 transitions. [2022-11-21 17:22:55,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-11-21 17:22:55,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 138 states and 195 transitions. [2022-11-21 17:22:55,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-11-21 17:22:55,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-11-21 17:22:55,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 195 transitions. [2022-11-21 17:22:55,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:22:55,057 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 195 transitions. [2022-11-21 17:22:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 195 transitions. [2022-11-21 17:22:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2022-11-21 17:22:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 100 states have internal predecessors, (138), 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-21 17:22:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 138 transitions. [2022-11-21 17:22:55,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 138 transitions. [2022-11-21 17:22:55,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 17:22:55,064 INFO L428 stractBuchiCegarLoop]: Abstraction has 101 states and 138 transitions. [2022-11-21 17:22:55,065 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-21 17:22:55,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 138 transitions. [2022-11-21 17:22:55,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-11-21 17:22:55,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:22:55,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:22:55,066 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-21 17:22:55,067 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 8, 2, 2, 2, 2] [2022-11-21 17:22:55,067 INFO L748 eck$LassoCheckResult]: Stem: 3126#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3127#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 3139#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 3154#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 3185#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3183#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3181#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3180#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3179#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3149#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3147#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3148#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 3203#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 3132#L554-3 [2022-11-21 17:22:55,067 INFO L750 eck$LassoCheckResult]: Loop: 3132#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 3133#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 3128#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3129#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3130#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3131#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3220#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3164#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3219#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3158#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3218#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3159#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 3122#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 3123#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 3209#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 3207#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3204#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3205#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3217#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3216#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3215#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3214#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3213#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3212#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3211#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 3144#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 3132#L554-3 [2022-11-21 17:22:55,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash -425271712, now seen corresponding path program 7 times [2022-11-21 17:22:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:55,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082849547] [2022-11-21 17:22:55,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:55,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:55,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:55,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:55,101 INFO L85 PathProgramCache]: Analyzing trace with hash -955419263, now seen corresponding path program 6 times [2022-11-21 17:22:55,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:55,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416796463] [2022-11-21 17:22:55,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:55,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:56,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:56,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416796463] [2022-11-21 17:22:56,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416796463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:22:56,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066521318] [2022-11-21 17:22:56,932 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 17:22:56,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:22:56,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:56,935 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:22:56,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-11-21 17:22:57,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-11-21 17:22:57,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:22:57,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-21 17:22:57,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:22:57,143 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-21 17:22:57,185 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:57,234 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:57,285 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:22:57,454 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:22:57,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-11-21 17:22:57,552 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 0 case distinctions, treesize of input 43 treesize of output 27 [2022-11-21 17:22:57,696 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-21 17:22:57,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-11-21 17:22:57,953 INFO L321 Elim1Store]: treesize reduction 44, result has 47.0 percent of original size [2022-11-21 17:22:57,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 72 [2022-11-21 17:22:58,267 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:22:58,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:22:58,585 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:22:58,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:22:58,880 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:22:58,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:22:59,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:22:59,095 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 45 treesize of output 37 [2022-11-21 17:22:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:59,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:23:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 13 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:01,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066521318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:23:01,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:23:01,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 34 [2022-11-21 17:23:01,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749905604] [2022-11-21 17:23:01,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:23:01,070 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:23:01,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:01,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-21 17:23:01,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2022-11-21 17:23:01,075 INFO L87 Difference]: Start difference. First operand 101 states and 138 transitions. cyclomatic complexity: 42 Second operand has 34 states, 34 states have (on average 1.7941176470588236) 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-21 17:23:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:02,915 INFO L93 Difference]: Finished difference Result 217 states and 307 transitions. [2022-11-21 17:23:02,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 307 transitions. [2022-11-21 17:23:02,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-11-21 17:23:02,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 213 states and 302 transitions. [2022-11-21 17:23:02,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2022-11-21 17:23:02,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2022-11-21 17:23:02,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 302 transitions. [2022-11-21 17:23:02,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:23:02,920 INFO L218 hiAutomatonCegarLoop]: Abstraction has 213 states and 302 transitions. [2022-11-21 17:23:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 302 transitions. [2022-11-21 17:23:02,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 161. [2022-11-21 17:23:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 161 states have (on average 1.4099378881987579) internal successors, (227), 160 states have internal predecessors, (227), 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-21 17:23:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 227 transitions. [2022-11-21 17:23:02,929 INFO L240 hiAutomatonCegarLoop]: Abstraction has 161 states and 227 transitions. [2022-11-21 17:23:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 17:23:02,936 INFO L428 stractBuchiCegarLoop]: Abstraction has 161 states and 227 transitions. [2022-11-21 17:23:02,936 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-21 17:23:02,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 227 transitions. [2022-11-21 17:23:02,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-21 17:23:02,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:23:02,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:23:02,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:02,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 10, 2, 2, 2, 2] [2022-11-21 17:23:02,942 INFO L748 eck$LassoCheckResult]: Stem: 3670#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3671#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 3685#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 3704#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 3715#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3722#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3721#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3713#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3739#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3698#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3699#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3711#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3709#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3710#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 3762#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 3689#L554-3 [2022-11-21 17:23:02,944 INFO L750 eck$LassoCheckResult]: Loop: 3689#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 3794#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 3788#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3681#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3674#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3675#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3823#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3753#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3822#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3726#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3821#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3695#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3803#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3775#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 3798#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 3792#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 3793#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 3811#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3810#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3672#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3673#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3809#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3808#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3807#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3806#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3805#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3802#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3801#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3800#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 3691#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 3689#L554-3 [2022-11-21 17:23:02,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:02,944 INFO L85 PathProgramCache]: Analyzing trace with hash -664170533, now seen corresponding path program 8 times [2022-11-21 17:23:02,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:02,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82774867] [2022-11-21 17:23:02,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:02,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:23:02,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:23:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:23:02,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:23:02,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:02,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1091821791, now seen corresponding path program 7 times [2022-11-21 17:23:02,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:02,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407899668] [2022-11-21 17:23:02,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:02,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 14 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:05,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:05,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407899668] [2022-11-21 17:23:05,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407899668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:23:05,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881851286] [2022-11-21 17:23:05,542 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 17:23:05,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:23:05,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:23:05,546 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:23:05,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-11-21 17:23:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:05,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-21 17:23:05,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:23:05,750 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-21 17:23:05,802 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:05,856 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:05,914 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:05,975 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:06,141 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:06,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-11-21 17:23:06,392 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 17:23:06,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-11-21 17:23:06,522 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:06,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-11-21 17:23:06,619 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:06,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:23:06,711 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:06,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:23:06,808 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:06,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:23:06,921 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:06,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:23:07,027 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 17:23:07,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2022-11-21 17:23:07,126 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:23:07,126 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 29 treesize of output 13 [2022-11-21 17:23:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 29 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:07,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:23:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 26 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:09,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881851286] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:23:09,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:23:09,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 45 [2022-11-21 17:23:09,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849308531] [2022-11-21 17:23:09,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:23:09,154 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:23:09,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-21 17:23:09,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1668, Unknown=0, NotChecked=0, Total=1980 [2022-11-21 17:23:09,156 INFO L87 Difference]: Start difference. First operand 161 states and 227 transitions. cyclomatic complexity: 71 Second operand has 45 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 45 states have internal predecessors, (75), 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-21 17:23:11,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:11,716 INFO L93 Difference]: Finished difference Result 299 states and 423 transitions. [2022-11-21 17:23:11,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 299 states and 423 transitions. [2022-11-21 17:23:11,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2022-11-21 17:23:11,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 299 states to 295 states and 418 transitions. [2022-11-21 17:23:11,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2022-11-21 17:23:11,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2022-11-21 17:23:11,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 418 transitions. [2022-11-21 17:23:11,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:23:11,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 418 transitions. [2022-11-21 17:23:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 418 transitions. [2022-11-21 17:23:11,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 235. [2022-11-21 17:23:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 235 states have (on average 1.4170212765957446) internal successors, (333), 234 states have internal predecessors, (333), 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-21 17:23:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 333 transitions. [2022-11-21 17:23:11,735 INFO L240 hiAutomatonCegarLoop]: Abstraction has 235 states and 333 transitions. [2022-11-21 17:23:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-21 17:23:11,736 INFO L428 stractBuchiCegarLoop]: Abstraction has 235 states and 333 transitions. [2022-11-21 17:23:11,736 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-21 17:23:11,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 333 transitions. [2022-11-21 17:23:11,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-11-21 17:23:11,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:23:11,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:23:11,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:11,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 12, 2, 2, 2, 2] [2022-11-21 17:23:11,740 INFO L748 eck$LassoCheckResult]: Stem: 4400#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4401#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 4415#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 4434#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 4445#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4452#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4451#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4443#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4467#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4468#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4493#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4428#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4429#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4441#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4439#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4440#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 4514#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 4419#L554-3 [2022-11-21 17:23:11,740 INFO L750 eck$LassoCheckResult]: Loop: 4419#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 4564#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 4557#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4410#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4404#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4405#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4628#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4481#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4627#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4474#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4626#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4470#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4625#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4425#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4573#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4542#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 4567#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 4565#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 4566#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 4560#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4561#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4402#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4403#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4606#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4605#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4582#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4579#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4578#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4577#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4576#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4572#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4571#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4570#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 4421#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 4419#L554-3 [2022-11-21 17:23:11,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1682296470, now seen corresponding path program 9 times [2022-11-21 17:23:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:11,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941132725] [2022-11-21 17:23:11,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:11,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:23:11,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:23:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:23:11,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:23:11,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:11,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1381508673, now seen corresponding path program 8 times [2022-11-21 17:23:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:11,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845572402] [2022-11-21 17:23:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:11,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 27 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:15,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:15,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845572402] [2022-11-21 17:23:15,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845572402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:23:15,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156396670] [2022-11-21 17:23:15,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:23:15,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:23:15,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:23:15,136 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:23:15,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-11-21 17:23:15,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:23:15,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:23:15,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-21 17:23:15,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:23:15,320 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-21 17:23:15,368 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:15,420 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:15,472 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:15,523 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:15,578 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:15,722 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:15,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-11-21 17:23:15,792 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 0 case distinctions, treesize of input 43 treesize of output 27 [2022-11-21 17:23:15,894 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-21 17:23:15,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-11-21 17:23:16,067 INFO L321 Elim1Store]: treesize reduction 44, result has 47.0 percent of original size [2022-11-21 17:23:16,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 72 [2022-11-21 17:23:16,326 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:16,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:23:16,539 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:16,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:23:16,713 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:16,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:23:16,963 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:16,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:23:17,142 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:17,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:23:17,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:23:17,342 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 45 treesize of output 37 [2022-11-21 17:23:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 46 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:17,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:23:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 29 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:20,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156396670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:23:20,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:23:20,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 45 [2022-11-21 17:23:20,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384849947] [2022-11-21 17:23:20,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:23:20,552 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:23:20,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:20,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-21 17:23:20,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1684, Unknown=0, NotChecked=0, Total=1980 [2022-11-21 17:23:20,554 INFO L87 Difference]: Start difference. First operand 235 states and 333 transitions. cyclomatic complexity: 103 Second operand has 45 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 45 states have internal predecessors, (80), 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-21 17:23:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:23,759 INFO L93 Difference]: Finished difference Result 389 states and 549 transitions. [2022-11-21 17:23:23,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 389 states and 549 transitions. [2022-11-21 17:23:23,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-11-21 17:23:23,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 389 states to 385 states and 544 transitions. [2022-11-21 17:23:23,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-11-21 17:23:23,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-11-21 17:23:23,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 385 states and 544 transitions. [2022-11-21 17:23:23,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:23:23,766 INFO L218 hiAutomatonCegarLoop]: Abstraction has 385 states and 544 transitions. [2022-11-21 17:23:23,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states and 544 transitions. [2022-11-21 17:23:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 317. [2022-11-21 17:23:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 317 states have (on average 1.416403785488959) internal successors, (449), 316 states have internal predecessors, (449), 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-21 17:23:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 449 transitions. [2022-11-21 17:23:23,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 317 states and 449 transitions. [2022-11-21 17:23:23,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-21 17:23:23,780 INFO L428 stractBuchiCegarLoop]: Abstraction has 317 states and 449 transitions. [2022-11-21 17:23:23,780 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-21 17:23:23,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 317 states and 449 transitions. [2022-11-21 17:23:23,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-11-21 17:23:23,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:23:23,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:23:23,784 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:23,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 14, 2, 2, 2, 2] [2022-11-21 17:23:23,784 INFO L748 eck$LassoCheckResult]: Stem: 5324#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5325#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 5340#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 5357#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 5368#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5375#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5374#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5366#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5390#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5391#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5416#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5417#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5430#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5353#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5354#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5364#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5362#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5363#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 5472#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 5344#L554-3 [2022-11-21 17:23:23,785 INFO L750 eck$LassoCheckResult]: Loop: 5344#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 5337#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 5338#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5334#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5335#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5465#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5595#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5474#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5562#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5404#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5540#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5397#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5536#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5393#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5535#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5351#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5534#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5352#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 5319#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 5320#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 5332#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 5529#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5523#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5524#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5634#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5328#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5327#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5336#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5633#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5632#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5631#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5630#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5629#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5628#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5617#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5627#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5626#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 5346#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 5344#L554-3 [2022-11-21 17:23:23,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:23,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1779255953, now seen corresponding path program 10 times [2022-11-21 17:23:23,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:23,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528929777] [2022-11-21 17:23:23,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:23,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:23:23,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:23:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:23:23,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:23:23,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash -162436383, now seen corresponding path program 9 times [2022-11-21 17:23:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:23,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386886914] [2022-11-21 17:23:23,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:23,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 41 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:27,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:27,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386886914] [2022-11-21 17:23:27,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386886914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:23:27,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790326360] [2022-11-21 17:23:27,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 17:23:27,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:23:27,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:23:27,702 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:23:27,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-11-21 17:23:28,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-11-21 17:23:28,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:23:28,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-21 17:23:28,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:23:28,060 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-21 17:23:28,112 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:28,160 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:28,213 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:28,272 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:28,334 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:28,404 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:28,585 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:28,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-11-21 17:23:28,665 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 0 case distinctions, treesize of input 43 treesize of output 27 [2022-11-21 17:23:28,776 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-21 17:23:28,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-11-21 17:23:28,976 INFO L321 Elim1Store]: treesize reduction 44, result has 47.0 percent of original size [2022-11-21 17:23:28,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 72 [2022-11-21 17:23:29,306 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:29,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:23:29,538 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:29,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:23:29,727 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:29,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:23:29,903 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:29,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:23:30,113 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:30,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:23:30,308 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:30,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:23:30,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:23:30,511 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 45 treesize of output 37 [2022-11-21 17:23:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 60 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:30,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:23:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 40 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:47,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790326360] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:23:47,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:23:47,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 21] total 51 [2022-11-21 17:23:47,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131507907] [2022-11-21 17:23:47,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:23:47,380 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:23:47,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:47,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-21 17:23:47,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=2157, Unknown=0, NotChecked=0, Total=2550 [2022-11-21 17:23:47,381 INFO L87 Difference]: Start difference. First operand 317 states and 449 transitions. cyclomatic complexity: 137 Second operand has 51 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 51 states have internal predecessors, (93), 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-21 17:23:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:50,667 INFO L93 Difference]: Finished difference Result 487 states and 685 transitions. [2022-11-21 17:23:50,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 487 states and 685 transitions. [2022-11-21 17:23:50,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2022-11-21 17:23:50,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 487 states to 483 states and 680 transitions. [2022-11-21 17:23:50,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2022-11-21 17:23:50,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2022-11-21 17:23:50,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 680 transitions. [2022-11-21 17:23:50,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:23:50,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 483 states and 680 transitions. [2022-11-21 17:23:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 680 transitions. [2022-11-21 17:23:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 407. [2022-11-21 17:23:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 407 states have (on average 1.4127764127764129) internal successors, (575), 406 states have internal predecessors, (575), 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-21 17:23:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 575 transitions. [2022-11-21 17:23:50,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 407 states and 575 transitions. [2022-11-21 17:23:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-21 17:23:50,690 INFO L428 stractBuchiCegarLoop]: Abstraction has 407 states and 575 transitions. [2022-11-21 17:23:50,690 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-21 17:23:50,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 407 states and 575 transitions. [2022-11-21 17:23:50,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2022-11-21 17:23:50,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:23:50,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:23:50,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:50,694 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 16, 2, 2, 2, 2] [2022-11-21 17:23:50,694 INFO L748 eck$LassoCheckResult]: Stem: 6462#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6463#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 6479#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 6496#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 6507#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6514#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6513#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6505#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6529#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6530#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6555#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6556#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6570#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6571#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6605#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6492#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6493#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6503#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6501#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6502#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 6652#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 6483#L554-3 [2022-11-21 17:23:50,695 INFO L750 eck$LassoCheckResult]: Loop: 6483#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 6475#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 6476#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6853#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6824#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6646#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6822#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6642#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6786#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6608#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6753#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6543#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6731#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6536#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6727#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6532#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6726#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6489#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6725#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6490#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 6723#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 6724#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 6825#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 6719#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6709#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6710#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6863#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6466#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6465#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6474#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6862#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6861#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6860#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6859#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6858#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6857#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6856#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6855#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6838#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6854#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6472#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 6473#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 6483#L554-3 [2022-11-21 17:23:50,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash 468038604, now seen corresponding path program 11 times [2022-11-21 17:23:50,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:50,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234540956] [2022-11-21 17:23:50,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:23:50,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:23:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:23:50,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:23:50,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash 213896449, now seen corresponding path program 10 times [2022-11-21 17:23:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:50,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949675423] [2022-11-21 17:23:50,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:50,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 41 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949675423] [2022-11-21 17:23:54,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949675423] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:23:54,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133256254] [2022-11-21 17:23:54,511 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 17:23:54,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:23:54,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:23:54,514 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:23:54,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-11-21 17:23:54,702 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 17:23:54,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:23:54,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-21 17:23:54,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:23:54,713 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-21 17:23:54,754 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:54,801 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:54,852 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:54,902 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:54,953 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:55,008 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:55,063 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:23:55,242 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:23:55,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-11-21 17:23:55,509 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 17:23:55,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-11-21 17:23:55,640 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:55,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-11-21 17:23:55,729 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:55,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:23:55,814 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:55,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:23:55,913 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:55,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:23:56,014 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:56,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:23:56,128 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:56,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:23:56,238 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:56,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:23:56,346 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:23:56,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:23:56,457 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 17:23:56,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2022-11-21 17:23:56,556 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:23:56,556 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 29 treesize of output 13 [2022-11-21 17:23:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 68 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:56,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:24:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 62 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:00,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133256254] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:24:00,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:24:00,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 60 [2022-11-21 17:24:00,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793515521] [2022-11-21 17:24:00,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:24:00,809 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:24:00,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:24:00,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-21 17:24:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=2976, Unknown=0, NotChecked=0, Total=3540 [2022-11-21 17:24:00,811 INFO L87 Difference]: Start difference. First operand 407 states and 575 transitions. cyclomatic complexity: 173 Second operand has 60 states, 60 states have (on average 1.75) internal successors, (105), 60 states have internal predecessors, (105), 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-21 17:24:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:24:04,030 INFO L93 Difference]: Finished difference Result 593 states and 831 transitions. [2022-11-21 17:24:04,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 593 states and 831 transitions. [2022-11-21 17:24:04,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-11-21 17:24:04,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 593 states to 589 states and 826 transitions. [2022-11-21 17:24:04,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-11-21 17:24:04,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-11-21 17:24:04,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 589 states and 826 transitions. [2022-11-21 17:24:04,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:24:04,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 589 states and 826 transitions. [2022-11-21 17:24:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states and 826 transitions. [2022-11-21 17:24:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 505. [2022-11-21 17:24:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 505 states have (on average 1.4079207920792078) internal successors, (711), 504 states have internal predecessors, (711), 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-21 17:24:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 711 transitions. [2022-11-21 17:24:04,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 505 states and 711 transitions. [2022-11-21 17:24:04,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-21 17:24:04,051 INFO L428 stractBuchiCegarLoop]: Abstraction has 505 states and 711 transitions. [2022-11-21 17:24:04,051 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-21 17:24:04,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 505 states and 711 transitions. [2022-11-21 17:24:04,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-11-21 17:24:04,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:24:04,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:24:04,054 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 1, 1, 1, 1, 1, 1] [2022-11-21 17:24:04,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 18, 2, 2, 2, 2] [2022-11-21 17:24:04,055 INFO L748 eck$LassoCheckResult]: Stem: 7835#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7836#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 7850#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 7869#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 7882#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7889#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7888#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7880#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7902#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7903#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7926#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7927#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7943#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7944#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7978#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7979#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8016#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7865#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7866#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7862#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7860#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7861#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 8065#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 8066#L554-3 [2022-11-21 17:24:04,055 INFO L750 eck$LassoCheckResult]: Loop: 8066#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 8144#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 8134#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7845#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7839#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7840#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8333#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8069#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8332#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8019#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8331#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7982#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8330#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7930#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8329#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7909#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8328#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7905#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8327#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7874#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8153#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7875#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 8147#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 8145#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 8146#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 8140#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8141#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7837#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7838#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8299#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8298#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8258#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8257#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8221#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8220#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8187#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8186#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8163#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8160#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8159#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8158#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8157#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8151#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8150#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8152#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 8304#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 8066#L554-3 [2022-11-21 17:24:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1186416057, now seen corresponding path program 12 times [2022-11-21 17:24:04,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:24:04,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111941858] [2022-11-21 17:24:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:24:04,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:24:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:24:04,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:24:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:24:04,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:24:04,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1703727967, now seen corresponding path program 11 times [2022-11-21 17:24:04,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:24:04,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940053532] [2022-11-21 17:24:04,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:24:04,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:24:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:24:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 66 proven. 317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:24:08,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940053532] [2022-11-21 17:24:08,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940053532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:24:08,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127183567] [2022-11-21 17:24:08,021 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 17:24:08,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:24:08,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:24:08,025 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:24:08,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-11-21 17:24:08,690 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-11-21 17:24:08,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:24:08,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-21 17:24:08,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:24:08,706 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-21 17:24:08,749 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:08,797 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:08,847 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:08,905 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:08,957 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:09,012 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:09,069 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:09,128 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:09,307 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:24:09,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-11-21 17:24:09,563 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 17:24:09,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-11-21 17:24:09,691 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:24:09,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-11-21 17:24:09,775 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:24:09,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:24:09,876 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:24:09,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:24:09,969 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:24:09,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:24:10,054 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:24:10,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:24:10,147 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:24:10,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:24:10,242 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:24:10,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:24:10,343 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:24:10,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:24:10,457 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:24:10,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:24:10,560 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 17:24:10,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2022-11-21 17:24:10,656 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:24:10,656 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 29 treesize of output 13 [2022-11-21 17:24:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 85 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:10,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:24:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 78 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:15,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127183567] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:24:15,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:24:15,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 63 [2022-11-21 17:24:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719440437] [2022-11-21 17:24:15,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:24:15,398 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:24:15,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:24:15,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-21 17:24:15,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=3270, Unknown=0, NotChecked=0, Total=3906 [2022-11-21 17:24:15,399 INFO L87 Difference]: Start difference. First operand 505 states and 711 transitions. cyclomatic complexity: 211 Second operand has 63 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 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-21 17:24:18,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:24:18,364 INFO L93 Difference]: Finished difference Result 707 states and 987 transitions. [2022-11-21 17:24:18,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 707 states and 987 transitions. [2022-11-21 17:24:18,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2022-11-21 17:24:18,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 707 states to 703 states and 982 transitions. [2022-11-21 17:24:18,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 200 [2022-11-21 17:24:18,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 200 [2022-11-21 17:24:18,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 703 states and 982 transitions. [2022-11-21 17:24:18,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:24:18,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 703 states and 982 transitions. [2022-11-21 17:24:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states and 982 transitions. [2022-11-21 17:24:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 611. [2022-11-21 17:24:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 611 states have (on average 1.4026186579378068) internal successors, (857), 610 states have internal predecessors, (857), 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-21 17:24:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 857 transitions. [2022-11-21 17:24:18,388 INFO L240 hiAutomatonCegarLoop]: Abstraction has 611 states and 857 transitions. [2022-11-21 17:24:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-21 17:24:18,389 INFO L428 stractBuchiCegarLoop]: Abstraction has 611 states and 857 transitions. [2022-11-21 17:24:18,389 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-21 17:24:18,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 611 states and 857 transitions. [2022-11-21 17:24:18,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2022-11-21 17:24:18,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:24:18,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:24:18,393 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1, 1, 1, 1, 1] [2022-11-21 17:24:18,393 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 20, 2, 2, 2, 2] [2022-11-21 17:24:18,393 INFO L748 eck$LassoCheckResult]: Stem: 9453#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9454#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 9469#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 9488#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 9499#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9506#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9505#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9497#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9521#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9522#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9547#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9548#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9562#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9563#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9597#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9598#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9636#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9637#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9679#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9483#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9484#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9495#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9493#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9494#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 9733#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 9734#L554-3 [2022-11-21 17:24:18,394 INFO L750 eck$LassoCheckResult]: Loop: 9734#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 9465#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 9466#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9463#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9457#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9458#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10056#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9724#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10055#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9682#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10054#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9640#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10053#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9601#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10052#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9535#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10051#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9528#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10050#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9524#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10049#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9480#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10025#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9776#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 10017#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 9818#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 9819#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 9813#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9814#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9455#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9456#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10016#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10015#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9971#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9970#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9930#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9929#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9893#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9892#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9859#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9858#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9833#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9832#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9831#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9830#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9829#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9824#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9823#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9825#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 10019#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 9734#L554-3 [2022-11-21 17:24:18,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 13 times [2022-11-21 17:24:18,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:24:18,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184973756] [2022-11-21 17:24:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:24:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:24:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:24:18,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:24:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:24:18,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:24:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:18,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2099472833, now seen corresponding path program 12 times [2022-11-21 17:24:18,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:24:18,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171047914] [2022-11-21 17:24:18,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:24:18,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:24:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:24:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 69 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:22,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:24:22,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171047914] [2022-11-21 17:24:22,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171047914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:24:22,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394809694] [2022-11-21 17:24:22,841 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 17:24:22,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:24:22,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:24:22,848 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:24:22,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-11-21 17:24:23,612 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-11-21 17:24:23,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:24:23,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-21 17:24:23,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:24:23,627 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-21 17:24:23,673 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:23,723 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:23,776 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:23,831 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:23,886 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:23,946 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:24,004 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:24,060 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:24,117 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:24:24,292 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:24:24,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-11-21 17:24:24,361 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 0 case distinctions, treesize of input 43 treesize of output 27 [2022-11-21 17:24:24,464 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-21 17:24:24,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-11-21 17:24:24,682 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:24:24,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 54 [2022-11-21 17:24:24,909 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:24:24,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:24:25,102 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:24:25,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:24:25,268 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:24:25,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:24:25,440 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:24:25,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:24:25,673 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:24:25,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:24:25,843 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:24:25,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:24:26,046 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:24:26,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:24:26,269 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:24:26,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:24:26,457 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:24:26,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:24:26,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:24:26,629 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 45 treesize of output 37 [2022-11-21 17:24:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 114 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:26,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:25:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 85 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:34,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394809694] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:25:34,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:25:34,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 65 [2022-11-21 17:25:34,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529784262] [2022-11-21 17:25:34,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:25:34,125 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:25:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-21 17:25:34,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=3519, Unknown=2, NotChecked=0, Total=4160 [2022-11-21 17:25:34,127 INFO L87 Difference]: Start difference. First operand 611 states and 857 transitions. cyclomatic complexity: 251 Second operand has 65 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 65 states have internal predecessors, (123), 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-21 17:25:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:39,011 INFO L93 Difference]: Finished difference Result 829 states and 1153 transitions. [2022-11-21 17:25:39,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 829 states and 1153 transitions. [2022-11-21 17:25:39,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2022-11-21 17:25:39,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 829 states to 825 states and 1148 transitions. [2022-11-21 17:25:39,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226 [2022-11-21 17:25:39,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2022-11-21 17:25:39,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 825 states and 1148 transitions. [2022-11-21 17:25:39,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:25:39,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 825 states and 1148 transitions. [2022-11-21 17:25:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states and 1148 transitions. [2022-11-21 17:25:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 725. [2022-11-21 17:25:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 725 states have (on average 1.3972413793103449) internal successors, (1013), 724 states have internal predecessors, (1013), 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-21 17:25:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1013 transitions. [2022-11-21 17:25:39,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 725 states and 1013 transitions. [2022-11-21 17:25:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-21 17:25:39,039 INFO L428 stractBuchiCegarLoop]: Abstraction has 725 states and 1013 transitions. [2022-11-21 17:25:39,039 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-21 17:25:39,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 725 states and 1013 transitions. [2022-11-21 17:25:39,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-11-21 17:25:39,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:25:39,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:25:39,043 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:39,043 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 22, 2, 2, 2, 2] [2022-11-21 17:25:39,044 INFO L748 eck$LassoCheckResult]: Stem: 11329#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11330#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 11344#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 11363#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 11375#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11382#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11381#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11373#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11395#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11396#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11419#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11420#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11436#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11437#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11471#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11472#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11510#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11511#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11553#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11554#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11639#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11359#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11360#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11356#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11354#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11355#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 11737#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 11738#L554-3 [2022-11-21 17:25:39,044 INFO L750 eck$LassoCheckResult]: Loop: 11738#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 11754#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 11744#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11339#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11333#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11334#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12047#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11626#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12046#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11589#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12045#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11557#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12044#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11514#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12043#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11475#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12042#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11423#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12041#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11402#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12040#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11398#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12039#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11369#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12009#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11368#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 12003#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 11753#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 11755#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 11749#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11750#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11331#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11332#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12002#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12001#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11953#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11952#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11908#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11907#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11867#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11866#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11830#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11829#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11796#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11795#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11770#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11769#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11768#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11767#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11766#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11760#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11761#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12008#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 12006#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 11738#L554-3 [2022-11-21 17:25:39,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:39,044 INFO L85 PathProgramCache]: Analyzing trace with hash 423190269, now seen corresponding path program 14 times [2022-11-21 17:25:39,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:39,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184449168] [2022-11-21 17:25:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:39,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:25:39,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:25:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:25:39,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:25:39,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:39,090 INFO L85 PathProgramCache]: Analyzing trace with hash 561013857, now seen corresponding path program 13 times [2022-11-21 17:25:39,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:39,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207248447] [2022-11-21 17:25:39,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:39,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 86 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:43,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:43,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207248447] [2022-11-21 17:25:43,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207248447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:25:43,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53988550] [2022-11-21 17:25:43,768 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 17:25:43,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:25:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:25:43,771 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:25:43,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-11-21 17:25:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:44,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-21 17:25:44,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:25:44,033 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-21 17:25:44,096 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:25:44,151 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:25:44,212 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:25:44,274 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:25:44,355 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:25:44,438 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:25:44,526 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:25:44,618 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:25:44,706 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:25:44,798 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:25:45,056 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:25:45,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-11-21 17:25:45,382 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 17:25:45,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-11-21 17:25:45,533 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:25:45,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-11-21 17:25:45,645 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:25:45,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:25:45,739 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:25:45,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:25:45,846 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:25:45,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:25:45,954 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:25:45,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:25:46,065 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:25:46,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:25:46,180 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:25:46,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:25:46,294 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:25:46,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:25:46,405 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:25:46,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:25:46,510 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:25:46,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:25:46,629 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:25:46,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 17:25:46,791 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 17:25:46,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2022-11-21 17:25:46,931 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:25:46,932 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 29 treesize of output 13 [2022-11-21 17:25:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 125 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:47,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:26:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 116 proven. 439 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:01,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53988550] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:26:01,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:26:01,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 75 [2022-11-21 17:26:01,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478774042] [2022-11-21 17:26:01,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:26:01,867 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:26:01,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:26:01,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-21 17:26:01,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=873, Invalid=4677, Unknown=0, NotChecked=0, Total=5550 [2022-11-21 17:26:01,870 INFO L87 Difference]: Start difference. First operand 725 states and 1013 transitions. cyclomatic complexity: 293 Second operand has 75 states, 75 states have (on average 1.8) internal successors, (135), 75 states have internal predecessors, (135), 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-21 17:26:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:06,730 INFO L93 Difference]: Finished difference Result 959 states and 1329 transitions. [2022-11-21 17:26:06,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 959 states and 1329 transitions. [2022-11-21 17:26:06,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-11-21 17:26:06,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 959 states to 955 states and 1324 transitions. [2022-11-21 17:26:06,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2022-11-21 17:26:06,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2022-11-21 17:26:06,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 955 states and 1324 transitions. [2022-11-21 17:26:06,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:26:06,739 INFO L218 hiAutomatonCegarLoop]: Abstraction has 955 states and 1324 transitions. [2022-11-21 17:26:06,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states and 1324 transitions. [2022-11-21 17:26:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 847. [2022-11-21 17:26:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 847 states have (on average 1.3919716646989375) internal successors, (1179), 846 states have internal predecessors, (1179), 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-21 17:26:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1179 transitions. [2022-11-21 17:26:06,758 INFO L240 hiAutomatonCegarLoop]: Abstraction has 847 states and 1179 transitions. [2022-11-21 17:26:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-21 17:26:06,759 INFO L428 stractBuchiCegarLoop]: Abstraction has 847 states and 1179 transitions. [2022-11-21 17:26:06,759 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-21 17:26:06,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 847 states and 1179 transitions. [2022-11-21 17:26:06,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-11-21 17:26:06,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:26:06,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:26:06,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 1, 1, 1, 1, 1, 1] [2022-11-21 17:26:06,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [26, 24, 2, 2, 2, 2] [2022-11-21 17:26:06,764 INFO L748 eck$LassoCheckResult]: Stem: 13491#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13492#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 13506#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 13524#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 13535#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13542#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13541#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13533#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13557#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13558#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13583#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13584#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13598#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13599#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13633#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13634#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13672#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13673#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13715#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13716#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13796#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13798#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13846#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13520#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13521#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13531#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13529#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13530#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 13963#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 13964#L554-3 [2022-11-21 17:26:06,764 INFO L750 eck$LassoCheckResult]: Loop: 13964#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 13503#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 13504#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13501#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13495#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13496#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14330#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13833#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14329#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13788#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14328#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13751#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14327#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13719#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14326#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13676#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14325#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13637#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14324#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13571#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14323#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13564#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14322#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13560#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14321#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13518#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13985#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13517#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 13981#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 13979#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 13980#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 13975#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13976#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13493#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13494#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14276#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14275#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14223#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14222#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14176#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14173#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14129#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14128#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14088#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14087#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14051#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14050#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14017#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14016#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13991#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13990#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13989#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13988#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13987#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13984#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13983#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13982#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 13513#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 13964#L554-3 [2022-11-21 17:26:06,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1335993032, now seen corresponding path program 15 times [2022-11-21 17:26:06,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:06,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324676569] [2022-11-21 17:26:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:26:06,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:26:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:26:06,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:26:06,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:06,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1193149311, now seen corresponding path program 14 times [2022-11-21 17:26:06,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:06,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314071737] [2022-11-21 17:26:06,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:06,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 123 proven. 530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:11,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:11,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314071737] [2022-11-21 17:26:11,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314071737] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:26:11,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560734732] [2022-11-21 17:26:11,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:26:11,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:26:11,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:26:11,605 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:26:11,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-11-21 17:26:11,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:26:11,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:26:11,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-21 17:26:11,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:26:11,895 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-21 17:26:11,953 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:26:12,015 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:26:12,079 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:26:12,144 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:26:12,219 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:26:12,288 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:26:12,364 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:26:12,437 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:26:12,511 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:26:12,586 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:26:12,665 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 17:26:12,892 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:12,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-11-21 17:26:12,973 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 0 case distinctions, treesize of input 43 treesize of output 27 [2022-11-21 17:26:13,099 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-21 17:26:13,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-11-21 17:26:13,334 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:13,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 54 [2022-11-21 17:26:13,536 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:13,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:26:13,814 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:13,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:26:14,101 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:14,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:26:14,355 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:14,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:26:14,642 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:14,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:26:14,913 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:14,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:26:15,142 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:15,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:26:15,455 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:15,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:26:15,682 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:15,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:26:15,981 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:15,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:26:16,248 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-11-21 17:26:16,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-11-21 17:26:16,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:16,455 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 45 treesize of output 37 [2022-11-21 17:26:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 160 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:16,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:26:39,638 WARN L233 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:28:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 125 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:28:02,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560734732] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:28:02,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:28:02,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 73 [2022-11-21 17:28:02,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203605766] [2022-11-21 17:28:02,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:28:02,638 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:28:02,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:02,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-21 17:28:02,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=4427, Unknown=2, NotChecked=0, Total=5256 [2022-11-21 17:28:02,640 INFO L87 Difference]: Start difference. First operand 847 states and 1179 transitions. cyclomatic complexity: 337 Second operand has 73 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 73 states have internal predecessors, (138), 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-21 17:28:08,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:28:08,852 INFO L93 Difference]: Finished difference Result 1097 states and 1515 transitions. [2022-11-21 17:28:08,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1097 states and 1515 transitions. [2022-11-21 17:28:08,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-21 17:28:08,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1097 states to 1093 states and 1510 transitions. [2022-11-21 17:28:08,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2022-11-21 17:28:08,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 278 [2022-11-21 17:28:08,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1093 states and 1510 transitions. [2022-11-21 17:28:08,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 17:28:08,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1093 states and 1510 transitions. [2022-11-21 17:28:08,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states and 1510 transitions. [2022-11-21 17:28:08,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 977. [2022-11-21 17:28:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 977 states have (on average 1.3868986693961105) internal successors, (1355), 976 states have internal predecessors, (1355), 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-21 17:28:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1355 transitions. [2022-11-21 17:28:08,883 INFO L240 hiAutomatonCegarLoop]: Abstraction has 977 states and 1355 transitions. [2022-11-21 17:28:08,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-21 17:28:08,885 INFO L428 stractBuchiCegarLoop]: Abstraction has 977 states and 1355 transitions. [2022-11-21 17:28:08,885 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-21 17:28:08,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 977 states and 1355 transitions. [2022-11-21 17:28:08,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-11-21 17:28:08,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:28:08,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:28:08,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 1, 1, 1, 1, 1, 1] [2022-11-21 17:28:08,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [28, 26, 2, 2, 2, 2] [2022-11-21 17:28:08,889 INFO L748 eck$LassoCheckResult]: Stem: 15941#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15942#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 15956#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 15975#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 15986#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15993#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 15992#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15984#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16008#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16009#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16034#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16035#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16049#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16050#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16085#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16086#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16126#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16127#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16169#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16170#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16250#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16252#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16299#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16300#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16345#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15970#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 15971#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15982#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 15980#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15981#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 16481#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 16482#L554-3 [2022-11-21 17:28:08,889 INFO L750 eck$LassoCheckResult]: Loop: 16482#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 16499#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 16491#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15951#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 15945#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15946#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16911#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16336#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16910#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16287#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16909#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16242#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16908#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16205#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16907#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16173#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16906#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16130#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16905#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16089#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16904#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16022#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16903#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16015#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16902#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16011#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16901#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15967#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16510#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15969#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 16504#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 16500#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 16501#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 16495#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16496#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 15943#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15944#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16858#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16857#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16803#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16802#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16752#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16749#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16701#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16700#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16656#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16655#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16615#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16614#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16578#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16577#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16544#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16543#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16518#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16517#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16516#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16515#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16514#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16508#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16876#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16875#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 16860#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 16482#L554-3 [2022-11-21 17:28:08,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:08,890 INFO L85 PathProgramCache]: Analyzing trace with hash 305969331, now seen corresponding path program 16 times [2022-11-21 17:28:08,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:08,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122182832] [2022-11-21 17:28:08,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:08,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:28:08,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:28:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:28:08,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:28:08,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:28:08,943 INFO L85 PathProgramCache]: Analyzing trace with hash -270003679, now seen corresponding path program 15 times [2022-11-21 17:28:08,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:28:08,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518317599] [2022-11-21 17:28:08,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:28:08,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:28:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:28:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 146 proven. 613 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:28:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:28:14,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518317599] [2022-11-21 17:28:14,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518317599] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:28:14,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627183333] [2022-11-21 17:28:14,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 17:28:14,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:28:14,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:28:14,647 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:28:14,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5560195e-c619-4f96-9485-79dc0674c464/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-11-21 17:28:16,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-11-21 17:28:16,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:28:16,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-21 17:28:16,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:28:16,050 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-21 17:28:16,113 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:28:16,175 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:28:16,254 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:28:16,333 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:28:16,404 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:28:16,479 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:28:16,555 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:28:16,636 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:28:16,717 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:28:16,803 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:28:16,891 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:28:16,980 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:28:17,240 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-21 17:28:17,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 43 [2022-11-21 17:28:17,701 INFO L321 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2022-11-21 17:28:17,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 39 [2022-11-21 17:28:17,895 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 17:28:17,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2022-11-21 17:28:18,021 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-21 17:28:18,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-21 17:28:18,149 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-21 17:28:18,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-21 17:28:18,280 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-21 17:28:18,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-21 17:28:18,402 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-21 17:28:18,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-21 17:28:18,540 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-21 17:28:18,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-21 17:28:18,677 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-21 17:28:18,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-21 17:28:18,813 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-21 17:28:18,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-21 17:28:18,968 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-21 17:28:18,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-21 17:28:19,203 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-21 17:28:19,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-21 17:28:19,360 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-21 17:28:19,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-21 17:28:19,519 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-21 17:28:19,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-21 17:28:19,679 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-21 17:28:19,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-21 17:28:19,859 INFO L321 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2022-11-21 17:28:19,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 35 [2022-11-21 17:28:20,001 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:28:20,001 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 44 treesize of output 16 [2022-11-21 17:28:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 29 proven. 730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:28:20,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:28:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 31 proven. 728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:28:27,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627183333] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:28:27,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:28:27,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 35] total 83 [2022-11-21 17:28:27,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864238957] [2022-11-21 17:28:27,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:28:27,434 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:28:27,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:28:27,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-21 17:28:27,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1073, Invalid=5733, Unknown=0, NotChecked=0, Total=6806 [2022-11-21 17:28:27,437 INFO L87 Difference]: Start difference. First operand 977 states and 1355 transitions. cyclomatic complexity: 383 Second operand has 83 states, 83 states have (on average 1.8313253012048192) internal successors, (152), 83 states have internal predecessors, (152), 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-21 17:29:24,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:29:26,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:29:27,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:29:59,744 WARN L233 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:30:02,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:30:07,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:30:11,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:30:12,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:30:15,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:30:17,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:30:18,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:30:52,712 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:32:08,129 WARN L233 SmtUtils]: Spent 19.57s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:32:11,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:12,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:14,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:16,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:19,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:20,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:23,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:25,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:27,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:32,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:35,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:37,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:40,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:41,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:44,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:46,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:49,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:50,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:53,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:32:56,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:00,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:02,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:05,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:07,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:09,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:10,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:12,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:13,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:14,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:17,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:20,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:22,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:25,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:26,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:29,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:30,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:35,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:36,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:40,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:42,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:43,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:45,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:33:46,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:09,840 WARN L233 SmtUtils]: Spent 25.05s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:35:11,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:13,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:15,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:17,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:18,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:23,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:27,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:31,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:33,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:37,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:38,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:42,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:53,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:56,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:35:59,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:04,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:09,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:11,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:13,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:17,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:26,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:27,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:36:29,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]