./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 5e519f3a 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_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc --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-5e519f3 [2022-11-02 20:32:57,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:32:57,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:32:57,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:32:57,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:32:57,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:32:57,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:32:57,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:32:57,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:32:57,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:32:57,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:32:57,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:32:57,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:32:57,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:32:57,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:32:57,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:32:57,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:32:57,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:32:57,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:32:57,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:32:57,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:32:57,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:32:57,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:32:57,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:32:57,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:32:57,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:32:57,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:32:57,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:32:57,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:32:57,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:32:57,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:32:57,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:32:57,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:32:57,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:32:57,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:32:57,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:32:57,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:32:57,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:32:57,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:32:57,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:32:57,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:32:57,940 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-02 20:32:57,986 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:32:57,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:32:57,987 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:32:57,987 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:32:57,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:32:57,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:32:57,989 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:32:57,989 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-02 20:32:57,989 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-02 20:32:57,990 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-02 20:32:57,991 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-02 20:32:57,991 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-02 20:32:57,991 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-02 20:32:57,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:32:57,992 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:32:57,992 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:32:57,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:32:57,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:32:57,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:32:57,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-02 20:32:57,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-02 20:32:57,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-02 20:32:57,993 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:32:57,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:32:57,995 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-02 20:32:57,995 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:32:57,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-02 20:32:57,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:32:57,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:32:57,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:32:57,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:32:57,998 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-02 20:32:57,998 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_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/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_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc 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-02 20:32:58,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:32:58,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:32:58,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:32:58,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:32:58,337 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:32:58,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-11-02 20:32:58,424 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/data/cb9fc1293/0cf052e9cbb341eba2601bdb161d6cdb/FLAGffcead384 [2022-11-02 20:32:59,136 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:32:59,136 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-11-02 20:32:59,151 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/data/cb9fc1293/0cf052e9cbb341eba2601bdb161d6cdb/FLAGffcead384 [2022-11-02 20:32:59,400 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/data/cb9fc1293/0cf052e9cbb341eba2601bdb161d6cdb [2022-11-02 20:32:59,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:32:59,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:32:59,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:32:59,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:32:59,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:32:59,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:32:59" (1/1) ... [2022-11-02 20:32:59,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43733ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:59, skipping insertion in model container [2022-11-02 20:32:59,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:32:59" (1/1) ... [2022-11-02 20:32:59,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:32:59,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:32:59,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:32:59,931 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:33:00,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:33:00,047 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:33:00,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00 WrapperNode [2022-11-02 20:33:00,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:33:00,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:33:00,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:33:00,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:33:00,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00" (1/1) ... [2022-11-02 20:33:00,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00" (1/1) ... [2022-11-02 20:33:00,139 INFO L138 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2022-11-02 20:33:00,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:33:00,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:33:00,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:33:00,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:33:00,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00" (1/1) ... [2022-11-02 20:33:00,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00" (1/1) ... [2022-11-02 20:33:00,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00" (1/1) ... [2022-11-02 20:33:00,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00" (1/1) ... [2022-11-02 20:33:00,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00" (1/1) ... [2022-11-02 20:33:00,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00" (1/1) ... [2022-11-02 20:33:00,183 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00" (1/1) ... [2022-11-02 20:33:00,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00" (1/1) ... [2022-11-02 20:33:00,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:33:00,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:33:00,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:33:00,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:33:00,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00" (1/1) ... [2022-11-02 20:33:00,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:00,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:00,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:00,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-02 20:33:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:33:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:33:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:33:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:33:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:33:00,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:33:00,457 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:33:00,459 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:33:00,742 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:33:00,749 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:33:00,756 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 20:33:00,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:33:00 BoogieIcfgContainer [2022-11-02 20:33:00,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:33:00,760 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-02 20:33:00,761 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-02 20:33:00,767 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-02 20:33:00,768 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:33:00,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 08:32:59" (1/3) ... [2022-11-02 20:33:00,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9812726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:33:00, skipping insertion in model container [2022-11-02 20:33:00,769 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:33:00,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:00" (2/3) ... [2022-11-02 20:33:00,770 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9812726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:33:00, skipping insertion in model container [2022-11-02 20:33:00,770 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:33:00,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:33:00" (3/3) ... [2022-11-02 20:33:00,772 INFO L332 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2022-11-02 20:33:00,863 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-02 20:33:00,863 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-02 20:33:00,863 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-02 20:33:00,863 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-02 20:33:00,864 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-02 20:33:00,864 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-02 20:33:00,864 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-02 20:33:00,864 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-02 20:33:00,869 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-02 20:33:00,893 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2022-11-02 20:33:00,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:00,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:00,900 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 20:33:00,900 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 20:33:00,900 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-02 20:33:00,901 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-02 20:33:00,910 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2022-11-02 20:33:00,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:00,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:00,911 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 20:33:00,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 20:33:00,921 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-02 20:33:00,922 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-02 20:33:00,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-11-02 20:33:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:00,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93484583] [2022-11-02 20:33:00,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:00,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:01,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:01,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:01,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:01,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-11-02 20:33:01,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:01,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121237641] [2022-11-02 20:33:01,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:01,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:01,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:01,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:01,223 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-11-02 20:33:01,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:01,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982204693] [2022-11-02 20:33:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:01,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:01,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:01,815 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:33:01,816 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:33:01,816 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:33:01,816 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:33:01,817 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:33:01,817 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:01,817 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:33:01,818 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:33:01,818 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2022-11-02 20:33:01,818 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:33:01,819 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:33:01,848 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-02 20:33:01,861 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-02 20:33:01,869 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-02 20:33:01,875 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-02 20:33:01,881 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-02 20:33:01,884 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-02 20:33:02,109 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-02 20:33:02,114 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-02 20:33:02,117 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-02 20:33:02,121 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-02 20:33:02,565 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:33:02,570 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:33:02,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:02,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:02,574 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:02,577 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-02 20:33:02,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-02 20:33:02,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:02,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:02,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:02,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:02,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:02,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:02,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:02,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:02,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:02,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:02,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:02,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:02,659 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-02 20:33:02,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-02 20:33:02,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:02,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:02,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:02,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:02,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:02,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:02,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:02,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:02,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:02,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:02,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:02,737 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-02 20:33:02,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-02 20:33:02,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:02,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:02,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:02,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:02,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:02,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:02,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:02,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:02,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:02,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:02,814 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:02,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:33:02,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-02 20:33:02,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:02,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:02,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:02,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:02,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:02,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:02,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:02,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:02,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:02,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:02,912 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:02,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-02 20:33:02,920 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-02 20:33:02,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:02,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:02,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:02,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:02,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:02,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:02,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:02,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:02,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:02,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:02,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:02,993 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:03,001 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-02 20:33:03,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-02 20:33:03,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:03,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:03,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:03,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:03,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:03,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:03,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:03,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:03,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:03,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:03,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:03,077 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:03,090 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-02 20:33:03,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-02 20:33:03,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:03,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:03,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:03,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:03,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:03,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:03,164 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:33:03,211 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-11-02 20:33:03,212 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-11-02 20:33:03,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:03,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:03,228 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:03,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-02 20:33:03,237 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:33:03,255 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-02 20:33:03,256 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:33:03,256 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-02 20:33:03,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:03,311 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-11-02 20:33:03,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:03,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:33:03,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:03,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:33:03,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:03,453 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-02 20:33:03,494 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-02 20:33:03,496 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-02 20:33:03,559 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-02 20:33:03,562 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-02 20:33:03,567 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-02 20:33:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-11-02 20:33:03,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2022-11-02 20:33:03,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:33:03,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2022-11-02 20:33:03,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:33:03,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 4 letters. [2022-11-02 20:33:03,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:33:03,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 99 transitions. [2022-11-02 20:33:03,577 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-02 20:33:03,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 21 states and 30 transitions. [2022-11-02 20:33:03,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-11-02 20:33:03,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-02 20:33:03,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2022-11-02 20:33:03,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:33:03,584 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-11-02 20:33:03,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2022-11-02 20:33:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-02 20:33:03,613 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-02 20:33:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2022-11-02 20:33:03,615 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-11-02 20:33:03,615 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-11-02 20:33:03,615 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-02 20:33:03,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2022-11-02 20:33:03,616 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-02 20:33:03,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:03,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:03,617 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:33:03,618 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 20:33:03,618 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-02 20:33:03,618 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-02 20:33:03,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:03,619 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-11-02 20:33:03,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:03,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738211627] [2022-11-02 20:33:03,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:03,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:03,794 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-02 20:33:03,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:03,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738211627] [2022-11-02 20:33:03,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738211627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:03,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:03,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:33:03,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711287888] [2022-11-02 20:33:03,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:03,800 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:33:03,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2022-11-02 20:33:03,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:03,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028850515] [2022-11-02 20:33:03,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:03,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:03,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:03,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:03,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:33:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:33:03,956 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-02 20:33:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:03,988 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-11-02 20:33:03,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2022-11-02 20:33:03,989 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-02 20:33:03,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2022-11-02 20:33:03,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-11-02 20:33:03,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-02 20:33:03,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-11-02 20:33:03,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:33:03,991 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-11-02 20:33:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-11-02 20:33:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-11-02 20:33:03,994 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-02 20:33:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-11-02 20:33:03,994 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-11-02 20:33:03,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:33:03,996 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-11-02 20:33:03,996 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-02 20:33:03,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2022-11-02 20:33:03,997 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-02 20:33:03,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:03,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:03,998 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:03,998 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 20:33:03,999 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-02 20:33:03,999 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-02 20:33:03,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:04,000 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-11-02 20:33:04,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:04,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803554233] [2022-11-02 20:33:04,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:04,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:04,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:04,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:04,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:04,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2022-11-02 20:33:04,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:04,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596440186] [2022-11-02 20:33:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:04,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:04,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:04,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2022-11-02 20:33:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:04,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538451015] [2022-11-02 20:33:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:04,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:04,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:04,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-11-02 20:33:05,325 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:33:05,326 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:33:05,326 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:33:05,326 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:33:05,326 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:33:05,326 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:05,326 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:33:05,326 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:33:05,326 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2022-11-02 20:33:05,327 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:33:05,327 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:33:05,340 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-02 20:33:05,344 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-02 20:33:05,347 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-02 20:33:05,350 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-02 20:33:05,354 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-02 20:33:05,358 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-02 20:33:05,364 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-02 20:33:05,367 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-02 20:33:05,371 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-02 20:33:05,377 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-02 20:33:05,380 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-02 20:33:05,384 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-02 20:33:05,388 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-02 20:33:05,395 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:33:05,399 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:33:05,402 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-02 20:33:05,406 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-02 20:33:05,409 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-02 20:33:05,412 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-02 20:33:05,416 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-02 20:33:05,419 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-02 20:33:05,422 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-02 20:33:05,425 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-02 20:33:05,428 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-02 20:33:05,432 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-02 20:33:06,274 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-02 20:33:07,267 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:33:07,272 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:33:07,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:07,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:07,275 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:07,286 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-02 20:33:07,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-02 20:33:07,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:07,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:07,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:07,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:07,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:07,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:07,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:07,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:07,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:07,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:07,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:07,369 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:07,377 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-02 20:33:07,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:07,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:07,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:07,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:07,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:07,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:07,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:07,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-02 20:33:07,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:07,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:07,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:07,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:07,446 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:07,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-02 20:33:07,457 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-02 20:33:07,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:07,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:07,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:07,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:07,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:07,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:07,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:07,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:07,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:07,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:07,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:07,527 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:07,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-02 20:33:07,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-02 20:33:07,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:07,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:07,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:07,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:07,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:07,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:07,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:07,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:07,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:07,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:07,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:07,613 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:07,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-02 20:33:07,619 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-02 20:33:07,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:07,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:07,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:07,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:07,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:07,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:07,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:07,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:07,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:07,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:07,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:07,684 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:07,693 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-02 20:33:07,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-02 20:33:07,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:07,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:07,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:07,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:07,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:07,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:07,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:07,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:07,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:07,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:07,770 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:07,779 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-02 20:33:07,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-02 20:33:07,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:07,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:07,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:07,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:07,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:07,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:07,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:07,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:07,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:07,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:07,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:07,849 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:07,861 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-02 20:33:07,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:07,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:07,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:07,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:07,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:07,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:07,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-02 20:33:07,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:07,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:07,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:07,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:07,938 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:07,946 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-02 20:33:07,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-02 20:33:07,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:07,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:07,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:07,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:07,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:07,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:07,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:07,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:08,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,019 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,028 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-02 20:33:08,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-02 20:33:08,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:08,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:08,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:08,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:08,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,110 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,118 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-02 20:33:08,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-02 20:33:08,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:08,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:08,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:08,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:08,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,182 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-02 20:33:08,184 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-02 20:33:08,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:08,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:08,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:08,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:08,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,246 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-02 20:33:08,247 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-02 20:33:08,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:08,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:08,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-11-02 20:33:08,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,288 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-02 20:33:08,290 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-02 20:33:08,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:08,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:08,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:08,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-11-02 20:33:08,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,327 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-02 20:33:08,329 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-02 20:33:08,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:08,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:08,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:08,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-11-02 20:33:08,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,369 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-02 20:33:08,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-02 20:33:08,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:08,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:08,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:08,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,458 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,464 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-02 20:33:08,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-02 20:33:08,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:08,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:08,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:08,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:08,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,540 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,544 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-02 20:33:08,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-02 20:33:08,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:08,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:08,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:08,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-11-02 20:33:08,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,606 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,609 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-02 20:33:08,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-02 20:33:08,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:08,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:08,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:08,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,678 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:33:08,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-02 20:33:08,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:08,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:08,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:08,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:08,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,759 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,764 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-02 20:33:08,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-02 20:33:08,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:08,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:08,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:08,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-11-02 20:33:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,811 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,812 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-02 20:33:08,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-02 20:33:08,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:08,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:08,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:08,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-11-02 20:33:08,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,853 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-02 20:33:08,855 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-02 20:33:08,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:08,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:08,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:08,870 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-11-02 20:33:08,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,894 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-02 20:33:08,896 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-02 20:33:08,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:08,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:08,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:08,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:08,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:08,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:08,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:08,979 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:08,982 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-02 20:33:08,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-02 20:33:08,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:08,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:08,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:08,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:09,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:09,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:09,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:09,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:09,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:09,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:09,058 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:09,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-02 20:33:09,060 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-02 20:33:09,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:09,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:09,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:09,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:09,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:09,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:09,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:09,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:09,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-11-02 20:33:09,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:09,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:09,114 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:09,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-02 20:33:09,116 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-02 20:33:09,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:09,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:09,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:09,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:09,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:09,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:09,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:09,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:09,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-11-02 20:33:09,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:09,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:09,156 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:09,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-02 20:33:09,161 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-02 20:33:09,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:09,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:09,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:09,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:09,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:09,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:09,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:09,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:09,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:09,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:09,231 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:09,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-02 20:33:09,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-02 20:33:09,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:09,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:09,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:09,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:09,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:09,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:09,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:09,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-11-02 20:33:09,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:09,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:09,306 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:09,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-02 20:33:09,311 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-02 20:33:09,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:09,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:09,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:09,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:09,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:09,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:09,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:09,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:09,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:09,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:09,366 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:09,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-02 20:33:09,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-02 20:33:09,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:09,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:09,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:09,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:09,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:09,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:09,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:09,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-11-02 20:33:09,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:09,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:09,418 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:09,420 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-02 20:33:09,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-02 20:33:09,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:09,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:09,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:09,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:09,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:09,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:09,491 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:33:09,601 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2022-11-02 20:33:09,601 INFO L444 ModelExtractionUtils]: 11 out of 61 variables were initially zero. Simplification set additionally 47 variables to zero. [2022-11-02 20:33:09,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:09,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:09,603 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:09,612 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:33:09,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-02 20:33:09,648 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-02 20:33:09,648 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:33:09,648 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-02 20:33:09,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:09,791 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2022-11-02 20:33:09,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:09,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:33:09,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:09,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:33:09,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:09,894 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-02 20:33:09,895 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-02 20:33:09,895 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-02 20:33:09,919 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-02 20:33:09,920 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-02 20:33:09,922 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-02 20:33:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-11-02 20:33:09,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2022-11-02 20:33:09,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:33:09,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2022-11-02 20:33:09,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:33:09,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2022-11-02 20:33:09,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:33:09,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2022-11-02 20:33:09,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-02 20:33:09,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2022-11-02 20:33:09,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-11-02 20:33:09,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-11-02 20:33:09,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2022-11-02 20:33:09,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:33:09,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-11-02 20:33:09,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2022-11-02 20:33:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-02 20:33:09,942 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-02 20:33:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2022-11-02 20:33:09,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-11-02 20:33:09,943 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-11-02 20:33:09,943 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-02 20:33:09,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2022-11-02 20:33:09,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-02 20:33:09,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:09,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:09,947 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:09,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:33:09,950 INFO L748 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 383#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; 391#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 387#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; 378#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; 379#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 380#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 381#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; 398#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 399#L517-4 lis_~i~0#1 := 1; 390#L519-3 [2022-11-02 20:33:09,950 INFO L750 eck$LassoCheckResult]: Loop: 390#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 384#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 385#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 390#L519-3 [2022-11-02 20:33:09,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2022-11-02 20:33:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:09,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689721419] [2022-11-02 20:33:09,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:09,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:10,129 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-02 20:33:10,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:10,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689721419] [2022-11-02 20:33:10,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689721419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:10,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:10,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:33:10,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622801224] [2022-11-02 20:33:10,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:10,130 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:33:10,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:10,131 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2022-11-02 20:33:10,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:10,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984746935] [2022-11-02 20:33:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:10,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:10,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:10,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:10,166 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:33:10,167 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:33:10,167 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:33:10,167 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:33:10,167 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-02 20:33:10,167 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:10,167 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:33:10,168 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:33:10,168 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2022-11-02 20:33:10,168 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:33:10,168 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:33:10,171 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-02 20:33:10,181 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-02 20:33:10,184 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-02 20:33:10,187 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-02 20:33:10,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-02 20:33:10,249 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:33:10,250 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-02 20:33:10,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:10,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:10,253 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:10,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-02 20:33:10,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:33:10,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:33:10,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-11-02 20:33:10,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:10,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:10,295 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:10,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-02 20:33:10,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-02 20:33:10,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:33:10,466 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-02 20:33:10,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-11-02 20:33:10,470 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:33:10,470 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:33:10,470 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:33:10,470 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:33:10,470 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:33:10,470 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:10,470 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:33:10,470 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:33:10,470 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2022-11-02 20:33:10,471 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:33:10,471 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:33:10,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-02 20:33:10,493 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-02 20:33:10,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-02 20:33:10,499 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-02 20:33:10,502 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-02 20:33:10,565 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:33:10,565 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:33:10,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:10,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:10,567 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:10,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-02 20:33:10,578 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-02 20:33:10,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:10,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:33:10,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:10,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:10,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:10,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:33:10,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:33:10,611 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:33:10,615 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-02 20:33:10,616 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-02 20:33:10,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:10,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:10,618 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:10,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:33:10,620 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-02 20:33:10,620 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:33:10,620 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-02 20:33:10,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-02 20:33:10,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:10,644 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-02 20:33:10,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:10,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:33:10,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:10,713 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:33:10,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:10,748 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-02 20:33:10,751 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-02 20:33:10,751 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-02 20:33:10,830 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-02 20:33:10,830 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-02 20:33:10,831 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-02 20:33:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-11-02 20:33:10,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2022-11-02 20:33:10,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:33:10,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2022-11-02 20:33:10,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:33:10,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2022-11-02 20:33:10,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:33:10,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2022-11-02 20:33:10,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-11-02 20:33:10,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2022-11-02 20:33:10,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-02 20:33:10,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-11-02 20:33:10,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2022-11-02 20:33:10,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:33:10,835 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2022-11-02 20:33:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2022-11-02 20:33:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2022-11-02 20:33:10,837 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-02 20:33:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2022-11-02 20:33:10,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 50 transitions. [2022-11-02 20:33:10,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:10,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:33:10,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:33:10,839 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-02 20:33:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:10,889 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2022-11-02 20:33:10,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2022-11-02 20:33:10,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-02 20:33:10,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2022-11-02 20:33:10,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-11-02 20:33:10,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-11-02 20:33:10,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2022-11-02 20:33:10,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:33:10,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-11-02 20:33:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2022-11-02 20:33:10,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-11-02 20:33:10,894 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-02 20:33:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2022-11-02 20:33:10,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-11-02 20:33:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:33:10,895 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-11-02 20:33:10,896 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-02 20:33:10,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2022-11-02 20:33:10,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-02 20:33:10,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:10,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:10,897 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:10,897 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:10,897 INFO L748 eck$LassoCheckResult]: Stem: 583#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 584#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; 598#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 590#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; 579#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; 580#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 581#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 582#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; 607#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); 599#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 600#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 608#L517-4 lis_~i~0#1 := 1; 609#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 585#L520-3 [2022-11-02 20:33:10,898 INFO L750 eck$LassoCheckResult]: Loop: 585#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; 586#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; 591#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; 592#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 603#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 595#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 596#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 585#L520-3 [2022-11-02 20:33:10,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:10,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2022-11-02 20:33:10,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:10,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15193249] [2022-11-02 20:33:10,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:10,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:11,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:11,047 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-02 20:33:11,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:11,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15193249] [2022-11-02 20:33:11,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15193249] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:11,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292708152] [2022-11-02 20:33:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:11,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:11,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:11,050 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:11,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-02 20:33:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:11,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:33:11,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:11,189 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-02 20:33:11,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:33:11,249 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-02 20:33:11,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292708152] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:33:11,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:33:11,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-11-02 20:33:11,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628854329] [2022-11-02 20:33:11,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:33:11,250 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:33:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:11,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2022-11-02 20:33:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:11,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643603240] [2022-11-02 20:33:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:11,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:11,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:11,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:11,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:11,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:33:11,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:33:11,498 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-02 20:33:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:11,733 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2022-11-02 20:33:11,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 109 transitions. [2022-11-02 20:33:11,735 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-11-02 20:33:11,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 81 transitions. [2022-11-02 20:33:11,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-11-02 20:33:11,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-11-02 20:33:11,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2022-11-02 20:33:11,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:33:11,736 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 81 transitions. [2022-11-02 20:33:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2022-11-02 20:33:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2022-11-02 20:33:11,739 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-02 20:33:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-11-02 20:33:11,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-11-02 20:33:11,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:33:11,740 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-11-02 20:33:11,740 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-02 20:33:11,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2022-11-02 20:33:11,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-02 20:33:11,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:11,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:11,742 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:11,742 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:11,742 INFO L748 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 796#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; 810#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 802#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; 791#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; 792#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 793#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; 794#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 824#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 819#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; 820#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); 811#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 812#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); 823#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 825#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 821#L517-4 lis_~i~0#1 := 1; 813#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 797#L520-3 [2022-11-02 20:33:11,743 INFO L750 eck$LassoCheckResult]: Loop: 797#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; 798#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; 803#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; 804#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 815#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 807#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 808#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 797#L520-3 [2022-11-02 20:33:11,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2022-11-02 20:33:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:11,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419193487] [2022-11-02 20:33:11,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:11,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:11,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:11,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2022-11-02 20:33:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:11,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023636784] [2022-11-02 20:33:11,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:11,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:11,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:11,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:11,799 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2022-11-02 20:33:11,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:11,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966931681] [2022-11-02 20:33:11,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:11,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:12,005 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-02 20:33:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:12,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966931681] [2022-11-02 20:33:12,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966931681] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:12,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554808349] [2022-11-02 20:33:12,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:12,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:12,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:12,008 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:12,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-11-02 20:33:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:12,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:33:12,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:12,212 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-02 20:33:12,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:33:12,298 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-02 20:33:12,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554808349] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:33:12,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:33:12,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-11-02 20:33:12,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596069289] [2022-11-02 20:33:12,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:33:12,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:12,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:33:12,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:33:12,501 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-02 20:33:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:12,681 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-11-02 20:33:12,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 92 transitions. [2022-11-02 20:33:12,682 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2022-11-02 20:33:12,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 83 transitions. [2022-11-02 20:33:12,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-11-02 20:33:12,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-11-02 20:33:12,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 83 transitions. [2022-11-02 20:33:12,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:33:12,683 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-11-02 20:33:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 83 transitions. [2022-11-02 20:33:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-11-02 20:33:12,686 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-02 20:33:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2022-11-02 20:33:12,686 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 75 transitions. [2022-11-02 20:33:12,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:33:12,692 INFO L428 stractBuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2022-11-02 20:33:12,693 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-02 20:33:12,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2022-11-02 20:33:12,694 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-11-02 20:33:12,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:12,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:12,696 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:12,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-02 20:33:12,699 INFO L748 eck$LassoCheckResult]: Stem: 1066#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1067#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; 1081#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1073#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; 1062#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; 1063#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1064#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; 1065#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1110#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1092#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; 1093#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); 1082#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1083#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); 1096#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1100#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1094#L517-4 lis_~i~0#1 := 1; 1095#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1104#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; 1088#L521 [2022-11-02 20:33:12,699 INFO L750 eck$LassoCheckResult]: Loop: 1088#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; 1074#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; 1075#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1087#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; 1088#L521 [2022-11-02 20:33:12,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1159051365, now seen corresponding path program 1 times [2022-11-02 20:33:12,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:12,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969927838] [2022-11-02 20:33:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:12,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:12,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:12,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2655420, now seen corresponding path program 1 times [2022-11-02 20:33:12,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:12,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126347114] [2022-11-02 20:33:12,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:12,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:12,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:12,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:12,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:12,802 INFO L85 PathProgramCache]: Analyzing trace with hash -651990240, now seen corresponding path program 1 times [2022-11-02 20:33:12,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:12,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406144924] [2022-11-02 20:33:12,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:12,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:12,936 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-02 20:33:12,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:12,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406144924] [2022-11-02 20:33:12,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406144924] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:12,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032779043] [2022-11-02 20:33:12,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:12,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:12,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:12,939 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:12,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-02 20:33:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:13,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:33:13,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:13,076 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-02 20:33:13,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:33:13,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032779043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:13,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:33:13,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-11-02 20:33:13,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885271446] [2022-11-02 20:33:13,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:13,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:33:13,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:33:13,291 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-02 20:33:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:13,350 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-11-02 20:33:13,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2022-11-02 20:33:13,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-02 20:33:13,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2022-11-02 20:33:13,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-11-02 20:33:13,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-11-02 20:33:13,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2022-11-02 20:33:13,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:33:13,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-11-02 20:33:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2022-11-02 20:33:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2022-11-02 20:33:13,355 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-02 20:33:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2022-11-02 20:33:13,356 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 88 transitions. [2022-11-02 20:33:13,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:33:13,357 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2022-11-02 20:33:13,357 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-02 20:33:13,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 88 transitions. [2022-11-02 20:33:13,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-02 20:33:13,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:13,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:13,358 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-02 20:33:13,358 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:33:13,359 INFO L748 eck$LassoCheckResult]: Stem: 1269#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1270#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; 1284#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1276#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; 1265#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; 1266#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1267#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; 1268#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1314#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1301#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; 1302#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); 1305#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1306#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); 1285#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1286#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1303#L517-4 lis_~i~0#1 := 1; 1287#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1289#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1327#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1309#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 1304#L519-4 lis_~i~0#1 := 0; 1298#L523-3 [2022-11-02 20:33:13,359 INFO L750 eck$LassoCheckResult]: Loop: 1298#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); 1299#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; 1300#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 1298#L523-3 [2022-11-02 20:33:13,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:13,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2057131266, now seen corresponding path program 1 times [2022-11-02 20:33:13,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:13,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976794777] [2022-11-02 20:33:13,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:13,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:13,417 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-02 20:33:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:13,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976794777] [2022-11-02 20:33:13,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976794777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:13,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:13,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:33:13,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559907920] [2022-11-02 20:33:13,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:13,418 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:33:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:13,419 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2022-11-02 20:33:13,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:13,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251213297] [2022-11-02 20:33:13,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:13,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:13,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:13,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:13,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:33:13,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:33:13,475 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-02 20:33:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:13,511 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2022-11-02 20:33:13,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2022-11-02 20:33:13,512 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-02 20:33:13,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 88 transitions. [2022-11-02 20:33:13,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-02 20:33:13,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-02 20:33:13,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 88 transitions. [2022-11-02 20:33:13,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:33:13,513 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-11-02 20:33:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 88 transitions. [2022-11-02 20:33:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-11-02 20:33:13,517 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-02 20:33:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2022-11-02 20:33:13,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-11-02 20:33:13,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:33:13,519 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-11-02 20:33:13,519 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-02 20:33:13,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 86 transitions. [2022-11-02 20:33:13,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-02 20:33:13,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:13,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:13,520 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-02 20:33:13,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:13,521 INFO L748 eck$LassoCheckResult]: Stem: 1407#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1408#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; 1420#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1413#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; 1403#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; 1404#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1405#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; 1406#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);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; 1453#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1452#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1454#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; 1438#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); 1421#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1422#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); 1451#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1450#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1449#L517-4 lis_~i~0#1 := 1; 1447#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1448#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; 1428#L521 assume !lis_#t~short11#1; 1414#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); 1415#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1409#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1410#L519-2 [2022-11-02 20:33:13,521 INFO L750 eck$LassoCheckResult]: Loop: 1410#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1418#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1442#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; 1459#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; 1461#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; 1460#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1458#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1410#L519-2 [2022-11-02 20:33:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:13,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1034472260, now seen corresponding path program 1 times [2022-11-02 20:33:13,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:13,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871842276] [2022-11-02 20:33:13,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:13,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:13,558 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-02 20:33:13,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:13,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871842276] [2022-11-02 20:33:13,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871842276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:13,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:13,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:33:13,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985851456] [2022-11-02 20:33:13,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:13,559 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:33:13,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 3 times [2022-11-02 20:33:13,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:13,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954327468] [2022-11-02 20:33:13,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:13,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:13,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:13,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:13,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:13,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:33:13,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:33:13,793 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-02 20:33:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:13,807 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2022-11-02 20:33:13,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2022-11-02 20:33:13,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-02 20:33:13,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2022-11-02 20:33:13,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-11-02 20:33:13,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-11-02 20:33:13,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2022-11-02 20:33:13,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:33:13,810 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-02 20:33:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2022-11-02 20:33:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-02 20:33:13,813 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-02 20:33:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2022-11-02 20:33:13,814 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-02 20:33:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:33:13,815 INFO L428 stractBuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-02 20:33:13,815 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-02 20:33:13,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2022-11-02 20:33:13,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-02 20:33:13,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:13,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:13,816 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-02 20:33:13,817 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:13,817 INFO L748 eck$LassoCheckResult]: Stem: 1546#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1547#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; 1561#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1552#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; 1542#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; 1543#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1544#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; 1545#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1584#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; 1585#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1606#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1605#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; 1604#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); 1603#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1601#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); 1600#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1599#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1596#L517-4 lis_~i~0#1 := 1; 1593#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1594#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; 1610#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; 1608#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); 1607#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1592#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1591#L519-2 [2022-11-02 20:33:13,817 INFO L750 eck$LassoCheckResult]: Loop: 1591#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1590#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1548#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; 1549#L521 assume !lis_#t~short11#1; 1553#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; 1554#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1564#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1591#L519-2 [2022-11-02 20:33:13,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:13,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2022-11-02 20:33:13,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:13,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344798158] [2022-11-02 20:33:13,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:13,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:13,990 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-02 20:33:13,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:13,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344798158] [2022-11-02 20:33:13,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344798158] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:13,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480679722] [2022-11-02 20:33:13,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:13,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:13,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:13,999 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:14,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-02 20:33:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:14,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 20:33:14,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:14,198 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-02 20:33:14,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:33:14,272 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-02 20:33:14,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480679722] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:33:14,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:33:14,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-02 20:33:14,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284263040] [2022-11-02 20:33:14,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:33:14,274 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:33:14,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash 782608452, now seen corresponding path program 1 times [2022-11-02 20:33:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:14,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175519073] [2022-11-02 20:33:14,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:14,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:14,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:14,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:14,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:14,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:33:14,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:33:14,397 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-02 20:33:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:14,659 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2022-11-02 20:33:14,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 99 transitions. [2022-11-02 20:33:14,659 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-11-02 20:33:14,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 99 transitions. [2022-11-02 20:33:14,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-11-02 20:33:14,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-11-02 20:33:14,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 99 transitions. [2022-11-02 20:33:14,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:33:14,661 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-11-02 20:33:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 99 transitions. [2022-11-02 20:33:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-11-02 20:33:14,664 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-02 20:33:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-11-02 20:33:14,665 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-11-02 20:33:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:33:14,669 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-11-02 20:33:14,669 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-02 20:33:14,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2022-11-02 20:33:14,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-02 20:33:14,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:14,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:14,671 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-02 20:33:14,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:33:14,671 INFO L748 eck$LassoCheckResult]: Stem: 1858#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1859#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; 1873#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1864#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; 1854#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; 1855#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1856#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; 1857#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1895#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1897#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; 1908#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); 1907#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1906#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); 1905#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1904#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1890#L517-4 lis_~i~0#1 := 1; 1876#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1860#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; 1861#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; 1882#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); 1866#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1879#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1894#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1914#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 1891#L519-4 lis_~i~0#1 := 0; 1885#L523-3 [2022-11-02 20:33:14,671 INFO L750 eck$LassoCheckResult]: Loop: 1885#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); 1886#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; 1887#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 1885#L523-3 [2022-11-02 20:33:14,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2022-11-02 20:33:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:14,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027256068] [2022-11-02 20:33:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:14,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:14,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:14,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 2 times [2022-11-02 20:33:14,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:14,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869826215] [2022-11-02 20:33:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:14,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:14,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:14,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:14,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2022-11-02 20:33:14,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:14,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023573775] [2022-11-02 20:33:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:14,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:14,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:14,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:21,286 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:33:21,286 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:33:21,286 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:33:21,286 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:33:21,286 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:33:21,287 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:21,287 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:33:21,287 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:33:21,287 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration11_Lasso [2022-11-02 20:33:21,287 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:33:21,287 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:33:21,292 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-02 20:33:23,893 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-02 20:33:23,896 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-02 20:33:23,898 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-02 20:33:23,901 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-02 20:33:23,904 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-02 20:33:23,906 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-02 20:33:23,909 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-02 20:33:23,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-02 20:33:23,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-02 20:33:23,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-02 20:33:23,921 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-02 20:33:23,923 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-02 20:33:23,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-02 20:33:23,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-02 20:33:23,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-02 20:33:23,933 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-02 20:33:23,935 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-02 20:33:23,943 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-02 20:33:23,945 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-02 20:33:23,947 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-02 20:33:23,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-02 20:33:23,951 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-02 20:33:23,953 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-02 20:33:25,149 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:33:25,149 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:33:25,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:25,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:25,155 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:25,159 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-02 20:33:25,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:25,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:25,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:25,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:25,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:25,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:25,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:33:25,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-11-02 20:33:25,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:25,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:25,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:25,232 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:25,235 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-02 20:33:25,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-11-02 20:33:25,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:33:25,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:33:25,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:33:25,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:33:25,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:33:25,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:33:25,347 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:33:25,549 INFO L443 ModelExtractionUtils]: Simplification made 44 calls to the SMT solver. [2022-11-02 20:33:25,550 INFO L444 ModelExtractionUtils]: 11 out of 67 variables were initially zero. Simplification set additionally 51 variables to zero. [2022-11-02 20:33:25,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:33:25,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:25,552 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:25,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-11-02 20:33:25,554 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:33:25,566 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-11-02 20:33:25,567 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:33:25,567 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~best~0#1.base)_2, ULTIMATE.start_lis_~i~0#1) = 9*v_rep(select #length ULTIMATE.start_lis_~best~0#1.base)_2 - 16*ULTIMATE.start_lis_~i~0#1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0#1.offset + 4*ULTIMATE.start_main_~i~1#1 >= 0] [2022-11-02 20:33:25,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:25,943 INFO L156 tatePredicateManager]: 43 out of 46 supporting invariants were superfluous and have been removed [2022-11-02 20:33:25,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:26,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-02 20:33:26,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:26,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:26,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 20:33:26,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:26,482 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-02 20:33:26,482 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2022-11-02 20:33:26,483 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 93 transitions. cyclomatic complexity: 28 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:26,614 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 93 transitions. cyclomatic complexity: 28. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 81 states and 107 transitions. Complement of second has 10 states. [2022-11-02 20:33:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2022-11-02 20:33:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-11-02 20:33:26,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 50 transitions. Stem has 25 letters. Loop has 3 letters. [2022-11-02 20:33:26,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:33:26,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 50 transitions. Stem has 28 letters. Loop has 3 letters. [2022-11-02 20:33:26,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:33:26,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 50 transitions. Stem has 25 letters. Loop has 6 letters. [2022-11-02 20:33:26,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:33:26,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2022-11-02 20:33:26,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-02 20:33:26,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 77 transitions. [2022-11-02 20:33:26,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-11-02 20:33:26,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-11-02 20:33:26,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 77 transitions. [2022-11-02 20:33:26,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:33:26,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 77 transitions. [2022-11-02 20:33:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 77 transitions. [2022-11-02 20:33:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2022-11-02 20:33:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 54 states have internal predecessors, (73), 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-02 20:33:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2022-11-02 20:33:26,627 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 73 transitions. [2022-11-02 20:33:26,627 INFO L428 stractBuchiCegarLoop]: Abstraction has 55 states and 73 transitions. [2022-11-02 20:33:26,627 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-02 20:33:26,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 73 transitions. [2022-11-02 20:33:26,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-02 20:33:26,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:26,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:26,629 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-02 20:33:26,629 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:26,629 INFO L748 eck$LassoCheckResult]: Stem: 2319#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2320#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; 2334#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2325#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; 2315#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; 2316#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2317#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; 2318#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2366#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; 2356#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2355#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2350#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; 2351#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); 2335#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2336#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); 2354#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2359#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); 2358#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2357#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2352#L517-4 lis_~i~0#1 := 1; 2339#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2340#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; 2345#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; 2346#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); 2327#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2337#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2330#L519-2 [2022-11-02 20:33:26,630 INFO L750 eck$LassoCheckResult]: Loop: 2330#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2331#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2321#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; 2322#L521 assume !lis_#t~short11#1; 2362#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; 2361#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2360#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2330#L519-2 [2022-11-02 20:33:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2022-11-02 20:33:26,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:26,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098513420] [2022-11-02 20:33:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:26,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:26,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:26,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:26,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash 782608452, now seen corresponding path program 2 times [2022-11-02 20:33:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:26,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748191363] [2022-11-02 20:33:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:26,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:26,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:26,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1635570875, now seen corresponding path program 1 times [2022-11-02 20:33:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:26,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612918365] [2022-11-02 20:33:26,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:26,866 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-02 20:33:26,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:26,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612918365] [2022-11-02 20:33:26,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612918365] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:26,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240879536] [2022-11-02 20:33:26,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:26,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:26,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:26,872 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:26,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-11-02 20:33:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:27,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:33:27,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:27,068 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-02 20:33:27,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:33:27,152 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-02 20:33:27,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240879536] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:33:27,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:33:27,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-02 20:33:27,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580727416] [2022-11-02 20:33:27,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:33:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:27,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:33:27,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:33:27,275 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. cyclomatic complexity: 23 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-02 20:33:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:27,381 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2022-11-02 20:33:27,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 96 transitions. [2022-11-02 20:33:27,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-11-02 20:33:27,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 49 states and 62 transitions. [2022-11-02 20:33:27,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-02 20:33:27,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-02 20:33:27,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 62 transitions. [2022-11-02 20:33:27,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:33:27,383 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 62 transitions. [2022-11-02 20:33:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 62 transitions. [2022-11-02 20:33:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-11-02 20:33:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.25) internal successors, (55), 43 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-02 20:33:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-11-02 20:33:27,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-11-02 20:33:27,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:33:27,387 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-11-02 20:33:27,387 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-02 20:33:27,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2022-11-02 20:33:27,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-11-02 20:33:27,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:27,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:27,389 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-02 20:33:27,389 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-02 20:33:27,390 INFO L748 eck$LassoCheckResult]: Stem: 2658#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2659#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; 2667#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2662#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; 2654#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; 2655#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2656#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; 2657#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2687#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; 2685#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2684#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2677#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; 2678#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); 2668#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2669#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); 2681#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2686#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); 2683#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2682#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2679#L517-4 lis_~i~0#1 := 1; 2670#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2671#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; 2697#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; 2695#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); 2694#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2689#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2665#L519-2 [2022-11-02 20:33:27,390 INFO L750 eck$LassoCheckResult]: Loop: 2665#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2666#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2688#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; 2693#L521 assume !lis_#t~short11#1; 2691#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; 2672#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2660#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; 2661#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; 2673#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; 2664#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2690#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2665#L519-2 [2022-11-02 20:33:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 3 times [2022-11-02 20:33:27,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:27,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895634727] [2022-11-02 20:33:27,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:27,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:27,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:27,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:27,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:27,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 1 times [2022-11-02 20:33:27,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:27,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909319001] [2022-11-02 20:33:27,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:27,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:27,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:27,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:27,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:27,485 INFO L85 PathProgramCache]: Analyzing trace with hash 116956416, now seen corresponding path program 2 times [2022-11-02 20:33:27,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:27,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379232389] [2022-11-02 20:33:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:30,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:30,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379232389] [2022-11-02 20:33:30,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379232389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:30,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089657651] [2022-11-02 20:33:30,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:33:30,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:30,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:30,659 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:30,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-11-02 20:33:30,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:33:30,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:33:30,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-02 20:33:30,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:30,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:33:30,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:33:30,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:33:31,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:33:31,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:33:31,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:33:31,474 INFO L356 Elim1Store]: treesize reduction 30, result has 51.6 percent of original size [2022-11-02 20:33:31,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 72 [2022-11-02 20:33:31,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 46 [2022-11-02 20:33:31,869 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:33:31,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:33:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:33:31,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:33:32,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_691 Int) (v_ArrVal_693 (Array Int Int)) (|ULTIMATE.start_lis_~j~0#1| Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse3 (select .cse2 (+ (* |ULTIMATE.start_lis_~j~0#1| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (.cse1 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (or (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse2 .cse1 v_ArrVal_691)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 .cse1) 1))) (not (<= (+ .cse3 1) v_ArrVal_691)) (< .cse3 (select .cse2 .cse1)))))) is different from false [2022-11-02 20:33:32,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_690 (Array Int Int)) (v_ArrVal_691 Int) (|ULTIMATE.start_lis_~j~0#1| Int) (v_ArrVal_693 (Array Int Int))) (let ((.cse2 (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|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_690))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse4 (select .cse3 (+ (* |ULTIMATE.start_lis_~j~0#1| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (.cse1 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (or (let ((.cse0 (select (store (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse3 .cse1 v_ArrVal_691)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ 1 (select .cse0 .cse1)))) (not (<= (+ .cse4 1) v_ArrVal_691)) (< .cse4 (select .cse3 .cse1))))))) is different from false [2022-11-02 20:33:32,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_690 (Array Int Int)) (v_ArrVal_691 Int) (|ULTIMATE.start_lis_~j~0#1| Int) (v_ArrVal_693 (Array Int Int))) (let ((.cse2 (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_690))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse4 (select .cse3 (+ (* |ULTIMATE.start_lis_~j~0#1| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (or (let ((.cse0 (select (store (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse3 .cse1 v_ArrVal_691)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 .cse1) 1))) (< .cse4 (select .cse3 .cse1)) (not (<= (+ .cse4 1) v_ArrVal_691))))))) is different from false [2022-11-02 20:33:32,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:33:32,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 397 treesize of output 241 [2022-11-02 20:33:32,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 401 treesize of output 391 [2022-11-02 20:33:32,679 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:33:32,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 318 treesize of output 334 [2022-11-02 20:33:32,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:33:32,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 420 treesize of output 400 [2022-11-02 20:33:32,762 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:33:32,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 292 treesize of output 282 [2022-11-02 20:33:32,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:33:32,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 176 treesize of output 144 [2022-11-02 20:33:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 8 not checked. [2022-11-02 20:33:33,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089657651] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:33:33,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:33:33,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 14] total 48 [2022-11-02 20:33:33,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354477136] [2022-11-02 20:33:33,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:33:33,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:33,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-02 20:33:33,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1791, Unknown=4, NotChecked=264, Total=2256 [2022-11-02 20:33:33,887 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 15 Second operand has 48 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 48 states have internal predecessors, (89), 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-02 20:33:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:47,105 INFO L93 Difference]: Finished difference Result 303 states and 400 transitions. [2022-11-02 20:33:47,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 400 transitions. [2022-11-02 20:33:47,107 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 112 [2022-11-02 20:33:47,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 303 states and 400 transitions. [2022-11-02 20:33:47,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2022-11-02 20:33:47,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 288 [2022-11-02 20:33:47,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 400 transitions. [2022-11-02 20:33:47,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:33:47,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 303 states and 400 transitions. [2022-11-02 20:33:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 400 transitions. [2022-11-02 20:33:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 115. [2022-11-02 20:33:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.3043478260869565) internal successors, (150), 114 states have internal predecessors, (150), 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-02 20:33:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 150 transitions. [2022-11-02 20:33:47,118 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 150 transitions. [2022-11-02 20:33:47,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-11-02 20:33:47,125 INFO L428 stractBuchiCegarLoop]: Abstraction has 115 states and 150 transitions. [2022-11-02 20:33:47,126 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-02 20:33:47,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 150 transitions. [2022-11-02 20:33:47,127 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2022-11-02 20:33:47,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:47,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:47,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:47,131 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:33:47,131 INFO L748 eck$LassoCheckResult]: Stem: 3505#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3506#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; 3515#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3509#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; 3501#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; 3502#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3503#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; 3504#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3514#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; 3535#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3534#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3527#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; 3528#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); 3516#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3517#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); 3540#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3532#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); 3533#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3536#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3537#L517-4 lis_~i~0#1 := 1; 3518#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3519#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; 3572#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; 3573#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); 3581#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3580#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3579#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3541#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 3531#L519-4 lis_~i~0#1 := 0; 3522#L523-3 [2022-11-02 20:33:47,131 INFO L750 eck$LassoCheckResult]: Loop: 3522#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); 3523#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; 3526#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 3522#L523-3 [2022-11-02 20:33:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:47,132 INFO L85 PathProgramCache]: Analyzing trace with hash 458402853, now seen corresponding path program 2 times [2022-11-02 20:33:47,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:47,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175258672] [2022-11-02 20:33:47,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:47,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:33:47,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:47,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175258672] [2022-11-02 20:33:47,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175258672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:47,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575930544] [2022-11-02 20:33:47,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:33:47,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:47,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:47,315 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:47,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-11-02 20:33:47,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:33:47,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:33:47,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:33:47,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:33:47,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:33:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:33:47,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575930544] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:33:47,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:33:47,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-11-02 20:33:47,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623905679] [2022-11-02 20:33:47,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:33:47,679 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:33:47,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:47,679 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 3 times [2022-11-02 20:33:47,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:47,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292653636] [2022-11-02 20:33:47,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:47,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:47,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:47,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:47,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:33:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:33:47,761 INFO L87 Difference]: Start difference. First operand 115 states and 150 transitions. cyclomatic complexity: 42 Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:47,988 INFO L93 Difference]: Finished difference Result 129 states and 165 transitions. [2022-11-02 20:33:47,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 165 transitions. [2022-11-02 20:33:47,989 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 37 [2022-11-02 20:33:47,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 129 states and 165 transitions. [2022-11-02 20:33:47,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-11-02 20:33:47,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-11-02 20:33:47,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 165 transitions. [2022-11-02 20:33:47,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:33:47,991 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 165 transitions. [2022-11-02 20:33:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 165 transitions. [2022-11-02 20:33:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2022-11-02 20:33:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.2695652173913043) internal successors, (146), 114 states have internal predecessors, (146), 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-02 20:33:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2022-11-02 20:33:47,995 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 146 transitions. [2022-11-02 20:33:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:33:48,002 INFO L428 stractBuchiCegarLoop]: Abstraction has 115 states and 146 transitions. [2022-11-02 20:33:48,003 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-02 20:33:48,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 146 transitions. [2022-11-02 20:33:48,004 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2022-11-02 20:33:48,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:48,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:48,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:48,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-02 20:33:48,009 INFO L748 eck$LassoCheckResult]: Stem: 3945#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3946#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; 3955#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3949#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; 3941#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; 3942#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3943#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; 3944#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3954#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; 3974#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3973#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3966#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; 3967#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); 3971#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3972#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); 3956#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3957#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); 3981#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3982#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3968#L517-4 lis_~i~0#1 := 1; 3969#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3998#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; 3995#L521 assume !lis_#t~short11#1; 3996#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; 3986#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3987#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3952#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3953#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4043#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; 4044#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; 4014#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); 4010#L520-2 [2022-11-02 20:33:48,010 INFO L750 eck$LassoCheckResult]: Loop: 4010#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4009#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; 4006#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; 4004#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; 4005#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4008#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3977#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3975#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3976#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; 4015#L521 assume !lis_#t~short11#1; 4012#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; 4010#L520-2 [2022-11-02 20:33:48,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:48,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1985736812, now seen corresponding path program 3 times [2022-11-02 20:33:48,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:48,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090938177] [2022-11-02 20:33:48,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:48,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:48,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:48,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:48,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:48,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1668400423, now seen corresponding path program 2 times [2022-11-02 20:33:48,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:48,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750572910] [2022-11-02 20:33:48,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:48,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:48,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:48,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:48,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash -16757836, now seen corresponding path program 4 times [2022-11-02 20:33:48,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:48,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879722271] [2022-11-02 20:33:48,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:48,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:33:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:48,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879722271] [2022-11-02 20:33:48,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879722271] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:48,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493186156] [2022-11-02 20:33:48,388 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:33:48,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:48,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:48,393 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:48,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-11-02 20:33:48,680 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:33:48,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:33:48,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:33:48,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:33:48,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:33:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:33:49,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493186156] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:33:49,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:33:49,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-11-02 20:33:49,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47247579] [2022-11-02 20:33:49,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:33:49,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:49,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:33:49,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:33:49,318 INFO L87 Difference]: Start difference. First operand 115 states and 146 transitions. cyclomatic complexity: 38 Second operand has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 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-02 20:33:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:49,800 INFO L93 Difference]: Finished difference Result 285 states and 367 transitions. [2022-11-02 20:33:49,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 367 transitions. [2022-11-02 20:33:49,802 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 74 [2022-11-02 20:33:49,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 367 transitions. [2022-11-02 20:33:49,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 259 [2022-11-02 20:33:49,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2022-11-02 20:33:49,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 367 transitions. [2022-11-02 20:33:49,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:33:49,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 285 states and 367 transitions. [2022-11-02 20:33:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 367 transitions. [2022-11-02 20:33:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 177. [2022-11-02 20:33:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 1.2881355932203389) internal successors, (228), 176 states have internal predecessors, (228), 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-02 20:33:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 228 transitions. [2022-11-02 20:33:49,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 177 states and 228 transitions. [2022-11-02 20:33:49,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 20:33:49,818 INFO L428 stractBuchiCegarLoop]: Abstraction has 177 states and 228 transitions. [2022-11-02 20:33:49,818 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-02 20:33:49,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 228 transitions. [2022-11-02 20:33:49,820 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 45 [2022-11-02 20:33:49,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:49,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:49,826 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:49,830 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-02 20:33:49,830 INFO L748 eck$LassoCheckResult]: Stem: 4647#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4648#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; 4657#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4651#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; 4643#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; 4644#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4656#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; 4680#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4645#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; 4646#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4679#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4667#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; 4668#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); 4685#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4686#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); 4691#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4692#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); 4658#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4659#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4669#L517-4 lis_~i~0#1 := 1; 4670#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4709#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; 4706#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; 4701#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); 4702#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4760#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4758#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4756#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4752#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; 4748#L521 assume !lis_#t~short11#1; 4749#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; 4780#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4753#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; 4754#L521 [2022-11-02 20:33:49,834 INFO L750 eck$LassoCheckResult]: Loop: 4754#L521 assume !lis_#t~short11#1; 4759#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; 4757#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4755#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; 4754#L521 [2022-11-02 20:33:49,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1635570873, now seen corresponding path program 5 times [2022-11-02 20:33:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:49,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280326910] [2022-11-02 20:33:49,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:49,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:49,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:49,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:49,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2715002, now seen corresponding path program 1 times [2022-11-02 20:33:49,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:49,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810364081] [2022-11-02 20:33:49,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:49,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:49,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:49,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash 117016000, now seen corresponding path program 6 times [2022-11-02 20:33:49,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:49,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190269789] [2022-11-02 20:33:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:49,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:33:50,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:50,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190269789] [2022-11-02 20:33:50,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190269789] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:50,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31196405] [2022-11-02 20:33:50,121 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 20:33:50,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:50,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:50,123 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:50,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-11-02 20:33:50,461 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-02 20:33:50,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:33:50,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:33:50,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:33:50,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:33:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:33:50,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31196405] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:33:50,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:33:50,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-11-02 20:33:50,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852397732] [2022-11-02 20:33:50,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:33:50,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:50,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:33:50,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:33:50,758 INFO L87 Difference]: Start difference. First operand 177 states and 228 transitions. cyclomatic complexity: 61 Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:50,898 INFO L93 Difference]: Finished difference Result 186 states and 227 transitions. [2022-11-02 20:33:50,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 227 transitions. [2022-11-02 20:33:50,899 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-11-02 20:33:50,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 227 transitions. [2022-11-02 20:33:50,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2022-11-02 20:33:50,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2022-11-02 20:33:50,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 227 transitions. [2022-11-02 20:33:50,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:33:50,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 227 transitions. [2022-11-02 20:33:50,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 227 transitions. [2022-11-02 20:33:50,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 122. [2022-11-02 20:33:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 121 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2022-11-02 20:33:50,906 INFO L240 hiAutomatonCegarLoop]: Abstraction has 122 states and 152 transitions. [2022-11-02 20:33:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:33:50,909 INFO L428 stractBuchiCegarLoop]: Abstraction has 122 states and 152 transitions. [2022-11-02 20:33:50,909 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-02 20:33:50,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 152 transitions. [2022-11-02 20:33:50,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-11-02 20:33:50,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:33:50,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:33:50,911 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:50,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:33:50,912 INFO L748 eck$LassoCheckResult]: Stem: 5247#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5248#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; 5257#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5251#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; 5243#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; 5244#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5245#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; 5246#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5256#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; 5283#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5277#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5279#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; 5272#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); 5273#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5274#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); 5275#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5290#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); 5291#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5308#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 5307#L517-4 lis_~i~0#1 := 1; 5306#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5305#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; 5303#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; 5301#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); 5302#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5364#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5363#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5362#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5361#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; 5360#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; 5333#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); 5260#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5249#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; 5250#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; 5252#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); 5253#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5331#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5330#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5276#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 5271#L519-4 lis_~i~0#1 := 0; 5264#L523-3 [2022-11-02 20:33:50,912 INFO L750 eck$LassoCheckResult]: Loop: 5264#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); 5265#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; 5266#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 5264#L523-3 [2022-11-02 20:33:50,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:50,913 INFO L85 PathProgramCache]: Analyzing trace with hash 664884807, now seen corresponding path program 3 times [2022-11-02 20:33:50,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:50,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328267252] [2022-11-02 20:33:50,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:50,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:50,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:51,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:51,020 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 4 times [2022-11-02 20:33:51,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:51,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388770464] [2022-11-02 20:33:51,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:51,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:51,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:51,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:33:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash -805802289, now seen corresponding path program 2 times [2022-11-02 20:33:51,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:51,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182313125] [2022-11-02 20:33:51,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:51,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:51,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:33:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:33:51,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:34:44,336 WARN L234 SmtUtils]: Spent 53.11s on a formula simplification. DAG size of input: 417 DAG size of output: 291 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:34:57,290 WARN L234 SmtUtils]: Spent 11.06s on a formula simplification that was a NOOP. DAG size: 191 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:34:57,295 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:34:57,295 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:34:57,296 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:34:57,296 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:34:57,296 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:34:57,296 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:34:57,296 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:34:57,296 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:34:57,296 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration17_Lasso [2022-11-02 20:34:57,296 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:34:57,296 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:34:57,302 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:34:57,306 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:34:57,309 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-02 20:34:57,312 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-02 20:34:57,317 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-02 20:34:57,321 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-02 20:34:57,325 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-02 20:34:57,329 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-02 20:34:57,332 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-02 20:34:57,335 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-02 20:34:57,338 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-02 20:34:57,342 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-02 20:34:57,345 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-02 20:34:57,348 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-02 20:34:57,352 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-02 20:34:57,355 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-02 20:34:57,359 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-02 20:34:57,362 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-02 20:34:57,365 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-02 20:34:57,368 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-02 20:34:57,370 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-02 20:34:57,373 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-02 20:34:57,376 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-02 20:34:57,378 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-02 20:34:57,380 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-02 20:34:57,383 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-02 20:35:16,135 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:35:16,135 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:35:16,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,139 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-11-02 20:35:16,140 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-02 20:35:16,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:16,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:16,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-11-02 20:35:16,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,176 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-11-02 20:35:16,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:35:16,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-11-02 20:35:16,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,220 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-11-02 20:35:16,222 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-02 20:35:16,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:16,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,256 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-11-02 20:35:16,257 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-02 20:35:16,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:16,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:16,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-11-02 20:35:16,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,317 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-11-02 20:35:16,319 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-02 20:35:16,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:16,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:16,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-11-02 20:35:16,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,359 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-11-02 20:35:16,361 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-02 20:35:16,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:16,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:16,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:16,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,436 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-11-02 20:35:16,437 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-02 20:35:16,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:16,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,471 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-11-02 20:35:16,473 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-02 20:35:16,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-11-02 20:35:16,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,509 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,516 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-02 20:35:16,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-11-02 20:35:16,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:16,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,583 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-11-02 20:35:16,586 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-02 20:35:16,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:16,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,620 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-11-02 20:35:16,623 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-02 20:35:16,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-11-02 20:35:16,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,662 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-11-02 20:35:16,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:35:16,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-11-02 20:35:16,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,704 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-11-02 20:35:16,705 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-02 20:35:16,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:16,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,746 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,756 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-02 20:35:16,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-11-02 20:35:16,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:16,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:16,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-11-02 20:35:16,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,798 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-11-02 20:35:16,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:35:16,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-11-02 20:35:16,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,836 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-11-02 20:35:16,838 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-02 20:35:16,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-11-02 20:35:16,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,875 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-11-02 20:35:16,877 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-02 20:35:16,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-11-02 20:35:16,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,912 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-11-02 20:35:16,913 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-02 20:35:16,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-11-02 20:35:16,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,951 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-11-02 20:35:16,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:35:16,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:16,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:16,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:16,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:16,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-11-02 20:35:16,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:16,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:16,988 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:16,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-11-02 20:35:16,989 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-02 20:35:16,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:16,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:16,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:16,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:16,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:17,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:17,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-11-02 20:35:17,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,023 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-11-02 20:35:17,025 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-02 20:35:17,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-11-02 20:35:17,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,062 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-11-02 20:35:17,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-02 20:35:17,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:17,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:17,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:17,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:17,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,099 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-11-02 20:35:17,101 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-02 20:35:17,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:17,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:17,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:17,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-11-02 20:35:17,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,136 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-11-02 20:35:17,137 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-02 20:35:17,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:35:17,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:35:17,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:35:17,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-11-02 20:35:17,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,171 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-11-02 20:35:17,173 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-02 20:35:17,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-11-02 20:35:17,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,215 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,217 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-02 20:35:17,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-11-02 20:35:17,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:17,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,297 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,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-02 20:35:17,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-11-02 20:35:17,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-11-02 20:35:17,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,353 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-11-02 20:35:17,354 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-02 20:35:17,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-11-02 20:35:17,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,398 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-11-02 20:35:17,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:35:17,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2022-11-02 20:35:17,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,439 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-11-02 20:35:17,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:35:17,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:17,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,489 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-11-02 20:35:17,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:35:17,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:17,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,527 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-11-02 20:35:17,528 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-02 20:35:17,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:17,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,566 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-11-02 20:35:17,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:35:17,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:17,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,641 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-11-02 20:35:17,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-02 20:35:17,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:17,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,679 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-11-02 20:35:17,680 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-02 20:35:17,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:35:17,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:17,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,723 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-11-02 20:35:17,725 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-02 20:35:17,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:35:17,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:35:17,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:35:17,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:35:17,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:35:17,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:35:17,781 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:35:17,866 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-11-02 20:35:17,867 INFO L444 ModelExtractionUtils]: 20 out of 64 variables were initially zero. Simplification set additionally 39 variables to zero. [2022-11-02 20:35:17,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:35:17,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:17,869 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:35:17,870 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:35:17,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-11-02 20:35:17,901 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-11-02 20:35:17,901 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:35:17,901 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~a#1.base)_1, ULTIMATE.start_lis_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_lis_~a#1.base)_1 - 2*ULTIMATE.start_lis_~i~0#1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_lis_~a#1.base)_1 - 2*ULTIMATE.start_lis_~N#1 >= 0] [2022-11-02 20:35:17,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:19,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-11-02 20:35:19,391 INFO L156 tatePredicateManager]: 75 out of 76 supporting invariants were superfluous and have been removed [2022-11-02 20:35:19,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:19,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:35:19,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:19,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:35:19,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:19,843 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-02 20:35:19,843 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2022-11-02 20:35:19,844 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 152 transitions. cyclomatic complexity: 35 Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-02 20:35:20,143 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 152 transitions. cyclomatic complexity: 35. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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) Result 166 states and 206 transitions. Complement of second has 14 states. [2022-11-02 20:35:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 9 stem states 1 non-accepting loop states 2 accepting loop states [2022-11-02 20:35:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-02 20:35:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2022-11-02 20:35:20,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 40 letters. Loop has 3 letters. [2022-11-02 20:35:20,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:35:20,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 43 letters. Loop has 3 letters. [2022-11-02 20:35:20,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:35:20,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 40 letters. Loop has 6 letters. [2022-11-02 20:35:20,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:35:20,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 206 transitions. [2022-11-02 20:35:20,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-11-02 20:35:20,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 102 states and 126 transitions. [2022-11-02 20:35:20,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2022-11-02 20:35:20,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2022-11-02 20:35:20,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 126 transitions. [2022-11-02 20:35:20,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:35:20,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 126 transitions. [2022-11-02 20:35:20,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 126 transitions. [2022-11-02 20:35:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2022-11-02 20:35:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 98 states have internal predecessors, (122), 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-02 20:35:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2022-11-02 20:35:20,154 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 122 transitions. [2022-11-02 20:35:20,154 INFO L428 stractBuchiCegarLoop]: Abstraction has 99 states and 122 transitions. [2022-11-02 20:35:20,154 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-02 20:35:20,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 122 transitions. [2022-11-02 20:35:20,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-11-02 20:35:20,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:35:20,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:35:20,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:35:20,164 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-02 20:35:20,164 INFO L748 eck$LassoCheckResult]: Stem: 6025#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6026#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; 6034#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6029#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; 6021#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; 6022#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6023#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; 6024#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6065#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; 6064#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6063#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; 6051#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6050#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6044#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; 6045#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); 6035#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6036#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); 6049#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6061#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); 6062#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6055#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); 6057#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6060#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 6046#L517-4 lis_~i~0#1 := 1; 6047#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6096#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; 6094#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; 6092#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); 6093#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6104#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6103#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6037#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6027#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; 6028#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; 6039#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; 6076#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6075#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; 6073#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; 6071#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); 6072#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6105#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6053#L519-2 [2022-11-02 20:35:20,164 INFO L750 eck$LassoCheckResult]: Loop: 6053#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6054#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6102#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; 6099#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; 6100#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; 6031#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6038#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; 6115#L521 assume !lis_#t~short11#1; 6069#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; 6066#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6067#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6053#L519-2 [2022-11-02 20:35:20,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:20,165 INFO L85 PathProgramCache]: Analyzing trace with hash -55407940, now seen corresponding path program 1 times [2022-11-02 20:35:20,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:20,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481341016] [2022-11-02 20:35:20,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:20,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:35:22,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:22,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481341016] [2022-11-02 20:35:22,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481341016] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:35:22,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805132302] [2022-11-02 20:35:22,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:22,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:35:22,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:35:22,649 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:35:22,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c7d6344-432c-4fd4-8632-9e7aa5eebbaa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-11-02 20:35:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:22,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-02 20:35:22,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:35:22,913 INFO L356 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2022-11-02 20:35:22,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 66 [2022-11-02 20:35:22,944 INFO L356 Elim1Store]: treesize reduction 43, result has 29.5 percent of original size [2022-11-02 20:35:22,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 83 [2022-11-02 20:35:22,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:35:22,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 19 [2022-11-02 20:35:23,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-02 20:35:23,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:35:23,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2022-11-02 20:35:23,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 15 [2022-11-02 20:35:23,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,183 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:35:23,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 84 [2022-11-02 20:35:23,218 INFO L356 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2022-11-02 20:35:23,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 54 [2022-11-02 20:35:23,248 INFO L356 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2022-11-02 20:35:23,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 60 [2022-11-02 20:35:23,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 5 [2022-11-02 20:35:23,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 [2022-11-02 20:35:23,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2022-11-02 20:35:23,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 25 [2022-11-02 20:35:23,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:35:23,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,537 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-02 20:35:23,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 68 [2022-11-02 20:35:23,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:35:23,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:23,719 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-11-02 20:35:23,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 76 treesize of output 75 [2022-11-02 20:35:32,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:32,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:35:32,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:32,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:32,412 INFO L356 Elim1Store]: treesize reduction 124, result has 15.6 percent of original size [2022-11-02 20:35:32,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 97 treesize of output 99 [2022-11-02 20:35:32,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-11-02 20:35:33,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:33,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:33,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:35:33,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:35:33,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 19 [2022-11-02 20:35:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:35:33,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:35:46,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_240| Int)) (or (not (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 1) |v_ULTIMATE.start_lis_~i~0#1_240|)) (forall ((v_ArrVal_1262 Int) (v_ArrVal_1264 (Array Int Int))) (let ((.cse1 (let ((.cse6 (* 4 |v_ULTIMATE.start_lis_~i~0#1_240|))) (let ((.cse5 (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|) (+ .cse6 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (store .cse5 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse5 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ .cse6 |c_ULTIMATE.start_lis_~prev~0#1.offset|) v_ArrVal_1262)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse3 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (or (let ((.cse0 (select (store (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1264) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< .cse4 (select .cse2 .cse3))))))))) is different from false [2022-11-02 20:35:46,859 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 Int) (|v_ULTIMATE.start_lis_~i~0#1_240| Int) (v_ArrVal_1256 Int) (v_ArrVal_1264 (Array Int Int))) (let ((.cse4 (let ((.cse6 (* 4 |v_ULTIMATE.start_lis_~i~0#1_240|))) (let ((.cse5 (let ((.cse7 (let ((.cse9 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse8 (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|) (+ .cse9 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (store .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse9) v_ArrVal_1256)))))) (store .cse7 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse7 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse6 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (store .cse5 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse5 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ .cse6 |c_ULTIMATE.start_lis_~prev~0#1.offset|) v_ArrVal_1262)))))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (or (< .cse0 (select .cse1 .cse2)) (let ((.cse3 (select (store (store .cse4 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1264) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (not (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 1) |v_ULTIMATE.start_lis_~i~0#1_240|))))))) is different from false [2022-11-02 20:35:46,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 Int) (|v_ULTIMATE.start_lis_~i~0#1_240| Int) (v_ArrVal_1256 Int) (v_ArrVal_1264 (Array Int Int))) (let ((.cse4 (let ((.cse6 (* 4 |v_ULTIMATE.start_lis_~i~0#1_240|))) (let ((.cse5 (let ((.cse7 (let ((.cse9 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse8 (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|) (+ .cse9 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (store .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse9 4) v_ArrVal_1256)))))) (store .cse7 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse7 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse6 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (store .cse5 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse5 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ .cse6 |c_ULTIMATE.start_lis_~prev~0#1.offset|) v_ArrVal_1262)))))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (or (< .cse0 (select .cse1 .cse2)) (let ((.cse3 (select (store (store .cse4 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1264) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (not (<= (+ 2 |c_ULTIMATE.start_lis_~i~0#1|) |v_ULTIMATE.start_lis_~i~0#1_240|))))))) is different from false [2022-11-02 20:35:47,084 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 Int) (|v_ULTIMATE.start_lis_~i~0#1_240| Int) (v_ArrVal_1245 Int) (v_ArrVal_1256 Int) (v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1247 Int) (v_ArrVal_1249 Int)) (let ((.cse1 (let ((.cse6 (* 4 |v_ULTIMATE.start_lis_~i~0#1_240|))) (let ((.cse5 (let ((.cse7 (let ((.cse9 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse12 (+ .cse9 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse11 .cse12 v_ArrVal_1245)) |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse11 .cse12 v_ArrVal_1247)) |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse9) v_ArrVal_1249))))) (store .cse10 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse10 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse9 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (store .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse9 4) v_ArrVal_1256)))))) (store .cse7 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse7 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse6 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (store .cse5 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse5 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ .cse6 |c_ULTIMATE.start_lis_~prev~0#1.offset|) v_ArrVal_1262)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse3 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (or (let ((.cse0 (select (store (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1264) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< .cse4 (select .cse2 .cse3)) (not (<= |c_ULTIMATE.start_lis_~i~0#1| v_ArrVal_1249)) (not (<= (+ 2 |c_ULTIMATE.start_lis_~i~0#1|) |v_ULTIMATE.start_lis_~i~0#1_240|))))))) is different from false [2022-11-02 20:35:47,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 Int) (|v_ULTIMATE.start_lis_~i~0#1_240| Int) (v_ArrVal_1245 Int) (v_ArrVal_1256 Int) (v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1247 Int) (v_ArrVal_1249 Int)) (let ((.cse1 (let ((.cse6 (* 4 |v_ULTIMATE.start_lis_~i~0#1_240|))) (let ((.cse5 (let ((.cse7 (let ((.cse9 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse12 (+ .cse9 4 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse11 .cse12 v_ArrVal_1245)) |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse11 .cse12 v_ArrVal_1247)) |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse9 4) v_ArrVal_1249))))) (store .cse10 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse10 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse9 8 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (store .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse9 8) v_ArrVal_1256)))))) (store .cse7 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse7 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse6 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (store .cse5 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse5 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ .cse6 |c_ULTIMATE.start_lis_~prev~0#1.offset|) v_ArrVal_1262)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse3 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (or (not (<= (+ 3 |c_ULTIMATE.start_lis_~i~0#1|) |v_ULTIMATE.start_lis_~i~0#1_240|)) (not (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 1) v_ArrVal_1249)) (let ((.cse0 (select (store (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1264) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< .cse4 (select .cse2 .cse3))))))) is different from false [2022-11-02 20:35:48,567 INFO L356 Elim1Store]: treesize reduction 17, result has 66.0 percent of original size [2022-11-02 20:35:48,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36759 treesize of output 23479 [2022-11-02 20:35:48,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:35:48,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 11723 treesize of output 8149 [2022-11-02 20:35:54,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:35:54,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46388 treesize of output 45844 [2022-11-02 20:35:55,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26817 treesize of output 25461 [2022-11-02 20:36:02,632 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:36:02,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27574202484 treesize of output 27371744806