./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:42:29,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:42:29,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:42:29,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:42:29,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:42:29,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:42:29,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:42:29,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:42:29,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:42:29,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:42:29,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:42:29,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:42:29,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:42:29,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:42:29,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:42:29,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:42:29,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:42:29,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:42:29,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:42:29,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:42:29,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:42:29,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:42:29,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:42:29,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:42:29,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:42:29,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:42:29,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:42:29,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:42:29,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:42:29,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:42:29,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:42:29,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:42:29,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:42:29,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:42:29,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:42:29,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:42:29,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:42:29,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:42:29,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:42:29,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:42:29,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:42:29,917 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-25 17:42:29,972 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:42:29,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:42:29,975 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:42:29,975 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:42:29,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:42:29,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:42:29,978 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:42:29,978 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-25 17:42:29,978 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-25 17:42:29,979 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-25 17:42:29,980 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-25 17:42:29,981 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-25 17:42:29,981 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-25 17:42:29,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:42:29,981 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:42:29,982 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:42:29,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:42:29,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:42:29,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:42:29,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-25 17:42:29,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-25 17:42:29,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-25 17:42:29,984 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:42:29,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:42:29,984 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-25 17:42:29,984 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:42:29,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-25 17:42:29,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:42:29,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:42:29,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:42:29,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:42:29,989 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-25 17:42:29,989 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_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2022-11-25 17:42:30,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:42:30,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:42:30,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:42:30,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:42:30,481 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:42:30,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-11-25 17:42:34,055 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:42:34,309 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:42:34,309 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-11-25 17:42:34,322 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/data/4b379cb84/b32a4307f01a4ca385c56fafe32474d2/FLAG34364863e [2022-11-25 17:42:34,353 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/data/4b379cb84/b32a4307f01a4ca385c56fafe32474d2 [2022-11-25 17:42:34,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:42:34,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:42:34,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:42:34,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:42:34,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:42:34,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:42:34" (1/1) ... [2022-11-25 17:42:34,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764688fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:34, skipping insertion in model container [2022-11-25 17:42:34,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:42:34" (1/1) ... [2022-11-25 17:42:34,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:42:34,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:42:34,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:42:34,953 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:42:35,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:42:35,073 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:42:35,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35 WrapperNode [2022-11-25 17:42:35,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:42:35,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:42:35,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:42:35,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:42:35,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35" (1/1) ... [2022-11-25 17:42:35,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35" (1/1) ... [2022-11-25 17:42:35,172 INFO L138 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2022-11-25 17:42:35,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:42:35,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:42:35,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:42:35,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:42:35,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35" (1/1) ... [2022-11-25 17:42:35,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35" (1/1) ... [2022-11-25 17:42:35,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35" (1/1) ... [2022-11-25 17:42:35,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35" (1/1) ... [2022-11-25 17:42:35,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35" (1/1) ... [2022-11-25 17:42:35,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35" (1/1) ... [2022-11-25 17:42:35,216 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35" (1/1) ... [2022-11-25 17:42:35,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35" (1/1) ... [2022-11-25 17:42:35,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:42:35,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:42:35,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:42:35,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:42:35,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35" (1/1) ... [2022-11-25 17:42:35,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:35,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:35,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:35,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-25 17:42:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:42:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:42:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:42:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:42:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:42:35,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:42:35,510 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:42:35,513 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:42:35,864 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:42:35,871 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:42:35,871 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-25 17:42:35,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:42:35 BoogieIcfgContainer [2022-11-25 17:42:35,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:42:35,875 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-25 17:42:35,875 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-25 17:42:35,879 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-25 17:42:35,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 17:42:35,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 05:42:34" (1/3) ... [2022-11-25 17:42:35,882 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@520d22f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 05:42:35, skipping insertion in model container [2022-11-25 17:42:35,882 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 17:42:35,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:42:35" (2/3) ... [2022-11-25 17:42:35,883 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@520d22f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 05:42:35, skipping insertion in model container [2022-11-25 17:42:35,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 17:42:35,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:42:35" (3/3) ... [2022-11-25 17:42:35,885 INFO L332 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2022-11-25 17:42:35,959 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-25 17:42:35,959 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-25 17:42:35,960 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-25 17:42:35,960 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-25 17:42:35,960 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-25 17:42:35,960 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-25 17:42:35,960 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-25 17:42:35,960 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-25 17:42:35,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:35,996 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2022-11-25 17:42:35,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:42:35,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:42:36,002 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-25 17:42:36,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:42:36,003 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-25 17:42:36,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:36,010 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2022-11-25 17:42:36,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:42:36,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:42:36,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-25 17:42:36,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:42:36,021 INFO L748 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 10#L530true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6#L530-2true call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3#L535-3true [2022-11-25 17:42:36,021 INFO L750 eck$LassoCheckResult]: Loop: 3#L535-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 16#L535-2true main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3#L535-3true [2022-11-25 17:42:36,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-11-25 17:42:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:36,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697615015] [2022-11-25 17:42:36,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:36,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:36,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:36,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:36,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:36,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-11-25 17:42:36,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:36,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491991648] [2022-11-25 17:42:36,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:36,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:36,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:36,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:36,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:36,256 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-11-25 17:42:36,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:36,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598045616] [2022-11-25 17:42:36,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:36,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:36,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:36,704 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 17:42:36,705 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 17:42:36,705 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 17:42:36,706 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 17:42:36,706 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 17:42:36,706 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:36,706 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 17:42:36,706 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 17:42:36,707 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2022-11-25 17:42:36,707 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 17:42:36,707 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 17:42:36,736 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:36,747 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:36,758 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:36,763 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:36,767 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:36,769 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:37,027 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:37,033 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:37,036 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:37,039 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:37,463 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 17:42:37,468 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 17:42:37,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:37,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:37,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:37,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-25 17:42:37,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:37,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:37,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:37,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:37,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:37,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:37,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:37,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:37,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:37,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-11-25 17:42:37,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:37,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:37,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:37,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:37,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-25 17:42:37,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:37,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:37,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:37,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:37,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:37,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:37,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:37,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:37,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:37,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:37,594 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:37,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:37,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:37,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:37,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:37,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:37,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-25 17:42:37,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:37,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:37,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:37,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:37,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:37,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:37,652 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:37,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-25 17:42:37,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:37,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:37,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:37,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:37,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:37,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:37,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:37,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:37,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:37,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:37,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:37,699 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:37,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:37,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:37,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:37,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:37,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:37,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:37,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:37,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:37,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-25 17:42:37,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:37,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:37,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:37,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:37,743 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:37,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:37,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-25 17:42:37,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:37,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:37,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:37,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:37,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:37,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:37,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:37,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:37,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:37,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:37,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:37,789 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:37,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:37,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-25 17:42:37,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:37,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:37,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:37,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:37,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:37,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:37,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 17:42:37,923 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-11-25 17:42:37,923 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-11-25 17:42:37,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:37,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:37,955 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:38,007 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 17:42:38,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-25 17:42:38,047 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-25 17:42:38,048 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 17:42:38,048 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~array_size~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~array_size~0#1 Supporting invariants [] [2022-11-25 17:42:38,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:38,080 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-11-25 17:42:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:38,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:42:38,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:42:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:38,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:42:38,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:42:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:38,253 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-25 17:42:38,256 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:38,321 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 65 states and 99 transitions. Complement of second has 7 states. [2022-11-25 17:42:38,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-25 17:42:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-11-25 17:42:38,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2022-11-25 17:42:38,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:42:38,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2022-11-25 17:42:38,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:42:38,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 4 letters. [2022-11-25 17:42:38,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:42:38,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 99 transitions. [2022-11-25 17:42:38,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-25 17:42:38,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 21 states and 30 transitions. [2022-11-25 17:42:38,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-11-25 17:42:38,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-25 17:42:38,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2022-11-25 17:42:38,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:38,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-11-25 17:42:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2022-11-25 17:42:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-25 17:42:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2022-11-25 17:42:38,374 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-11-25 17:42:38,374 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-11-25 17:42:38,375 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-25 17:42:38,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2022-11-25 17:42:38,376 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-25 17:42:38,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:42:38,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:42:38,376 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-25 17:42:38,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:42:38,377 INFO L748 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 159#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 155#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 146#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 148#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 161#L517-3 [2022-11-25 17:42:38,377 INFO L750 eck$LassoCheckResult]: Loop: 161#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 160#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 161#L517-3 [2022-11-25 17:42:38,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:38,378 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-11-25 17:42:38,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:38,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205891951] [2022-11-25 17:42:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:38,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:38,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:38,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205891951] [2022-11-25 17:42:38,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205891951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:38,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:38,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:42:38,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465330828] [2022-11-25 17:42:38,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:38,511 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:42:38,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2022-11-25 17:42:38,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:38,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195897328] [2022-11-25 17:42:38,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:38,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:38,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:38,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:38,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:38,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:42:38,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:42:38,639 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:42:38,668 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-11-25 17:42:38,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2022-11-25 17:42:38,669 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-25 17:42:38,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2022-11-25 17:42:38,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-11-25 17:42:38,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-25 17:42:38,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-11-25 17:42:38,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:38,671 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-11-25 17:42:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-11-25 17:42:38,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-11-25 17:42:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-11-25 17:42:38,674 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-11-25 17:42:38,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:42:38,675 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-11-25 17:42:38,675 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-25 17:42:38,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2022-11-25 17:42:38,676 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-25 17:42:38,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:42:38,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:42:38,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:38,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-25 17:42:38,677 INFO L748 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 209#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 205#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 196#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 197#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 198#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 199#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 211#L517-3 [2022-11-25 17:42:38,677 INFO L750 eck$LassoCheckResult]: Loop: 211#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 210#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 211#L517-3 [2022-11-25 17:42:38,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-11-25 17:42:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:38,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953742190] [2022-11-25 17:42:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:38,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:38,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:38,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:38,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:38,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2022-11-25 17:42:38,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:38,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543005389] [2022-11-25 17:42:38,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:38,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:38,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:38,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:38,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2022-11-25 17:42:38,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:38,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894547209] [2022-11-25 17:42:38,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:38,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:38,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:38,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:39,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:39,899 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 17:42:39,899 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 17:42:39,899 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 17:42:39,899 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 17:42:39,899 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 17:42:39,900 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:39,900 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 17:42:39,900 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 17:42:39,900 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2022-11-25 17:42:39,900 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 17:42:39,900 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 17:42:39,912 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,915 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,919 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,922 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,927 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,930 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,934 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,938 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,941 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,946 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,949 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,952 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,956 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,965 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,969 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,973 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,976 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,979 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,987 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,991 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,995 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:39,998 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:40,001 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:40,005 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:40,008 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:40,766 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:41,674 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 17:42:41,674 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 17:42:41,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:41,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:41,679 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:41,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-25 17:42:41,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:41,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:41,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:41,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:41,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:41,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:41,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:41,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:41,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:41,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:41,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:41,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:41,732 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:41,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-25 17:42:41,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:41,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:41,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:41,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:41,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:41,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:41,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:41,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:41,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:41,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:41,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:41,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:41,781 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:41,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-25 17:42:41,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:41,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:41,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:41,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:41,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:41,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:41,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:41,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:41,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:41,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:41,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:41,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:41,822 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:41,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:41,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:41,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:41,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:41,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:41,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:41,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:41,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:41,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-25 17:42:41,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:41,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:41,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:41,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:41,875 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:41,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-25 17:42:41,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:41,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:41,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:41,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:41,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:41,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:41,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:41,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-25 17:42:41,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:41,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:41,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:41,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:41,936 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:41,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:41,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-25 17:42:41,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:41,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:41,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:41,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:41,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:41,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:41,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:41,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:41,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:41,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:41,989 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:41,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-25 17:42:42,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,031 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-25 17:42:42,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:42,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:42,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,096 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,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-25 17:42:42,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-25 17:42:42,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,142 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-25 17:42:42,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,185 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-25 17:42:42,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,233 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-25 17:42:42,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,290 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-25 17:42:42,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:42,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:42,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,354 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-25 17:42:42,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-11-25 17:42:42,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,384 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-25 17:42:42,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,426 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-25 17:42:42,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:42,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:42,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,494 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-25 17:42:42,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,533 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-25 17:42:42,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,585 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-25 17:42:42,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:42,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:42,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-11-25 17:42:42,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,637 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-25 17:42:42,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,689 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-25 17:42:42,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,740 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-25 17:42:42,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,785 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-25 17:42:42,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,837 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-25 17:42:42,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:42,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:42,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,881 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-25 17:42:42,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:42,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:42,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,942 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:42,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-25 17:42:42,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:42,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:42,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:42,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:42,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:42,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:42,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:42,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:42,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:42,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:42,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:42,986 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:42,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:43,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-25 17:42:43,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:43,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:43,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:43,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:43,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:43,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:43,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:43,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:43,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:43,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:43,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:43,032 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:43,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:43,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:43,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:43,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:43,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:43,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-25 17:42:43,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:43,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:43,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:43,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:43,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:43,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:43,078 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:43,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:43,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-25 17:42:43,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:43,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:43,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:43,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:43,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:43,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:43,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:43,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:43,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:43,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:43,124 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:43,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:43,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:43,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:43,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:43,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:43,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-25 17:42:43,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:43,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:43,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:43,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:43,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:43,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:43,176 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:43,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:43,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:43,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:43,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:43,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:43,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-25 17:42:43,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:43,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:43,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:42:43,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:43,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:43,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:43,232 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:43,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:43,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-25 17:42:43,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:43,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:43,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:43,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:43,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:42:43,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:42:43,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 17:42:43,361 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-11-25 17:42:43,361 INFO L444 ModelExtractionUtils]: 9 out of 61 variables were initially zero. Simplification set additionally 48 variables to zero. [2022-11-25 17:42:43,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:43,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:43,363 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:43,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-25 17:42:43,369 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 17:42:43,381 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-25 17:42:43,382 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 17:42:43,382 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~best~0#1.offset, v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_1, ULTIMATE.start_lis_~i~0#1) = -1*ULTIMATE.start_lis_~best~0#1.offset + 1*v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_1 - 4*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2022-11-25 17:42:43,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-11-25 17:42:43,498 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2022-11-25 17:42:43,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:43,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:42:43,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:42:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:43,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:42:43,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:42:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:43,653 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-25 17:42:43,654 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:43,699 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 24 states and 35 transitions. Complement of second has 7 states. [2022-11-25 17:42:43,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-25 17:42:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-11-25 17:42:43,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2022-11-25 17:42:43,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:42:43,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2022-11-25 17:42:43,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:42:43,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2022-11-25 17:42:43,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:42:43,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2022-11-25 17:42:43,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-25 17:42:43,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2022-11-25 17:42:43,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-11-25 17:42:43,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-11-25 17:42:43,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2022-11-25 17:42:43,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:42:43,712 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-11-25 17:42:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2022-11-25 17:42:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-25 17:42:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2022-11-25 17:42:43,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-11-25 17:42:43,715 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-11-25 17:42:43,715 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-25 17:42:43,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2022-11-25 17:42:43,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-25 17:42:43,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:42:43,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:42:43,717 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:43,717 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 17:42:43,718 INFO L748 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 388#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 396#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 392#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 383#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 384#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 385#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 386#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 403#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 404#L517-4 lis_~i~0#1 := 1; 395#L519-3 [2022-11-25 17:42:43,718 INFO L750 eck$LassoCheckResult]: Loop: 395#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 389#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 390#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 395#L519-3 [2022-11-25 17:42:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2022-11-25 17:42:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:43,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061343250] [2022-11-25 17:42:43,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:43,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:42:43,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:43,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061343250] [2022-11-25 17:42:43,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061343250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:43,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:43,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:42:43,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689334585] [2022-11-25 17:42:43,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:43,859 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:42:43,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2022-11-25 17:42:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:43,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253997936] [2022-11-25 17:42:43,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:43,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:43,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:43,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:43,905 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 17:42:43,905 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 17:42:43,905 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 17:42:43,905 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 17:42:43,905 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 17:42:43,906 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:43,906 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 17:42:43,906 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 17:42:43,906 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2022-11-25 17:42:43,906 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 17:42:43,906 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 17:42:43,907 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:43,917 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:43,920 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:43,922 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:43,925 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:43,974 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 17:42:43,975 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 17:42:43,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:43,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:43,978 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:43,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 17:42:43,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 17:42:44,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-25 17:42:44,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:44,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:44,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:44,019 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:44,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 17:42:44,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 17:42:44,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-25 17:42:44,211 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 17:42:44,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:44,220 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 17:42:44,220 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 17:42:44,220 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 17:42:44,220 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 17:42:44,221 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 17:42:44,221 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:44,221 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 17:42:44,221 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 17:42:44,221 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2022-11-25 17:42:44,221 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 17:42:44,221 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 17:42:44,222 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:44,235 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:44,238 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:44,241 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:44,244 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:44,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:44,333 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 17:42:44,333 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 17:42:44,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:44,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:44,335 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:44,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:42:44,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-25 17:42:44,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:42:44,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:42:44,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:42:44,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:42:44,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:42:44,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:42:44,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:42:44,378 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 17:42:44,384 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-25 17:42:44,384 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-25 17:42:44,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:44,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:44,385 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:42:44,393 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 17:42:44,393 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-25 17:42:44,393 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 17:42:44,393 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [] [2022-11-25 17:42:44,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-25 17:42:44,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:44,398 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-25 17:42:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:44,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:42:44,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:42:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:44,475 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:42:44,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:42:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:42:44,515 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-11-25 17:42:44,516 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:44,602 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 43 states and 67 transitions. Complement of second has 9 states. [2022-11-25 17:42:44,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-11-25 17:42:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-11-25 17:42:44,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2022-11-25 17:42:44,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:42:44,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2022-11-25 17:42:44,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:42:44,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2022-11-25 17:42:44,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:42:44,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2022-11-25 17:42:44,607 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-11-25 17:42:44,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2022-11-25 17:42:44,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-25 17:42:44,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-11-25 17:42:44,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2022-11-25 17:42:44,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:42:44,610 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2022-11-25 17:42:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2022-11-25 17:42:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2022-11-25 17:42:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2022-11-25 17:42:44,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 50 transitions. [2022-11-25 17:42:44,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:44,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:42:44,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:42:44,615 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:42:44,685 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2022-11-25 17:42:44,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2022-11-25 17:42:44,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-25 17:42:44,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2022-11-25 17:42:44,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-11-25 17:42:44,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-11-25 17:42:44,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2022-11-25 17:42:44,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:42:44,700 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-11-25 17:42:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2022-11-25 17:42:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-11-25 17:42:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2022-11-25 17:42:44,710 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-11-25 17:42:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:42:44,711 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-11-25 17:42:44,712 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-25 17:42:44,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2022-11-25 17:42:44,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-25 17:42:44,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:42:44,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:42:44,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:44,714 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:44,714 INFO L748 eck$LassoCheckResult]: Stem: 588#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 604#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 595#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 584#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 585#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 586#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 587#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 613#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 605#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 606#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 614#L517-4 lis_~i~0#1 := 1; 615#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 590#L520-3 [2022-11-25 17:42:44,714 INFO L750 eck$LassoCheckResult]: Loop: 590#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 591#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 596#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 597#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 607#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 600#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 601#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 590#L520-3 [2022-11-25 17:42:44,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2022-11-25 17:42:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:44,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013696270] [2022-11-25 17:42:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:42:44,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:44,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013696270] [2022-11-25 17:42:44,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013696270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:42:44,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667999568] [2022-11-25 17:42:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:44,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:42:44,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:44,849 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:42:44,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-25 17:42:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:44,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:42:44,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:42:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:42:45,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:42:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:42:45,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667999568] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:42:45,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:42:45,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-11-25 17:42:45,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925113789] [2022-11-25 17:42:45,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:42:45,083 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:42:45,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:45,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2022-11-25 17:42:45,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:45,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024540503] [2022-11-25 17:42:45,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:45,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:45,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:45,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:45,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:45,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:42:45,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:42:45,365 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:42:45,651 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2022-11-25 17:42:45,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 109 transitions. [2022-11-25 17:42:45,653 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-11-25 17:42:45,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 81 transitions. [2022-11-25 17:42:45,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-11-25 17:42:45,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-11-25 17:42:45,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2022-11-25 17:42:45,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:42:45,654 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 81 transitions. [2022-11-25 17:42:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2022-11-25 17:42:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2022-11-25 17:42:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-11-25 17:42:45,658 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-11-25 17:42:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:42:45,660 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-11-25 17:42:45,661 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-25 17:42:45,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2022-11-25 17:42:45,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-25 17:42:45,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:42:45,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:42:45,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:45,662 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:45,663 INFO L748 eck$LassoCheckResult]: Stem: 800#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 801#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 816#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 807#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 796#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 797#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 798#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 799#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 831#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 826#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 827#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 817#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 818#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 830#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 832#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 828#L517-4 lis_~i~0#1 := 1; 820#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 802#L520-3 [2022-11-25 17:42:45,663 INFO L750 eck$LassoCheckResult]: Loop: 802#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 803#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 808#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 809#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 819#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 812#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 813#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 802#L520-3 [2022-11-25 17:42:45,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:45,663 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2022-11-25 17:42:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:45,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414040172] [2022-11-25 17:42:45,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:45,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:45,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:45,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:45,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2022-11-25 17:42:45,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:45,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672331426] [2022-11-25 17:42:45,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:45,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:45,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:45,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:45,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2022-11-25 17:42:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:45,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007968428] [2022-11-25 17:42:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:45,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:42:46,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:46,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007968428] [2022-11-25 17:42:46,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007968428] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:42:46,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914613439] [2022-11-25 17:42:46,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:46,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:42:46,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:46,113 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:42:46,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-11-25 17:42:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:46,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 17:42:46,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:42:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:42:46,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:42:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 17:42:46,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914613439] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:42:46,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:42:46,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-11-25 17:42:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651272687] [2022-11-25 17:42:46,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:42:46,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-11-25 17:42:46,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:46,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:42:46,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:42:46,672 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 19 Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:42:46,859 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-11-25 17:42:46,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 92 transitions. [2022-11-25 17:42:46,859 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2022-11-25 17:42:46,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 83 transitions. [2022-11-25 17:42:46,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-11-25 17:42:46,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-11-25 17:42:46,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 83 transitions. [2022-11-25 17:42:46,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:42:46,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-11-25 17:42:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 83 transitions. [2022-11-25 17:42:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-11-25 17:42:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 54 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-25 17:42:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2022-11-25 17:42:46,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 75 transitions. [2022-11-25 17:42:46,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:42:46,870 INFO L428 stractBuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2022-11-25 17:42:46,872 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-25 17:42:46,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2022-11-25 17:42:46,872 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-11-25 17:42:46,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:42:46,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:42:46,875 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:46,875 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-25 17:42:46,876 INFO L748 eck$LassoCheckResult]: Stem: 1071#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1072#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1086#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1078#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1067#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1068#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1069#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1070#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1115#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1097#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1098#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1087#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1088#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1101#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1105#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1099#L517-4 lis_~i~0#1 := 1; 1100#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1109#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1093#L521 [2022-11-25 17:42:46,876 INFO L750 eck$LassoCheckResult]: Loop: 1093#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1079#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1080#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1092#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1093#L521 [2022-11-25 17:42:46,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:46,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1159051365, now seen corresponding path program 1 times [2022-11-25 17:42:46,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:46,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169138404] [2022-11-25 17:42:46,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:46,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:46,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:46,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:46,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:46,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2655420, now seen corresponding path program 1 times [2022-11-25 17:42:46,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:46,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520583329] [2022-11-25 17:42:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:46,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:46,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:46,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:47,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:47,001 INFO L85 PathProgramCache]: Analyzing trace with hash -651990240, now seen corresponding path program 1 times [2022-11-25 17:42:47,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:47,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268256125] [2022-11-25 17:42:47,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:47,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 17:42:47,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:47,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268256125] [2022-11-25 17:42:47,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268256125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:42:47,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357589463] [2022-11-25 17:42:47,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:47,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:42:47,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:47,132 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:42:47,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-25 17:42:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:47,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:42:47,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:42:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 17:42:47,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:42:47,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357589463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:47,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:42:47,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-11-25 17:42:47,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55740644] [2022-11-25 17:42:47,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:47,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:47,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:42:47,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:42:47,542 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 27 Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:42:47,614 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-11-25 17:42:47,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2022-11-25 17:42:47,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-25 17:42:47,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2022-11-25 17:42:47,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-11-25 17:42:47,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-11-25 17:42:47,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2022-11-25 17:42:47,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:42:47,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-11-25 17:42:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2022-11-25 17:42:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2022-11-25 17:42:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.375) internal successors, (88), 63 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2022-11-25 17:42:47,622 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 88 transitions. [2022-11-25 17:42:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:42:47,625 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2022-11-25 17:42:47,625 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-25 17:42:47,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 88 transitions. [2022-11-25 17:42:47,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-25 17:42:47,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:42:47,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:42:47,627 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:47,627 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 17:42:47,627 INFO L748 eck$LassoCheckResult]: Stem: 1274#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1289#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1281#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1270#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1271#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1272#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1273#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1319#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1306#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1307#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1310#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1311#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1290#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1291#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1308#L517-4 lis_~i~0#1 := 1; 1292#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1293#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1332#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1314#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 1309#L519-4 lis_~i~0#1 := 0; 1303#L523-3 [2022-11-25 17:42:47,627 INFO L750 eck$LassoCheckResult]: Loop: 1303#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 1304#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 1305#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 1303#L523-3 [2022-11-25 17:42:47,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2057131266, now seen corresponding path program 1 times [2022-11-25 17:42:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:47,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502971377] [2022-11-25 17:42:47,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:47,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 17:42:47,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:47,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502971377] [2022-11-25 17:42:47,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502971377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:47,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:47,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:42:47,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131289977] [2022-11-25 17:42:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:47,713 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:42:47,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2022-11-25 17:42:47,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:47,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319927884] [2022-11-25 17:42:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:47,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:47,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:47,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:47,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:42:47,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:42:47,780 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. cyclomatic complexity: 30 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:42:47,832 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2022-11-25 17:42:47,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2022-11-25 17:42:47,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-25 17:42:47,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 88 transitions. [2022-11-25 17:42:47,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-25 17:42:47,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-25 17:42:47,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 88 transitions. [2022-11-25 17:42:47,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:42:47,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-11-25 17:42:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 88 transitions. [2022-11-25 17:42:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-11-25 17:42:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.34375) internal successors, (86), 63 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2022-11-25 17:42:47,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-11-25 17:42:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:42:47,857 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-11-25 17:42:47,858 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-25 17:42:47,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 86 transitions. [2022-11-25 17:42:47,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-25 17:42:47,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:42:47,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:42:47,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:47,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:47,861 INFO L748 eck$LassoCheckResult]: Stem: 1412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1413#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1425#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1418#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1408#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1409#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1410#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1411#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1462#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1458#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1457#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1459#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1443#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1426#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1427#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1456#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1455#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1454#L517-4 lis_~i~0#1 := 1; 1452#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1453#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1433#L521 assume !lis_#t~short11#1; 1419#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1420#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1414#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1415#L519-2 [2022-11-25 17:42:47,862 INFO L750 eck$LassoCheckResult]: Loop: 1415#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1423#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1447#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1464#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1466#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1465#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1463#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1415#L519-2 [2022-11-25 17:42:47,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1034472260, now seen corresponding path program 1 times [2022-11-25 17:42:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:47,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464184524] [2022-11-25 17:42:47,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 17:42:47,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:47,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464184524] [2022-11-25 17:42:47,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464184524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:42:47,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:42:47,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:42:47,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778917488] [2022-11-25 17:42:47,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:42:47,919 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:42:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 3 times [2022-11-25 17:42:47,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:47,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579606354] [2022-11-25 17:42:47,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:47,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:47,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:47,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:48,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:48,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:42:48,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:42:48,175 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:42:48,191 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2022-11-25 17:42:48,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2022-11-25 17:42:48,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-25 17:42:48,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2022-11-25 17:42:48,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-11-25 17:42:48,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-11-25 17:42:48,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2022-11-25 17:42:48,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:42:48,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-25 17:42:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2022-11-25 17:42:48,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-25 17:42:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.318840579710145) internal successors, (91), 68 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2022-11-25 17:42:48,197 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-25 17:42:48,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:42:48,198 INFO L428 stractBuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-25 17:42:48,198 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-25 17:42:48,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2022-11-25 17:42:48,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-25 17:42:48,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:42:48,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:42:48,200 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:48,200 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:48,200 INFO L748 eck$LassoCheckResult]: Stem: 1551#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1552#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1566#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1557#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1547#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1548#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1549#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1550#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1599#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1600#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1601#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1580#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1581#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1597#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1596#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1595#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1594#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1593#L517-4 lis_~i~0#1 := 1; 1591#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1592#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1615#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1613#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1612#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1602#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1562#L519-2 [2022-11-25 17:42:48,200 INFO L750 eck$LassoCheckResult]: Loop: 1562#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1563#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1553#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1554#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1574#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1559#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1572#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1562#L519-2 [2022-11-25 17:42:48,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:48,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2022-11-25 17:42:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:48,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129554212] [2022-11-25 17:42:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:48,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:42:48,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:42:48,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129554212] [2022-11-25 17:42:48,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129554212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:42:48,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185826824] [2022-11-25 17:42:48,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:48,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:42:48,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:42:48,494 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:42:48,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-25 17:42:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:42:48,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:42:48,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:42:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:42:48,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:42:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:42:48,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185826824] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:42:48,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:42:48,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-25 17:42:48,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963729823] [2022-11-25 17:42:48,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:42:48,807 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:42:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:48,808 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 4 times [2022-11-25 17:42:48,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:48,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345156952] [2022-11-25 17:42:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:48,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:48,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:48,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:49,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:42:49,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:42:49,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:42:49,050 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. cyclomatic complexity: 28 Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:42:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:42:49,315 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2022-11-25 17:42:49,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 99 transitions. [2022-11-25 17:42:49,316 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-11-25 17:42:49,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 99 transitions. [2022-11-25 17:42:49,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-11-25 17:42:49,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-11-25 17:42:49,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 99 transitions. [2022-11-25 17:42:49,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:42:49,317 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-11-25 17:42:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 99 transitions. [2022-11-25 17:42:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-11-25 17:42:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 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-25 17:42:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-11-25 17:42:49,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-11-25 17:42:49,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:42:49,322 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-11-25 17:42:49,322 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-25 17:42:49,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2022-11-25 17:42:49,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-25 17:42:49,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:42:49,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:42:49,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:42:49,324 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-25 17:42:49,324 INFO L748 eck$LassoCheckResult]: Stem: 1863#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1864#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1878#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1869#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1859#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1860#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1861#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1862#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1902#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1904#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1914#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1913#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1912#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1911#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1910#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1898#L517-4 lis_~i~0#1 := 1; 1881#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1882#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1889#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1890#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1871#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1927#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1926#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1919#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 1899#L519-4 lis_~i~0#1 := 0; 1893#L523-3 [2022-11-25 17:42:49,324 INFO L750 eck$LassoCheckResult]: Loop: 1893#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 1894#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 1895#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 1893#L523-3 [2022-11-25 17:42:49,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2022-11-25 17:42:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:49,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873741106] [2022-11-25 17:42:49,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:49,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:49,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:49,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 2 times [2022-11-25 17:42:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:49,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257967038] [2022-11-25 17:42:49,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:49,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:49,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:49,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:49,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:42:49,437 INFO L85 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2022-11-25 17:42:49,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:42:49,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274589164] [2022-11-25 17:42:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:42:49,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:42:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:49,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:42:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:42:49,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:42:55,388 WARN L233 SmtUtils]: Spent 5.76s on a formula simplification. DAG size of input: 261 DAG size of output: 187 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 17:42:57,465 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 17:42:57,466 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 17:42:57,466 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 17:42:57,466 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 17:42:57,466 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 17:42:57,466 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:42:57,466 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 17:42:57,467 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 17:42:57,467 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration11_Lasso [2022-11-25 17:42:57,467 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 17:42:57,467 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 17:42:57,472 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:57,476 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:57,479 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:57,482 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:57,485 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:57,489 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:57,492 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:57,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:57,498 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:57,501 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:42:57,504 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,026 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,031 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,034 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,036 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,042 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,044 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,046 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,057 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,060 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,063 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,065 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,068 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:00,071 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:01,010 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 17:43:01,011 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 17:43:01,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,030 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:01,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-11-25 17:43:01,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:01,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:43:01,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:01,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:01,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:01,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:43:01,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:43:01,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:01,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-11-25 17:43:01,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,052 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:01,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-11-25 17:43:01,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:01,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:43:01,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:01,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:01,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:01,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:43:01,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:43:01,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:01,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:01,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,101 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,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-25 17:43:01,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-11-25 17:43:01,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:01,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:43:01,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:01,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:01,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:01,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:43:01,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:43:01,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:01,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:01,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,133 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-11-25 17:43:01,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:01,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:01,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:43:01,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:01,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:01,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:01,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:43:01,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:43:01,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:01,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:01,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,168 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,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-25 17:43:01,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-11-25 17:43:01,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:01,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:01,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:01,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:01,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:43:01,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:43:01,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:01,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:01,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,209 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:01,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-11-25 17:43:01,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:01,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:43:01,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:01,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:01,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:01,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:43:01,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:43:01,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:01,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:01,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,248 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:01,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-11-25 17:43:01,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:01,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:01,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:01,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:01,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:43:01,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:43:01,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:01,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:01,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,300 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:01,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-11-25 17:43:01,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:01,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:43:01,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:01,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:01,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:01,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:43:01,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:43:01,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:01,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:01,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,344 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:01,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-11-25 17:43:01,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:01,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:43:01,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:01,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:01,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:01,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:43:01,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:43:01,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:01,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-11-25 17:43:01,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,368 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-11-25 17:43:01,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:01,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:01,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:43:01,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:01,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:01,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:01,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:43:01,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:43:01,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:01,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-11-25 17:43:01,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,390 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-11-25 17:43:01,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-25 17:43:01,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:01,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:01,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:01,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:01,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:43:01,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:43:01,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:01,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-11-25 17:43:01,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,415 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-11-25 17:43:01,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:01,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:01,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:01,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:01,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:01,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:43:01,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:43:01,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 17:43:01,599 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-11-25 17:43:01,599 INFO L444 ModelExtractionUtils]: 10 out of 67 variables were initially zero. Simplification set additionally 54 variables to zero. [2022-11-25 17:43:01,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:01,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:01,606 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:01,611 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 17:43:01,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-11-25 17:43:01,644 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-25 17:43:01,644 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 17:43:01,644 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~N#1, ULTIMATE.start_lis_~i~0#1) = 1*ULTIMATE.start_lis_~N#1 - 1*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2022-11-25 17:43:01,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:01,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:02,046 INFO L156 tatePredicateManager]: 45 out of 45 supporting invariants were superfluous and have been removed [2022-11-25 17:43:02,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:02,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:43:02,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:43:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:02,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:43:02,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:43:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:43:02,179 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-25 17:43:02,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 93 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:43:02,198 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 93 transitions. cyclomatic complexity: 28. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 74 states and 98 transitions. Complement of second has 4 states. [2022-11-25 17:43:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-11-25 17:43:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:43:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-11-25 17:43:02,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 25 letters. Loop has 3 letters. [2022-11-25 17:43:02,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:43:02,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 28 letters. Loop has 3 letters. [2022-11-25 17:43:02,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:43:02,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 25 letters. Loop has 6 letters. [2022-11-25 17:43:02,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:43:02,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2022-11-25 17:43:02,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-25 17:43:02,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 51 states and 66 transitions. [2022-11-25 17:43:02,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-25 17:43:02,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-11-25 17:43:02,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2022-11-25 17:43:02,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:43:02,207 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-11-25 17:43:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2022-11-25 17:43:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-25 17:43:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 50 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:43:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2022-11-25 17:43:02,216 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-11-25 17:43:02,216 INFO L428 stractBuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-11-25 17:43:02,216 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-25 17:43:02,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 66 transitions. [2022-11-25 17:43:02,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-25 17:43:02,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:43:02,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:43:02,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:43:02,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:43:02,224 INFO L748 eck$LassoCheckResult]: Stem: 2291#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2306#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2297#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2287#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2288#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2289#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2290#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2327#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2324#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2323#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2318#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2319#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2307#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2308#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2322#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2328#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2326#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2325#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2320#L517-4 lis_~i~0#1 := 1; 2321#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2331#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2335#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2330#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2299#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2311#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2302#L519-2 [2022-11-25 17:43:02,224 INFO L750 eck$LassoCheckResult]: Loop: 2302#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2303#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2293#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2294#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2314#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2333#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2332#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2302#L519-2 [2022-11-25 17:43:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2022-11-25 17:43:02,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:43:02,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744299168] [2022-11-25 17:43:02,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:02,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:43:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:43:02,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:43:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:43:02,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:43:02,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:02,375 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 5 times [2022-11-25 17:43:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:43:02,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272773399] [2022-11-25 17:43:02,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:02,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:43:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:43:02,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:43:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:43:02,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:43:02,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1635630457, now seen corresponding path program 1 times [2022-11-25 17:43:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:43:02,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201541027] [2022-11-25 17:43:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:43:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 17:43:02,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:43:02,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201541027] [2022-11-25 17:43:02,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201541027] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:43:02,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227757219] [2022-11-25 17:43:02,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:02,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:43:02,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:02,532 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:43:02,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-11-25 17:43:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:02,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:43:02,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:43:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 17:43:02,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:43:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 17:43:02,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227757219] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:43:02,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:43:02,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-25 17:43:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893882259] [2022-11-25 17:43:02,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:43:02,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:43:02,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:43:02,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:43:02,984 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. cyclomatic complexity: 19 Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:43:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:43:03,079 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-11-25 17:43:03,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 90 transitions. [2022-11-25 17:43:03,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-11-25 17:43:03,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 56 transitions. [2022-11-25 17:43:03,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-11-25 17:43:03,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-11-25 17:43:03,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2022-11-25 17:43:03,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:43:03,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-11-25 17:43:03,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2022-11-25 17:43:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-11-25 17:43:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:43:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-11-25 17:43:03,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-11-25 17:43:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:43:03,084 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-11-25 17:43:03,084 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-25 17:43:03,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2022-11-25 17:43:03,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-25 17:43:03,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:43:03,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:43:03,085 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:43:03,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-11-25 17:43:03,085 INFO L748 eck$LassoCheckResult]: Stem: 2622#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2623#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2632#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2626#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2618#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2619#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2620#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2621#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2631#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2647#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2646#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2639#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2640#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2633#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2634#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2642#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2645#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2644#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2643#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2641#L517-4 lis_~i~0#1 := 1; 2635#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2636#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2657#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2655#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2654#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2648#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2629#L519-2 [2022-11-25 17:43:03,085 INFO L750 eck$LassoCheckResult]: Loop: 2629#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2630#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2653#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2652#L521 assume !lis_#t~short11#1; 2650#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2637#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2624#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2625#L521 assume !lis_#t~short11#1; 2627#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2628#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2649#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2629#L519-2 [2022-11-25 17:43:03,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:03,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 3 times [2022-11-25 17:43:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:43:03,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655618932] [2022-11-25 17:43:03,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:43:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:43:03,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:43:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:43:03,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:43:03,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:03,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1752732867, now seen corresponding path program 1 times [2022-11-25 17:43:03,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:43:03,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301635967] [2022-11-25 17:43:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:43:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:43:03,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:43:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:43:03,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:43:03,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash 117015998, now seen corresponding path program 1 times [2022-11-25 17:43:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:43:03,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683241845] [2022-11-25 17:43:03,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:43:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:43:03,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:43:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:43:03,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:43:15,399 WARN L233 SmtUtils]: Spent 11.91s on a formula simplification. DAG size of input: 290 DAG size of output: 205 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 17:43:19,933 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 17:43:19,933 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 17:43:19,933 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 17:43:19,933 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 17:43:19,933 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 17:43:19,933 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:19,933 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 17:43:19,933 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 17:43:19,933 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration13_Lasso [2022-11-25 17:43:19,933 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 17:43:19,933 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 17:43:19,938 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:19,941 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:19,946 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:19,949 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:19,952 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:19,955 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:19,959 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,176 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,190 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,195 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,198 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,201 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,205 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,207 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,210 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,213 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,221 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,223 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,226 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,231 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,234 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,236 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,239 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:26,242 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:43:27,447 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 17:43:27,447 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 17:43:27,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:27,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:27,449 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:27,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-11-25 17:43:27,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:27,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:27,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:43:27,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:27,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:27,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:27,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:43:27,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:43:27,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:27,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-11-25 17:43:27,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:27,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:27,483 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:27,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-11-25 17:43:27,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:27,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:27,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:27,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:27,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:27,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:43:27,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:43:27,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:27,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-11-25 17:43:27,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:27,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:27,511 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:27,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-11-25 17:43:27,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:27,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:27,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:43:27,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:27,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:27,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:27,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:43:27,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:43:27,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:27,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-11-25 17:43:27,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:27,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:27,550 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:27,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-11-25 17:43:27,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:27,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:27,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:43:27,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:27,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:27,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:27,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:43:27,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:43:27,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:27,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:27,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:27,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:27,600 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:27,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-11-25 17:43:27,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:27,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:27,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:43:27,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:27,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:27,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:27,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:43:27,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:43:27,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:27,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:27,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:27,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:27,645 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:27,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-11-25 17:43:27,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:27,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:27,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:27,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:27,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:27,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:43:27,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:43:27,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:43:27,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:27,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:27,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:27,693 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:27,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-11-25 17:43:27,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:43:27,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:43:27,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:43:27,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:43:27,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:43:27,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:43:27,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:43:27,728 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 17:43:27,737 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-11-25 17:43:27,737 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-11-25 17:43:27,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:43:27,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:27,742 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:43:27,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-11-25 17:43:27,748 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 17:43:27,787 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2022-11-25 17:43:27,788 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 17:43:27,788 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset (* ULTIMATE.start_lis_~i~0#1 4)))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset (* ULTIMATE.start_lis_~i~0#1 4)))_2 + 1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset 8))_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset 4))_2 - 2 >= 0, -1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset 4))_2 >= 0] [2022-11-25 17:43:27,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-11-25 17:43:28,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-11-25 17:43:28,314 INFO L156 tatePredicateManager]: 47 out of 49 supporting invariants were superfluous and have been removed [2022-11-25 17:43:28,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:28,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 17:43:28,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:43:28,521 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 10 treesize of output 8 [2022-11-25 17:43:28,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:43:28,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-25 17:43:28,680 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 10 treesize of output 9 [2022-11-25 17:43:28,904 INFO L321 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2022-11-25 17:43:28,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2022-11-25 17:43:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:29,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 17:43:29,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:43:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:43:29,443 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 6 loop predicates [2022-11-25 17:43:29,443 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:43:30,076 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 116 transitions. Complement of second has 23 states. [2022-11-25 17:43:30,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 10 stem states 5 non-accepting loop states 2 accepting loop states [2022-11-25 17:43:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:43:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 52 transitions. [2022-11-25 17:43:30,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 26 letters. Loop has 11 letters. [2022-11-25 17:43:30,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:43:30,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 37 letters. Loop has 11 letters. [2022-11-25 17:43:30,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:43:30,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 52 transitions. Stem has 26 letters. Loop has 22 letters. [2022-11-25 17:43:30,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:43:30,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 116 transitions. [2022-11-25 17:43:30,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-25 17:43:30,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 81 states and 103 transitions. [2022-11-25 17:43:30,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2022-11-25 17:43:30,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-11-25 17:43:30,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 103 transitions. [2022-11-25 17:43:30,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:43:30,085 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81 states and 103 transitions. [2022-11-25 17:43:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 103 transitions. [2022-11-25 17:43:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2022-11-25 17:43:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 62 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-25 17:43:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2022-11-25 17:43:30,089 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 80 transitions. [2022-11-25 17:43:30,089 INFO L428 stractBuchiCegarLoop]: Abstraction has 63 states and 80 transitions. [2022-11-25 17:43:30,090 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-25 17:43:30,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 80 transitions. [2022-11-25 17:43:30,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-25 17:43:30,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:43:30,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:43:30,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:43:30,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-25 17:43:30,092 INFO L748 eck$LassoCheckResult]: Stem: 3133#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3149#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3139#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3129#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3130#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3131#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3132#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3175#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3169#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3168#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3158#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 3159#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3162#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3163#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3150#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3151#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3171#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3170#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3160#L517-4 lis_~i~0#1 := 1; 3161#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3178#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3176#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3173#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3174#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3179#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3144#L519-2 [2022-11-25 17:43:30,092 INFO L750 eck$LassoCheckResult]: Loop: 3144#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3145#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3153#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3191#L521 assume !lis_#t~short11#1; 3140#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3141#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3135#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3136#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3154#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3180#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3181#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3144#L519-2 [2022-11-25 17:43:30,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:43:30,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1035301794, now seen corresponding path program 1 times [2022-11-25 17:43:30,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:43:30,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303099393] [2022-11-25 17:43:30,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:43:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:43:32,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:43:32,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303099393] [2022-11-25 17:43:32,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303099393] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:43:32,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541946627] [2022-11-25 17:43:32,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:43:32,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:43:32,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:43:32,018 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:43:32,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-11-25 17:43:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:43:32,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 17:43:32,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:43:32,188 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 10 treesize of output 8 [2022-11-25 17:43:32,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-25 17:43:32,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 17:43:32,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-25 17:43:32,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-25 17:43:32,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:43:32,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:43:32,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:43:32,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-11-25 17:43:32,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-25 17:44:22,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:44:22,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:44:22,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:44:22,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 16 [2022-11-25 17:44:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 17:44:22,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:44:23,237 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_262| Int)) (or (not (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 1) |v_ULTIMATE.start_lis_~i~0#1_262|)) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |v_ULTIMATE.start_lis_~i~0#1_262|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_764) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))))) is different from false [2022-11-25 17:44:25,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:44:25,351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 146 [2022-11-25 17:44:25,364 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 262 treesize of output 256 [2022-11-25 17:44:25,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:44:25,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 300 [2022-11-25 17:44:25,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:44:25,451 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 343 treesize of output 319 [2022-11-25 17:44:25,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:44:25,474 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 397 treesize of output 373 [2022-11-25 17:44:25,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:44:25,516 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 296 treesize of output 272 [2022-11-25 17:44:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 1 times theorem prover too weak. 9 trivial. 2 not checked. [2022-11-25 17:44:25,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541946627] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:44:25,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:44:25,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 34 [2022-11-25 17:44:25,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938495550] [2022-11-25 17:44:25,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:44:25,949 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:44:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:44:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 1 times [2022-11-25 17:44:25,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:44:25,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424384603] [2022-11-25 17:44:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:44:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:44:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:44:25,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:44:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:44:25,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:44:26,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:44:26,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 17:44:26,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=905, Unknown=19, NotChecked=62, Total=1122 [2022-11-25 17:44:26,361 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. cyclomatic complexity: 21 Second operand has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:44:51,511 WARN L233 SmtUtils]: Spent 24.07s on a formula simplification. DAG size of input: 45 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:45:04,500 WARN L233 SmtUtils]: Spent 12.94s on a formula simplification. DAG size of input: 50 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:45:12,827 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 65 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:45:25,761 WARN L233 SmtUtils]: Spent 12.90s on a formula simplification. DAG size of input: 42 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:45:49,920 WARN L233 SmtUtils]: Spent 24.06s on a formula simplification. DAG size of input: 46 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:46:14,102 WARN L233 SmtUtils]: Spent 24.05s on a formula simplification. DAG size of input: 47 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:46:38,201 WARN L233 SmtUtils]: Spent 24.07s on a formula simplification. DAG size of input: 52 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:46:59,037 WARN L233 SmtUtils]: Spent 20.71s on a formula simplification. DAG size of input: 48 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:47:23,134 WARN L233 SmtUtils]: Spent 24.07s on a formula simplification. DAG size of input: 53 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:47:47,303 WARN L233 SmtUtils]: Spent 24.07s on a formula simplification. DAG size of input: 56 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:48:14,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:48:26,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:48:38,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:48:50,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:49:04,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:49:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:49:04,849 INFO L93 Difference]: Finished difference Result 127 states and 165 transitions. [2022-11-25 17:49:04,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 165 transitions. [2022-11-25 17:49:04,850 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2022-11-25 17:49:04,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 165 transitions. [2022-11-25 17:49:04,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2022-11-25 17:49:04,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2022-11-25 17:49:04,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 165 transitions. [2022-11-25 17:49:04,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:49:04,852 INFO L218 hiAutomatonCegarLoop]: Abstraction has 127 states and 165 transitions. [2022-11-25 17:49:04,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 165 transitions. [2022-11-25 17:49:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 63. [2022-11-25 17:49:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.253968253968254) internal successors, (79), 62 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2022-11-25 17:49:04,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 79 transitions. [2022-11-25 17:49:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 17:49:04,856 INFO L428 stractBuchiCegarLoop]: Abstraction has 63 states and 79 transitions. [2022-11-25 17:49:04,856 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-25 17:49:04,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 79 transitions. [2022-11-25 17:49:04,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-25 17:49:04,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:49:04,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:49:04,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:49:04,857 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-25 17:49:04,857 INFO L748 eck$LassoCheckResult]: Stem: 3557#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3558#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3573#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3563#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3553#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3554#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3555#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3556#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3594#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3591#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3590#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3582#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 3583#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3586#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3597#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3600#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3587#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3574#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3575#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3584#L517-4 lis_~i~0#1 := 1; 3585#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3601#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3598#L521 assume !lis_#t~short11#1; 3599#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3615#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3602#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3568#L519-2 [2022-11-25 17:49:04,858 INFO L750 eck$LassoCheckResult]: Loop: 3568#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3569#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3576#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3614#L521 assume !lis_#t~short11#1; 3564#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3565#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3559#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3560#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3579#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3603#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3604#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3568#L519-2 [2022-11-25 17:49:04,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:04,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1035361376, now seen corresponding path program 1 times [2022-11-25 17:49:04,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:04,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189292279] [2022-11-25 17:49:04,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:04,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:04,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:49:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:04,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:49:04,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:04,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 2 times [2022-11-25 17:49:04,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:04,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287396480] [2022-11-25 17:49:04,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:04,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:04,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:49:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:04,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:49:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2120942784, now seen corresponding path program 1 times [2022-11-25 17:49:04,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:04,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329110012] [2022-11-25 17:49:04,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:04,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:49:06,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:49:06,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329110012] [2022-11-25 17:49:06,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329110012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:49:06,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345219812] [2022-11-25 17:49:06,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:06,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:49:06,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:06,621 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:49:06,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-11-25 17:49:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:06,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 17:49:06,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:49:06,790 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 10 treesize of output 8 [2022-11-25 17:49:06,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-25 17:49:06,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 17:49:06,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 17:49:06,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-25 17:49:07,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:49:07,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-25 17:49:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 17:49:07,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:49:07,720 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_870 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1)))) is different from false [2022-11-25 17:49:07,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:49:07,730 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 74 [2022-11-25 17:49:07,736 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 130 treesize of output 124 [2022-11-25 17:49:07,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:49:07,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 105 [2022-11-25 17:49:07,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:49:07,775 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 124 treesize of output 108 [2022-11-25 17:49:07,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:49:07,787 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 87 treesize of output 71 [2022-11-25 17:49:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-11-25 17:49:07,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345219812] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:49:07,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:49:07,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 39 [2022-11-25 17:49:07,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217936497] [2022-11-25 17:49:07,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:49:08,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:49:08,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 17:49:08,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1265, Unknown=2, NotChecked=72, Total=1482 [2022-11-25 17:49:08,232 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. cyclomatic complexity: 20 Second operand has 39 states, 39 states have (on average 2.230769230769231) internal successors, (87), 39 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:14,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:49:14,451 INFO L93 Difference]: Finished difference Result 228 states and 290 transitions. [2022-11-25 17:49:14,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 228 states and 290 transitions. [2022-11-25 17:49:14,453 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 38 [2022-11-25 17:49:14,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 228 states to 228 states and 290 transitions. [2022-11-25 17:49:14,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2022-11-25 17:49:14,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2022-11-25 17:49:14,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 228 states and 290 transitions. [2022-11-25 17:49:14,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:49:14,455 INFO L218 hiAutomatonCegarLoop]: Abstraction has 228 states and 290 transitions. [2022-11-25 17:49:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states and 290 transitions. [2022-11-25 17:49:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 104. [2022-11-25 17:49:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 103 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2022-11-25 17:49:14,460 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 131 transitions. [2022-11-25 17:49:14,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-25 17:49:14,461 INFO L428 stractBuchiCegarLoop]: Abstraction has 104 states and 131 transitions. [2022-11-25 17:49:14,461 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-25 17:49:14,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 131 transitions. [2022-11-25 17:49:14,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-25 17:49:14,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:49:14,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:49:14,463 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:49:14,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-11-25 17:49:14,464 INFO L748 eck$LassoCheckResult]: Stem: 4222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 4239#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4228#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 4218#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4219#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4259#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4260#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4220#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4221#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4238#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4249#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4250#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4253#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4268#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4269#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4254#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4240#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4241#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4265#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4313#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4312#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4311#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4310#L517-4 lis_~i~0#1 := 1; 4309#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4308#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4307#L521 assume !lis_#t~short11#1; 4306#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4293#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4294#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4292#L519-2 [2022-11-25 17:49:14,464 INFO L750 eck$LassoCheckResult]: Loop: 4292#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4303#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4302#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4301#L521 assume !lis_#t~short11#1; 4284#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4278#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4299#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4298#L521 assume !lis_#t~short11#1; 4246#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4230#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4242#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4292#L519-2 [2022-11-25 17:49:14,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash -696501468, now seen corresponding path program 2 times [2022-11-25 17:49:14,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:14,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280604729] [2022-11-25 17:49:14,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:14,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:49:14,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:49:14,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280604729] [2022-11-25 17:49:14,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280604729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:49:14,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884459663] [2022-11-25 17:49:14,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:49:14,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:49:14,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:14,677 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:49:14,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-11-25 17:49:14,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:49:14,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:49:14,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 17:49:14,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:49:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:49:14,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:49:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 17:49:15,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884459663] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:49:15,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:49:15,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-11-25 17:49:15,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882142091] [2022-11-25 17:49:15,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:49:15,045 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:49:15,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1752732867, now seen corresponding path program 2 times [2022-11-25 17:49:15,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:15,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749446324] [2022-11-25 17:49:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:15,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:49:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:15,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:49:15,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:49:15,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 17:49:15,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-11-25 17:49:15,261 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. cyclomatic complexity: 31 Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:49:15,508 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2022-11-25 17:49:15,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 215 transitions. [2022-11-25 17:49:15,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-25 17:49:15,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 158 states and 197 transitions. [2022-11-25 17:49:15,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-11-25 17:49:15,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2022-11-25 17:49:15,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 197 transitions. [2022-11-25 17:49:15,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:49:15,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 197 transitions. [2022-11-25 17:49:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 197 transitions. [2022-11-25 17:49:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2022-11-25 17:49:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 1.2397260273972603) internal successors, (181), 145 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 181 transitions. [2022-11-25 17:49:15,516 INFO L240 hiAutomatonCegarLoop]: Abstraction has 146 states and 181 transitions. [2022-11-25 17:49:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:49:15,517 INFO L428 stractBuchiCegarLoop]: Abstraction has 146 states and 181 transitions. [2022-11-25 17:49:15,517 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-25 17:49:15,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 181 transitions. [2022-11-25 17:49:15,518 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-25 17:49:15,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:49:15,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:49:15,519 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:49:15,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-25 17:49:15,519 INFO L748 eck$LassoCheckResult]: Stem: 4704#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4705#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 4720#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4710#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 4700#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4701#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4702#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4703#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4755#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4756#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4747#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4749#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4753#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4754#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4759#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4761#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4760#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4721#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4722#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4732#L517-4 lis_~i~0#1 := 1; 4733#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4834#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4833#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4771#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4772#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4766#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4767#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4726#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4706#L520-3 [2022-11-25 17:49:15,519 INFO L750 eck$LassoCheckResult]: Loop: 4706#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4707#L521 assume !lis_#t~short11#1; 4835#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4712#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4706#L520-3 [2022-11-25 17:49:15,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:15,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1509233465, now seen corresponding path program 1 times [2022-11-25 17:49:15,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:15,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405959536] [2022-11-25 17:49:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:15,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:15,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:49:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:15,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:49:15,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2560232, now seen corresponding path program 1 times [2022-11-25 17:49:15,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:15,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268123523] [2022-11-25 17:49:15,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:15,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:15,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:49:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:15,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:49:15,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:15,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1715328338, now seen corresponding path program 2 times [2022-11-25 17:49:15,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:15,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568755613] [2022-11-25 17:49:15,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:15,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:15,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:49:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:15,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:49:33,881 WARN L233 SmtUtils]: Spent 18.10s on a formula simplification. DAG size of input: 296 DAG size of output: 208 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 17:49:38,648 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 17:49:38,648 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 17:49:38,649 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 17:49:38,649 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 17:49:38,649 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 17:49:38,649 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:38,649 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 17:49:38,649 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 17:49:38,649 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration17_Lasso [2022-11-25 17:49:38,649 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 17:49:38,649 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 17:49:38,652 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,654 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,656 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,659 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,661 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,663 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,665 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,667 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,669 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,671 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,673 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,674 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,676 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,679 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,681 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,683 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:38,685 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:43,248 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:43,252 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:43,255 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:43,258 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:43,259 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:43,261 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:43,263 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:43,265 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 17:49:44,161 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 17:49:44,161 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 17:49:44,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,168 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-11-25 17:49:44,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-11-25 17:49:44,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,193 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-11-25 17:49:44,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-11-25 17:49:44,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,212 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-11-25 17:49:44,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:49:44,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:49:44,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-11-25 17:49:44,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,236 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-11-25 17:49:44,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-11-25 17:49:44,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,257 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-11-25 17:49:44,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-11-25 17:49:44,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,278 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-11-25 17:49:44,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-11-25 17:49:44,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,297 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-11-25 17:49:44,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:49:44,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:49:44,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-11-25 17:49:44,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,319 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-11-25 17:49:44,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-11-25 17:49:44,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,337 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-11-25 17:49:44,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-11-25 17:49:44,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,355 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-11-25 17:49:44,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-11-25 17:49:44,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,382 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-11-25 17:49:44,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2022-11-25 17:49:44,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,404 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-11-25 17:49:44,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2022-11-25 17:49:44,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,422 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-11-25 17:49:44,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:49:44,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:49:44,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2022-11-25 17:49:44,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,444 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-11-25 17:49:44,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-11-25 17:49:44,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,466 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-11-25 17:49:44,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-11-25 17:49:44,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,488 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-11-25 17:49:44,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 17:49:44,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 17:49:44,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 17:49:44,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2022-11-25 17:49:44,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,509 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-11-25 17:49:44,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:49:44,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:49:44,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-11-25 17:49:44,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,532 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-11-25 17:49:44,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:49:44,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:49:44,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-11-25 17:49:44,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,556 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-11-25 17:49:44,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:49:44,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:49:44,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-11-25 17:49:44,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,581 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-11-25 17:49:44,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:49:44,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:49:44,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-11-25 17:49:44,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,616 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-11-25 17:49:44,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:49:44,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:49:44,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 17:49:44,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-11-25 17:49:44,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,650 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-11-25 17:49:44,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 17:49:44,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 17:49:44,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 17:49:44,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 17:49:44,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 17:49:44,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 17:49:44,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-25 17:49:44,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-25 17:49:44,822 INFO L443 ModelExtractionUtils]: Simplification made 32 calls to the SMT solver. [2022-11-25 17:49:44,822 INFO L444 ModelExtractionUtils]: 23 out of 58 variables were initially zero. Simplification set additionally 32 variables to zero. [2022-11-25 17:49:44,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:49:44,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:44,825 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:49:44,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-11-25 17:49:44,826 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-25 17:49:44,837 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-25 17:49:44,837 INFO L513 LassoAnalysis]: Proved termination. [2022-11-25 17:49:44,837 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0#1, ULTIMATE.start_lis_~i~0#1) = -1*ULTIMATE.start_lis_~j~0#1 + 1*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2022-11-25 17:49:44,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-11-25 17:49:45,279 INFO L156 tatePredicateManager]: 51 out of 51 supporting invariants were superfluous and have been removed [2022-11-25 17:49:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:45,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:49:45,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:49:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:45,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:49:45,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:49:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:49:45,433 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-25 17:49:45,433 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 146 states and 181 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:45,455 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 146 states and 181 transitions. cyclomatic complexity: 40. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 169 states and 206 transitions. Complement of second has 7 states. [2022-11-25 17:49:45,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-25 17:49:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-11-25 17:49:45,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2022-11-25 17:49:45,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:49:45,456 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-25 17:49:45,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:45,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2022-11-25 17:49:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:45,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:49:45,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:49:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:45,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:49:45,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:49:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:49:45,611 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-25 17:49:45,611 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 146 states and 181 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:45,628 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 146 states and 181 transitions. cyclomatic complexity: 40. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 169 states and 206 transitions. Complement of second has 7 states. [2022-11-25 17:49:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-25 17:49:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-11-25 17:49:45,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2022-11-25 17:49:45,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:49:45,630 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-25 17:49:45,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:45,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:49:45,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:49:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:45,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:49:45,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:49:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:49:45,771 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-25 17:49:45,771 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 146 states and 181 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:45,799 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 146 states and 181 transitions. cyclomatic complexity: 40. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 218 states and 285 transitions. Complement of second has 6 states. [2022-11-25 17:49:45,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-25 17:49:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-11-25 17:49:45,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 4 letters. [2022-11-25 17:49:45,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:49:45,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 32 letters. Loop has 4 letters. [2022-11-25 17:49:45,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:49:45,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 8 letters. [2022-11-25 17:49:45,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-25 17:49:45,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 285 transitions. [2022-11-25 17:49:45,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-25 17:49:45,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 106 states and 133 transitions. [2022-11-25 17:49:45,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-11-25 17:49:45,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-11-25 17:49:45,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 133 transitions. [2022-11-25 17:49:45,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:49:45,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 133 transitions. [2022-11-25 17:49:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 133 transitions. [2022-11-25 17:49:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2022-11-25 17:49:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.2524271844660195) internal successors, (129), 102 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2022-11-25 17:49:45,809 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 129 transitions. [2022-11-25 17:49:45,810 INFO L428 stractBuchiCegarLoop]: Abstraction has 103 states and 129 transitions. [2022-11-25 17:49:45,810 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-25 17:49:45,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 129 transitions. [2022-11-25 17:49:45,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-25 17:49:45,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:49:45,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:49:45,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:49:45,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-25 17:49:45,812 INFO L748 eck$LassoCheckResult]: Stem: 5936#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5937#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 5953#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5942#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 5932#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5933#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5934#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5935#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5952#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5969#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5968#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5967#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5966#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5962#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 5963#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5954#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5955#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5965#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6034#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6032#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6030#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6028#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6026#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6027#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6033#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 6031#L517-4 lis_~i~0#1 := 1; 6029#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6024#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5975#L521 assume !lis_#t~short11#1; 5943#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5944#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5956#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5981#L519-2 [2022-11-25 17:49:45,812 INFO L750 eck$LassoCheckResult]: Loop: 5981#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6002#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5999#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5997#L521 assume !lis_#t~short11#1; 5992#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5990#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5989#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5987#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5986#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5983#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5984#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5981#L519-2 [2022-11-25 17:49:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:45,812 INFO L85 PathProgramCache]: Analyzing trace with hash 880386438, now seen corresponding path program 3 times [2022-11-25 17:49:45,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:45,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742981188] [2022-11-25 17:49:45,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:45,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:46,051 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:49:46,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:49:46,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742981188] [2022-11-25 17:49:46,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742981188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:49:46,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694281066] [2022-11-25 17:49:46,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:49:46,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:49:46,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:46,053 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:49:46,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-11-25 17:49:46,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 17:49:46,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:49:46,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 17:49:46,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:49:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:49:46,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:49:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:49:46,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694281066] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:49:46,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:49:46,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-11-25 17:49:46,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828554652] [2022-11-25 17:49:46,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:49:46,685 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:49:46,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 3 times [2022-11-25 17:49:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:46,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711663747] [2022-11-25 17:49:46,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:46,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:46,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:49:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:46,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:49:46,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:49:47,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 17:49:47,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:49:47,000 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. cyclomatic complexity: 30 Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:49:47,359 INFO L93 Difference]: Finished difference Result 222 states and 279 transitions. [2022-11-25 17:49:47,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 279 transitions. [2022-11-25 17:49:47,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-25 17:49:47,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 106 states and 132 transitions. [2022-11-25 17:49:47,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-11-25 17:49:47,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-11-25 17:49:47,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 132 transitions. [2022-11-25 17:49:47,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-25 17:49:47,363 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 132 transitions. [2022-11-25 17:49:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 132 transitions. [2022-11-25 17:49:47,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2022-11-25 17:49:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 1.2476190476190476) internal successors, (131), 104 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:49:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2022-11-25 17:49:47,366 INFO L240 hiAutomatonCegarLoop]: Abstraction has 105 states and 131 transitions. [2022-11-25 17:49:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:49:47,371 INFO L428 stractBuchiCegarLoop]: Abstraction has 105 states and 131 transitions. [2022-11-25 17:49:47,371 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-11-25 17:49:47,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 131 transitions. [2022-11-25 17:49:47,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-25 17:49:47,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:49:47,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:49:47,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:49:47,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-25 17:49:47,373 INFO L748 eck$LassoCheckResult]: Stem: 6484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6485#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 6501#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6490#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 6480#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6481#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6482#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6483#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6495#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6531#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6530#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6529#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6528#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6519#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6518#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6511#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 6512#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6502#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6503#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6515#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6584#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6583#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6581#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6580#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6578#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6575#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6574#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 6572#L517-4 lis_~i~0#1 := 1; 6571#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6570#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6568#L521 assume !lis_#t~short11#1; 6566#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6564#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6562#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6535#L519-2 [2022-11-25 17:49:47,373 INFO L750 eck$LassoCheckResult]: Loop: 6535#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6556#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6553#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6551#L521 assume !lis_#t~short11#1; 6546#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6544#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6543#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6541#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6540#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6537#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6538#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6535#L519-2 [2022-11-25 17:49:47,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash 146208616, now seen corresponding path program 4 times [2022-11-25 17:49:47,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:47,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172879836] [2022-11-25 17:49:47,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:47,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:47,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:49:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:47,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:49:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 4 times [2022-11-25 17:49:47,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:47,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561430856] [2022-11-25 17:49:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:47,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:49:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:49:47,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:49:47,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:49:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1608993608, now seen corresponding path program 2 times [2022-11-25 17:49:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:49:47,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099501152] [2022-11-25 17:49:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:49:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:49:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:49:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 62 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:49:49,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:49:49,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099501152] [2022-11-25 17:49:49,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099501152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:49:49,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945465216] [2022-11-25 17:49:49,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:49:49,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:49:49,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:49:49,719 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:49:49,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41a1cd53-ec5c-4533-8176-2c68b6ad9e63/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-11-25 17:49:49,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:49:49,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:49:49,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-25 17:49:49,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:49:49,921 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 10 treesize of output 8 [2022-11-25 17:49:50,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-25 17:49:50,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 17:49:50,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:49:50,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 17:49:50,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-25 17:49:50,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:49:50,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:49:50,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-25 17:49:50,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-25 17:49:50,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:49:50,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:49:50,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:49:50,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:49:50,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:49:50,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-25 17:49:50,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-25 17:49:51,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:49:51,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:49:51,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:49:51,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 16 [2022-11-25 17:49:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-25 17:49:51,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:49:51,931 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1387 Int) (v_ArrVal_1388 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1387)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1388) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1)))) is different from false [2022-11-25 17:49:51,952 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_456| Int)) (or (not (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 1) |v_ULTIMATE.start_lis_~i~0#1_456|)) (forall ((v_ArrVal_1387 Int) (v_ArrVal_1388 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |v_ULTIMATE.start_lis_~i~0#1_456|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1387)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1388) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1)))))) is different from false [2022-11-25 17:51:44,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:51:44,267 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 475 treesize of output 296 [2022-11-25 17:51:44,287 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 574 treesize of output 568 [2022-11-25 17:51:44,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 2347 treesize of output 2219 [2022-11-25 17:51:44,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 2167 treesize of output 2103 [2022-11-25 17:51:44,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 2283 treesize of output 2219 [2022-11-25 17:51:44,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 3181 treesize of output 3053 [2022-11-25 17:51:44,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:51:44,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2545 treesize of output 2431 [2022-11-25 17:56:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 27 refuted. 1 times theorem prover too weak. 26 trivial. 9 not checked. [2022-11-25 17:56:13,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945465216] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:56:13,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:56:13,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 16] total 50 [2022-11-25 17:56:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475776015] [2022-11-25 17:56:13,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:56:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:56:14,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 17:56:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2031, Unknown=27, NotChecked=186, Total=2450 [2022-11-25 17:56:14,203 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. cyclomatic complexity: 30 Second operand has 50 states, 50 states have (on average 2.06) internal successors, (103), 50 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:27,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:56:34,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:56:44,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:56:52,104 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 74 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:56:55,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:57:04,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:57:06,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]