./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa --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 --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:23:59,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:23:59,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:23:59,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:23:59,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:23:59,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:23:59,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:23:59,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:23:59,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:23:59,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:23:59,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:23:59,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:23:59,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:23:59,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:23:59,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:23:59,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:23:59,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:23:59,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:23:59,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:23:59,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:23:59,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:23:59,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:23:59,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:23:59,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:23:59,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:23:59,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:23:59,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:23:59,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:23:59,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:23:59,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:23:59,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:23:59,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:23:59,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:23:59,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:23:59,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:23:59,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:23:59,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:23:59,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:23:59,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:23:59,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:23:59,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:23:59,156 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-07 00:23:59,180 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:23:59,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:23:59,181 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:23:59,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:23:59,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:23:59,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:23:59,182 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:23:59,183 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-07 00:23:59,183 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-07 00:23:59,183 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-07 00:23:59,183 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-07 00:23:59,183 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-07 00:23:59,183 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-07 00:23:59,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:23:59,184 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:23:59,184 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-07 00:23:59,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 00:23:59,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:23:59,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:23:59,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-07 00:23:59,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-07 00:23:59,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-07 00:23:59,185 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:23:59,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 00:23:59,185 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-07 00:23:59,185 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:23:59,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-07 00:23:59,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:23:59,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:23:59,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:23:59,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 00:23:59,186 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:23:59,187 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-07 00:23:59,187 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_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/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_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa 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 [2021-12-07 00:23:59,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:23:59,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:23:59,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:23:59,394 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:23:59,394 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:23:59,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-12-07 00:23:59,440 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/data/3fd58d10a/04d72592769b46fa9445c583a223b1ab/FLAG6fccdeb2d [2021-12-07 00:23:59,893 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:23:59,893 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-12-07 00:23:59,906 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/data/3fd58d10a/04d72592769b46fa9445c583a223b1ab/FLAG6fccdeb2d [2021-12-07 00:23:59,919 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/data/3fd58d10a/04d72592769b46fa9445c583a223b1ab [2021-12-07 00:23:59,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:23:59,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:23:59,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:23:59,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:23:59,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:23:59,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:23:59" (1/1) ... [2021-12-07 00:23:59,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42197428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:23:59, skipping insertion in model container [2021-12-07 00:23:59,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:23:59" (1/1) ... [2021-12-07 00:23:59,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:23:59,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:24:00,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:24:00,150 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 00:24:00,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:24:00,201 INFO L208 MainTranslator]: Completed translation [2021-12-07 00:24:00,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:24:00 WrapperNode [2021-12-07 00:24:00,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:24:00,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 00:24:00,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 00:24:00,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 00:24:00,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:24:00" (1/1) ... [2021-12-07 00:24:00,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:24:00" (1/1) ... [2021-12-07 00:24:00,233 INFO L137 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2021-12-07 00:24:00,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 00:24:00,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 00:24:00,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 00:24:00,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 00:24:00,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:24:00" (1/1) ... [2021-12-07 00:24:00,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:24:00" (1/1) ... [2021-12-07 00:24:00,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:24:00" (1/1) ... [2021-12-07 00:24:00,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:24:00" (1/1) ... [2021-12-07 00:24:00,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:24:00" (1/1) ... [2021-12-07 00:24:00,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:24:00" (1/1) ... [2021-12-07 00:24:00,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:24:00" (1/1) ... [2021-12-07 00:24:00,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 00:24:00,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 00:24:00,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 00:24:00,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 00:24:00,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:24:00" (1/1) ... [2021-12-07 00:24:00,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:00,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:00,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:00,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-07 00:24:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-07 00:24:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-07 00:24:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-07 00:24:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 00:24:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 00:24:00,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 00:24:00,384 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 00:24:00,385 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 00:24:00,525 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 00:24:00,530 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 00:24:00,530 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-07 00:24:00,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:24:00 BoogieIcfgContainer [2021-12-07 00:24:00,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 00:24:00,532 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-07 00:24:00,532 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-07 00:24:00,535 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-07 00:24:00,535 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-07 00:24:00,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 12:23:59" (1/3) ... [2021-12-07 00:24:00,536 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1894535a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 12:24:00, skipping insertion in model container [2021-12-07 00:24:00,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-07 00:24:00,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:24:00" (2/3) ... [2021-12-07 00:24:00,537 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1894535a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 12:24:00, skipping insertion in model container [2021-12-07 00:24:00,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-07 00:24:00,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:24:00" (3/3) ... [2021-12-07 00:24:00,538 INFO L388 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2021-12-07 00:24:00,568 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-07 00:24:00,569 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-07 00:24:00,569 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-07 00:24:00,569 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-07 00:24:00,569 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-07 00:24:00,569 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-07 00:24:00,569 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-07 00:24:00,569 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-07 00:24:00,579 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) [2021-12-07 00:24:00,592 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-12-07 00:24:00,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:00,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:00,597 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-07 00:24:00,597 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-07 00:24:00,597 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-07 00:24:00,597 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) [2021-12-07 00:24:00,599 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-12-07 00:24:00,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:00,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:00,599 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-07 00:24:00,599 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-07 00:24:00,604 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#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; 11#L530true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 7#L530-2true call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 4#L535-3true [2021-12-07 00:24:00,604 INFO L793 eck$LassoCheckResult]: Loop: 4#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; 17#L535-2true main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4#L535-3true [2021-12-07 00:24:00,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-07 00:24:00,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:00,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205807088] [2021-12-07 00:24:00,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:00,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:00,683 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:00,704 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:00,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:00,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-12-07 00:24:00,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:00,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256397100] [2021-12-07 00:24:00,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:00,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:00,714 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:00,720 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:00,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:00,722 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-12-07 00:24:00,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:00,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100229389] [2021-12-07 00:24:00,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:00,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:00,738 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:00,751 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:00,932 INFO L210 LassoAnalysis]: Preferences: [2021-12-07 00:24:00,932 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-07 00:24:00,933 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-07 00:24:00,933 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-07 00:24:00,933 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-07 00:24:00,933 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:00,933 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-07 00:24:00,933 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-07 00:24:00,933 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2021-12-07 00:24:00,933 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-07 00:24:00,933 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-07 00:24:00,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:00,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:00,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:01,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:01,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:01,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:01,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:01,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:01,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:01,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:01,186 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-07 00:24:01,190 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-07 00:24:01,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:01,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:01,193 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:01,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-07 00:24:01,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:01,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:01,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:01,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:01,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:01,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:01,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:01,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:01,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:01,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:01,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:01,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:01,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:01,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-07 00:24:01,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:01,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:01,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:01,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:01,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:01,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:01,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:01,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:01,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-07 00:24:01,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:01,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:01,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:01,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-07 00:24:01,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:01,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:01,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:01,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:01,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:01,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:01,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:01,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:01,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:01,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-12-07 00:24:01,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:01,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:01,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:01,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-07 00:24:01,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:01,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:01,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:01,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:01,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:01,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:01,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:01,321 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-07 00:24:01,347 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-12-07 00:24:01,347 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-07 00:24:01,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:01,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:01,350 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:01,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-07 00:24:01,352 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-07 00:24:01,360 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-07 00:24:01,360 INFO L513 LassoAnalysis]: Proved termination. [2021-12-07 00:24:01,360 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_#t~malloc17#1.base)_1) = -2*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc17#1.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1 - 2*ULTIMATE.start_main_~array_size~0#1 >= 0] [2021-12-07 00:24:01,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-12-07 00:24:01,399 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2021-12-07 00:24:01,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:01,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 00:24:01,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:01,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 00:24:01,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:24:01,509 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-07 00:24:01,510 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 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) [2021-12-07 00:24:01,563 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 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) Result 47 states and 74 transitions. Complement of second has 9 states. [2021-12-07 00:24:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-07 00:24:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2021-12-07 00:24:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2021-12-07 00:24:01,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-07 00:24:01,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:24:01,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-07 00:24:01,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:24:01,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2021-12-07 00:24:01,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:24:01,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 74 transitions. [2021-12-07 00:24:01,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-07 00:24:01,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 33 transitions. [2021-12-07 00:24:01,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-07 00:24:01,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-07 00:24:01,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2021-12-07 00:24:01,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:24:01,578 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2021-12-07 00:24:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2021-12-07 00:24:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-07 00:24:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2021-12-07 00:24:01,602 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2021-12-07 00:24:01,602 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2021-12-07 00:24:01,602 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-07 00:24:01,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2021-12-07 00:24:01,603 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-07 00:24:01,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:01,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:01,603 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-07 00:24:01,603 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-07 00:24:01,603 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#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; 155#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 151#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 142#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 144#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);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);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; 157#L517-3 [2021-12-07 00:24:01,603 INFO L793 eck$LassoCheckResult]: Loop: 157#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); 156#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 157#L517-3 [2021-12-07 00:24:01,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:01,604 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-12-07 00:24:01,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:01,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345076176] [2021-12-07 00:24:01,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:01,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:01,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:24:01,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:01,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345076176] [2021-12-07 00:24:01,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345076176] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:24:01,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:24:01,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:24:01,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480285730] [2021-12-07 00:24:01,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:24:01,658 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-07 00:24:01,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:01,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2021-12-07 00:24:01,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:01,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291778644] [2021-12-07 00:24:01,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:01,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:01,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:01,680 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:01,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:24:01,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:24:01,739 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 16 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) [2021-12-07 00:24:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:01,760 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2021-12-07 00:24:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:24:01,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2021-12-07 00:24:01,762 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-07 00:24:01,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2021-12-07 00:24:01,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-07 00:24:01,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-07 00:24:01,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-12-07 00:24:01,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:24:01,764 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-07 00:24:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-12-07 00:24:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-12-07 00:24:01,765 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) [2021-12-07 00:24:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2021-12-07 00:24:01,766 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-12-07 00:24:01,766 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-12-07 00:24:01,766 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-07 00:24:01,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2021-12-07 00:24:01,767 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-07 00:24:01,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:01,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:01,767 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:01,767 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-07 00:24:01,768 INFO L791 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 197#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; 205#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 201#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 192#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; 193#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 194#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 195#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);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);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; 207#L517-3 [2021-12-07 00:24:01,768 INFO L793 eck$LassoCheckResult]: Loop: 207#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); 206#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 207#L517-3 [2021-12-07 00:24:01,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:01,768 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-12-07 00:24:01,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:01,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679111329] [2021-12-07 00:24:01,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:01,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:01,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:01,805 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:01,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:01,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2021-12-07 00:24:01,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:01,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86978252] [2021-12-07 00:24:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:01,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:01,814 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:01,821 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:01,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:01,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2021-12-07 00:24:01,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:01,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492261827] [2021-12-07 00:24:01,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:01,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:01,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:01,872 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:02,409 INFO L210 LassoAnalysis]: Preferences: [2021-12-07 00:24:02,409 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-07 00:24:02,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-07 00:24:02,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-07 00:24:02,409 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-07 00:24:02,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:02,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-07 00:24:02,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-07 00:24:02,410 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2021-12-07 00:24:02,410 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-07 00:24:02,410 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-07 00:24:02,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:02,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:03,038 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-07 00:24:03,038 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-07 00:24:03,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,039 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-07 00:24:03,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-07 00:24:03,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,067 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-07 00:24:03,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:03,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,097 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-07 00:24:03,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-12-07 00:24:03,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,126 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-07 00:24:03,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-12-07 00:24:03,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,154 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-07 00:24:03,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:03,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,198 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-07 00:24:03,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:03,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:03,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:03,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,228 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-07 00:24:03,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-07 00:24:03,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,257 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-07 00:24:03,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:03,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:03,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-12-07 00:24:03,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,288 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-07 00:24:03,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:03,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,317 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-07 00:24:03,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:03,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,346 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-07 00:24:03,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-12-07 00:24:03,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,374 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-07 00:24:03,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:03,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,403 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-07 00:24:03,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:03,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:03,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:03,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,433 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-07 00:24:03,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:03,462 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,463 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-07 00:24:03,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 [2021-12-07 00:24:03,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-12-07 00:24:03,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,493 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-07 00:24:03,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:03,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:03,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-07 00:24:03,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,524 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-07 00:24:03,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-07 00:24:03,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,553 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-07 00:24:03,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-07 00:24:03,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,581 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-07 00:24:03,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:03,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:03,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-07 00:24:03,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,612 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-07 00:24:03,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-07 00:24:03,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,641 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-07 00:24:03,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-07 00:24:03,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,671 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-07 00:24:03,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-07 00:24:03,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,699 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-07 00:24:03,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:03,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:03,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-12-07 00:24:03,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,732 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-07 00:24:03,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:03,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:03,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-07 00:24:03,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,766 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-07 00:24:03,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-07 00:24:03,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,794 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-07 00:24:03,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:03,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:03,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-07 00:24:03,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,825 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-07 00:24:03,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:03,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:03,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-07 00:24:03,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,857 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-07 00:24:03,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:03,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:03,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:03,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,890 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-07 00:24:03,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:03,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:03,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:03,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:03,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-12-07 00:24:03,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,918 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-07 00:24:03,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:03,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:03,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:03,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:03,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:03,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:03,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:03,953 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-07 00:24:03,975 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-07 00:24:03,975 INFO L444 ModelExtractionUtils]: 46 out of 61 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-07 00:24:03,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:03,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:03,976 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:03,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-07 00:24:03,977 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-07 00:24:03,985 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-07 00:24:03,985 INFO L513 LassoAnalysis]: Proved termination. [2021-12-07 00:24:03,985 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 [] [2021-12-07 00:24:04,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-07 00:24:04,059 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2021-12-07 00:24:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:04,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 00:24:04,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:04,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-07 00:24:04,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:24:04,100 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-07 00:24:04,100 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) [2021-12-07 00:24:04,109 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. [2021-12-07 00:24:04,109 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 [2021-12-07 00:24:04,110 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) [2021-12-07 00:24:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-12-07 00:24:04,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2021-12-07 00:24:04,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:24:04,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-07 00:24:04,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:24:04,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2021-12-07 00:24:04,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:24:04,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-12-07 00:24:04,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-07 00:24:04,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2021-12-07 00:24:04,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-07 00:24:04,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-07 00:24:04,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2021-12-07 00:24:04,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:24:04,112 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-12-07 00:24:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2021-12-07 00:24:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-07 00:24:04,113 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) [2021-12-07 00:24:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-12-07 00:24:04,114 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-12-07 00:24:04,114 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-12-07 00:24:04,114 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-07 00:24:04,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2021-12-07 00:24:04,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-07 00:24:04,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:04,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:04,115 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:04,115 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-07 00:24:04,115 INFO L791 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 380#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; 388#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 384#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 375#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; 376#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 377#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 378#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);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);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; 395#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 396#L517-4 lis_~i~0#1 := 1; 387#L519-3 [2021-12-07 00:24:04,115 INFO L793 eck$LassoCheckResult]: Loop: 387#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 381#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 382#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 387#L519-3 [2021-12-07 00:24:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2021-12-07 00:24:04,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:04,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679515845] [2021-12-07 00:24:04,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:04,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:24:04,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:04,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679515845] [2021-12-07 00:24:04,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679515845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:24:04,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:24:04,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:24:04,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348901279] [2021-12-07 00:24:04,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:24:04,147 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-07 00:24:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:04,147 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2021-12-07 00:24:04,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:04,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924008836] [2021-12-07 00:24:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:04,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:04,150 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:04,152 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:04,166 INFO L210 LassoAnalysis]: Preferences: [2021-12-07 00:24:04,166 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-07 00:24:04,166 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-07 00:24:04,166 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-07 00:24:04,166 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-07 00:24:04,166 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:04,166 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-07 00:24:04,166 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-07 00:24:04,166 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-12-07 00:24:04,166 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-07 00:24:04,166 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-07 00:24:04,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:04,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:04,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:04,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:04,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:04,202 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-07 00:24:04,203 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-07 00:24:04,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:04,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:04,205 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:04,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-07 00:24:04,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-07 00:24:04,206 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-07 00:24:04,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-07 00:24:04,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:04,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:04,234 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:04,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-07 00:24:04,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-07 00:24:04,235 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-07 00:24:04,367 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-07 00:24:04,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:04,370 INFO L210 LassoAnalysis]: Preferences: [2021-12-07 00:24:04,370 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-07 00:24:04,370 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-07 00:24:04,370 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-07 00:24:04,370 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-07 00:24:04,370 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:04,370 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-07 00:24:04,370 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-07 00:24:04,370 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-12-07 00:24:04,370 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-07 00:24:04,370 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-07 00:24:04,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:04,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:04,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:04,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:04,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:04,398 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-07 00:24:04,398 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-07 00:24:04,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:04,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:04,399 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:04,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-07 00:24:04,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:04,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:04,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:04,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:04,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:04,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:04,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:04,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:04,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-07 00:24:04,412 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-07 00:24:04,412 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-07 00:24:04,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:04,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:04,431 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:04,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-07 00:24:04,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-07 00:24:04,432 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-07 00:24:04,432 INFO L513 LassoAnalysis]: Proved termination. [2021-12-07 00:24:04,432 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 [] [2021-12-07 00:24:04,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-07 00:24:04,450 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-07 00:24:04,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:04,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 00:24:04,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:04,480 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 00:24:04,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:24:04,499 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-07 00:24:04,499 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) [2021-12-07 00:24:04,533 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. [2021-12-07 00:24:04,534 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 [2021-12-07 00:24:04,534 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) [2021-12-07 00:24:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-12-07 00:24:04,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2021-12-07 00:24:04,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:24:04,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2021-12-07 00:24:04,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:24:04,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2021-12-07 00:24:04,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:24:04,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2021-12-07 00:24:04,536 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2021-12-07 00:24:04,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2021-12-07 00:24:04,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-07 00:24:04,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-07 00:24:04,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2021-12-07 00:24:04,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:24:04,537 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 62 transitions. [2021-12-07 00:24:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2021-12-07 00:24:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2021-12-07 00:24:04,539 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) [2021-12-07 00:24:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2021-12-07 00:24:04,540 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2021-12-07 00:24:04,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:04,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:24:04,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:24:04,540 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) [2021-12-07 00:24:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:04,566 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2021-12-07 00:24:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:24:04,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2021-12-07 00:24:04,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-07 00:24:04,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2021-12-07 00:24:04,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-07 00:24:04,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-07 00:24:04,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2021-12-07 00:24:04,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:24:04,568 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2021-12-07 00:24:04,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2021-12-07 00:24:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-07 00:24:04,570 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) [2021-12-07 00:24:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2021-12-07 00:24:04,570 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-12-07 00:24:04,571 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-12-07 00:24:04,571 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-07 00:24:04,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2021-12-07 00:24:04,571 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-07 00:24:04,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:04,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:04,572 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:04,572 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:04,572 INFO L791 eck$LassoCheckResult]: Stem: 581#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 582#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; 596#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 588#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 577#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; 578#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 579#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 580#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);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);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; 605#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); 597#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 598#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 606#L517-4 lis_~i~0#1 := 1; 607#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 583#L520-3 [2021-12-07 00:24:04,572 INFO L793 eck$LassoCheckResult]: Loop: 583#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; 584#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; 589#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; 590#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 601#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 593#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 594#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 583#L520-3 [2021-12-07 00:24:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:04,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2021-12-07 00:24:04,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:04,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597189193] [2021-12-07 00:24:04,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:04,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:24:04,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:04,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597189193] [2021-12-07 00:24:04,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597189193] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:24:04,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137570809] [2021-12-07 00:24:04,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:04,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:24:04,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:04,612 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:24:04,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-12-07 00:24:04,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-07 00:24:04,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-07 00:24:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:04,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 00:24:04,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:24:04,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:24:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:24:04,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137570809] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:24:04,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:24:04,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-07 00:24:04,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761467504] [2021-12-07 00:24:04,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:24:04,718 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-07 00:24:04,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2021-12-07 00:24:04,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:04,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054858783] [2021-12-07 00:24:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:04,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:04,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:04,730 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:04,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:04,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:24:04,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:24:04,833 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:04,904 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-12-07 00:24:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 00:24:04,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 71 transitions. [2021-12-07 00:24:04,906 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-07 00:24:04,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 71 transitions. [2021-12-07 00:24:04,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-07 00:24:04,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-07 00:24:04,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 71 transitions. [2021-12-07 00:24:04,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:24:04,907 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 71 transitions. [2021-12-07 00:24:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 71 transitions. [2021-12-07 00:24:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-12-07 00:24:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 44 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2021-12-07 00:24:04,910 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2021-12-07 00:24:04,910 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2021-12-07 00:24:04,910 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-07 00:24:04,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 64 transitions. [2021-12-07 00:24:04,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-07 00:24:04,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:04,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:04,912 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:04,912 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-07 00:24:04,912 INFO L791 eck$LassoCheckResult]: Stem: 763#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 764#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; 780#L530 assume main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911;main_~array_size~0#1 := 1; 783#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 758#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; 759#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 776#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 800#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);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);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; 799#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); 798#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 797#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 796#L517-4 lis_~i~0#1 := 1; 784#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 785#L519-4 lis_~i~0#1 := 0; 789#L523-3 [2021-12-07 00:24:04,912 INFO L793 eck$LassoCheckResult]: Loop: 789#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); 790#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; 791#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 789#L523-3 [2021-12-07 00:24:04,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash -520179462, now seen corresponding path program 1 times [2021-12-07 00:24:04,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:04,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40000896] [2021-12-07 00:24:04,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:04,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:04,931 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:04,945 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:04,946 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2021-12-07 00:24:04,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:04,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219904023] [2021-12-07 00:24:04,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:04,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:04,949 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:04,952 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:04,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:04,953 INFO L85 PathProgramCache]: Analyzing trace with hash -424266948, now seen corresponding path program 1 times [2021-12-07 00:24:04,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:04,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117627227] [2021-12-07 00:24:04,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:04,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:04,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:04,983 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:05,697 INFO L210 LassoAnalysis]: Preferences: [2021-12-07 00:24:05,697 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-07 00:24:05,697 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-07 00:24:05,697 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-07 00:24:05,697 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-07 00:24:05,697 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:05,697 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-07 00:24:05,697 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-07 00:24:05,697 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration6_Lasso [2021-12-07 00:24:05,697 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-07 00:24:05,697 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-07 00:24:05,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:05,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:24:06,194 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-07 00:24:06,195 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-07 00:24:06,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,196 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-07 00:24:06,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:06,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:06,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:06,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:06,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-07 00:24:06,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,226 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-07 00:24:06,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:06,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:06,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:06,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:06,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-07 00:24:06,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,254 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-07 00:24:06,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:06,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:06,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:06,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:06,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-12-07 00:24:06,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,282 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-07 00:24:06,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:06,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:06,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:06,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:06,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-07 00:24:06,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,311 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-07 00:24:06,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:06,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:06,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:06,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-12-07 00:24:06,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,341 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-07 00:24:06,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:06,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:06,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:06,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:06,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-07 00:24:06,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,369 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-07 00:24:06,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 [2021-12-07 00:24:06,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:06,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:06,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:06,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-07 00:24:06,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,397 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-07 00:24:06,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:06,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:06,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:06,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-12-07 00:24:06,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,427 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-07 00:24:06,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:06,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:06,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:06,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:06,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-07 00:24:06,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,456 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-07 00:24:06,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 [2021-12-07 00:24:06,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:06,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:06,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:06,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-07 00:24:06,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,484 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-07 00:24:06,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:06,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:06,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:06,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-12-07 00:24:06,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,514 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-07 00:24:06,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 [2021-12-07 00:24:06,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:06,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:06,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:06,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-12-07 00:24:06,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,543 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-07 00:24:06,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 [2021-12-07 00:24:06,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:06,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:06,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:06,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-12-07 00:24:06,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,571 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-07 00:24:06,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:06,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:24:06,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:24:06,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:24:06,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-12-07 00:24:06,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,598 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-07 00:24:06,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:06,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:06,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:06,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:24:06,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2021-12-07 00:24:06,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,637 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-07 00:24:06,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:24:06,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:24:06,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:24:06,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:24:06,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:24:06,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:24:06,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:24:06,666 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-07 00:24:06,699 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-12-07 00:24:06,699 INFO L444 ModelExtractionUtils]: 38 out of 58 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-12-07 00:24:06,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:24:06,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,700 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-07 00:24:06,701 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-07 00:24:06,708 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-07 00:24:06,708 INFO L513 LassoAnalysis]: Proved termination. [2021-12-07 00:24:06,709 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_2, ULTIMATE.start_lis_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_2 - 4*ULTIMATE.start_lis_~i~0#1 Supporting invariants [1*ULTIMATE.start_lis_~best~0#1.offset >= 0] [2021-12-07 00:24:06,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-12-07 00:24:06,763 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2021-12-07 00:24:06,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:06,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 00:24:06,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:06,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 00:24:06,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:24:06,864 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-07 00:24:06,865 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 64 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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) [2021-12-07 00:24:06,911 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 64 transitions. cyclomatic complexity: 26. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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) Result 50 states and 71 transitions. Complement of second has 6 states. [2021-12-07 00:24:06,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-07 00:24:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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) [2021-12-07 00:24:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2021-12-07 00:24:06,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-07 00:24:06,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:24:06,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 17 letters. Loop has 3 letters. [2021-12-07 00:24:06,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:24:06,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 14 letters. Loop has 6 letters. [2021-12-07 00:24:06,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:24:06,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 71 transitions. [2021-12-07 00:24:06,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-07 00:24:06,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 32 states and 43 transitions. [2021-12-07 00:24:06,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-07 00:24:06,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-07 00:24:06,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2021-12-07 00:24:06,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:24:06,914 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2021-12-07 00:24:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2021-12-07 00:24:06,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-12-07 00:24:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-12-07 00:24:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 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) [2021-12-07 00:24:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2021-12-07 00:24:06,916 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-12-07 00:24:06,916 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-12-07 00:24:06,916 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-07 00:24:06,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2021-12-07 00:24:06,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-07 00:24:06,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:06,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:06,917 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:06,917 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:06,917 INFO L791 eck$LassoCheckResult]: Stem: 1003#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1004#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; 1018#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1010#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 999#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; 1000#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1001#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; 1002#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1029#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1023#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);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);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; 1024#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); 1019#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1020#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1025#L517-4 lis_~i~0#1 := 1; 1026#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1005#L520-3 [2021-12-07 00:24:06,917 INFO L793 eck$LassoCheckResult]: Loop: 1005#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; 1006#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; 1011#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; 1012#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1022#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1015#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1016#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1005#L520-3 [2021-12-07 00:24:06,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:06,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1166516274, now seen corresponding path program 2 times [2021-12-07 00:24:06,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:06,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813478806] [2021-12-07 00:24:06,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:06,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:24:06,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:06,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813478806] [2021-12-07 00:24:06,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813478806] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:24:06,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316439283] [2021-12-07 00:24:06,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 00:24:06,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:24:06,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:06,955 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:24:06,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-12-07 00:24:06,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 00:24:06,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:24:06,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 00:24:06,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 00:24:07,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:24:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 00:24:07,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316439283] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:24:07,045 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:24:07,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2021-12-07 00:24:07,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180978767] [2021-12-07 00:24:07,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:24:07,045 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-07 00:24:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:07,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2021-12-07 00:24:07,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:07,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114907749] [2021-12-07 00:24:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:07,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:07,050 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:07,055 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:07,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:07,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-07 00:24:07,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-12-07 00:24:07,159 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 15 Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:07,245 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2021-12-07 00:24:07,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:24:07,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 65 transitions. [2021-12-07 00:24:07,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-07 00:24:07,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 65 transitions. [2021-12-07 00:24:07,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-12-07 00:24:07,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-12-07 00:24:07,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 65 transitions. [2021-12-07 00:24:07,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:24:07,247 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 65 transitions. [2021-12-07 00:24:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 65 transitions. [2021-12-07 00:24:07,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2021-12-07 00:24:07,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 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) [2021-12-07 00:24:07,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2021-12-07 00:24:07,249 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-12-07 00:24:07,249 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-12-07 00:24:07,249 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-07 00:24:07,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2021-12-07 00:24:07,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-07 00:24:07,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:07,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:07,250 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:07,250 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:07,250 INFO L791 eck$LassoCheckResult]: Stem: 1193#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1194#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; 1209#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1200#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 1189#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; 1190#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1191#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; 1192#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1208#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1214#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);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);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; 1215#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); 1218#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1219#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); 1210#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1211#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1216#L517-4 lis_~i~0#1 := 1; 1217#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1195#L520-3 [2021-12-07 00:24:07,250 INFO L793 eck$LassoCheckResult]: Loop: 1195#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; 1196#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; 1201#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; 1202#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1213#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1205#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1206#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1195#L520-3 [2021-12-07 00:24:07,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 3 times [2021-12-07 00:24:07,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:07,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328568215] [2021-12-07 00:24:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:07,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:07,263 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:07,277 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 3 times [2021-12-07 00:24:07,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:07,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018991810] [2021-12-07 00:24:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:07,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:07,282 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:07,286 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2021-12-07 00:24:07,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:07,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804318622] [2021-12-07 00:24:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:07,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 00:24:07,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:07,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804318622] [2021-12-07 00:24:07,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804318622] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:24:07,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689702723] [2021-12-07 00:24:07,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:07,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:24:07,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:07,340 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:24:07,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-12-07 00:24:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:07,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-07 00:24:07,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 00:24:07,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:24:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 00:24:07,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689702723] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:24:07,469 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:24:07,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2021-12-07 00:24:07,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624586174] [2021-12-07 00:24:07,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:24:07,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:07,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-07 00:24:07,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-07 00:24:07,569 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 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) [2021-12-07 00:24:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:07,644 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2021-12-07 00:24:07,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 00:24:07,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 78 transitions. [2021-12-07 00:24:07,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-07 00:24:07,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 49 states and 64 transitions. [2021-12-07 00:24:07,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-12-07 00:24:07,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-07 00:24:07,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2021-12-07 00:24:07,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:24:07,646 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2021-12-07 00:24:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2021-12-07 00:24:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2021-12-07 00:24:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-12-07 00:24:07,648 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-07 00:24:07,649 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-07 00:24:07,649 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-07 00:24:07,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2021-12-07 00:24:07,649 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-07 00:24:07,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:07,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:07,649 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:07,649 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-07 00:24:07,650 INFO L791 eck$LassoCheckResult]: Stem: 1452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1453#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; 1467#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1459#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 1448#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; 1449#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1450#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; 1451#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1492#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1491#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);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);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; 1490#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); 1488#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1487#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); 1486#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1485#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1483#L517-4 lis_~i~0#1 := 1; 1470#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1471#L520-3 [2021-12-07 00:24:07,650 INFO L793 eck$LassoCheckResult]: Loop: 1471#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; 1481#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; 1480#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; 1473#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1471#L520-3 [2021-12-07 00:24:07,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:07,650 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 4 times [2021-12-07 00:24:07,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:07,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453783516] [2021-12-07 00:24:07,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:07,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:07,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:07,682 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:07,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 1 times [2021-12-07 00:24:07,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:07,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775468655] [2021-12-07 00:24:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:07,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:07,688 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:07,693 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:07,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2057178037, now seen corresponding path program 1 times [2021-12-07 00:24:07,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:07,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902342500] [2021-12-07 00:24:07,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:07,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:24:07,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:07,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902342500] [2021-12-07 00:24:07,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902342500] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:24:07,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907923406] [2021-12-07 00:24:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:07,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:24:07,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:07,897 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:24:07,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2021-12-07 00:24:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:07,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-07 00:24:07,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:07,972 INFO L388 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 [2021-12-07 00:24:07,993 INFO L388 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 [2021-12-07 00:24:07,997 INFO L388 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 [2021-12-07 00:24:08,040 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-07 00:24:08,041 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-12-07 00:24:08,044 INFO L388 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 23 treesize of output 23 [2021-12-07 00:24:08,130 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 00:24:08,131 INFO L388 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 33 treesize of output 13 [2021-12-07 00:24:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 00:24:08,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:24:08,247 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-07 00:24:08,258 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:24:08,259 INFO L388 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 107 treesize of output 72 [2021-12-07 00:24:08,263 INFO L388 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 121 treesize of output 115 [2021-12-07 00:24:08,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:24:08,278 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:24:08,278 INFO L388 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 126 treesize of output 134 [2021-12-07 00:24:08,286 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 00:24:08,287 INFO L388 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 122 treesize of output 110 [2021-12-07 00:24:08,295 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 00:24:08,295 INFO L388 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 109 treesize of output 97 [2021-12-07 00:24:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2021-12-07 00:24:08,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907923406] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:24:08,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:24:08,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 25 [2021-12-07 00:24:08,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636197281] [2021-12-07 00:24:08,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:24:08,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:08,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-07 00:24:08,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=463, Unknown=6, NotChecked=44, Total=600 [2021-12-07 00:24:08,504 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 21 Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 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) [2021-12-07 00:24:08,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:08,707 INFO L93 Difference]: Finished difference Result 117 states and 165 transitions. [2021-12-07 00:24:08,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 00:24:08,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 165 transitions. [2021-12-07 00:24:08,709 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2021-12-07 00:24:08,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 165 transitions. [2021-12-07 00:24:08,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2021-12-07 00:24:08,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2021-12-07 00:24:08,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 165 transitions. [2021-12-07 00:24:08,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:24:08,711 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 165 transitions. [2021-12-07 00:24:08,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 165 transitions. [2021-12-07 00:24:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 76. [2021-12-07 00:24:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.381578947368421) internal successors, (105), 75 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2021-12-07 00:24:08,716 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2021-12-07 00:24:08,716 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2021-12-07 00:24:08,716 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-07 00:24:08,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 105 transitions. [2021-12-07 00:24:08,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-07 00:24:08,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:08,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:08,717 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:08,717 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-07 00:24:08,717 INFO L791 eck$LassoCheckResult]: Stem: 1776#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1777#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; 1791#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1783#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 1772#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; 1773#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1774#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; 1775#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1809#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1811#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);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);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; 1805#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); 1806#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1807#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); 1808#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1841#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); 1839#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1838#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1837#L517-4 lis_~i~0#1 := 1; 1835#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1832#L520-3 [2021-12-07 00:24:08,717 INFO L793 eck$LassoCheckResult]: Loop: 1832#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; 1830#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; 1827#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; 1828#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1832#L520-3 [2021-12-07 00:24:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:08,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1572565998, now seen corresponding path program 5 times [2021-12-07 00:24:08,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:08,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167496681] [2021-12-07 00:24:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:08,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:24:08,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:08,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167496681] [2021-12-07 00:24:08,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167496681] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:24:08,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183732438] [2021-12-07 00:24:08,766 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-07 00:24:08,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:24:08,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:08,767 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:24:08,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2021-12-07 00:24:08,837 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-07 00:24:08,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:24:08,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-07 00:24:08,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:24:08,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:24:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:24:08,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183732438] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:24:08,916 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:24:08,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-07 00:24:08,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263116295] [2021-12-07 00:24:08,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:24:08,917 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-07 00:24:08,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 2 times [2021-12-07 00:24:08,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:08,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979431259] [2021-12-07 00:24:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:08,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:08,921 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:08,925 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:09,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:09,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-07 00:24:09,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-12-07 00:24:09,002 INFO L87 Difference]: Start difference. First operand 76 states and 105 transitions. cyclomatic complexity: 35 Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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) [2021-12-07 00:24:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:09,072 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2021-12-07 00:24:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:24:09,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 100 transitions. [2021-12-07 00:24:09,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-07 00:24:09,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 100 transitions. [2021-12-07 00:24:09,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2021-12-07 00:24:09,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-12-07 00:24:09,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 100 transitions. [2021-12-07 00:24:09,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:24:09,074 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 100 transitions. [2021-12-07 00:24:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 100 transitions. [2021-12-07 00:24:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-12-07 00:24:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.375) internal successors, (99), 71 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2021-12-07 00:24:09,077 INFO L704 BuchiCegarLoop]: Abstraction has 72 states and 99 transitions. [2021-12-07 00:24:09,077 INFO L587 BuchiCegarLoop]: Abstraction has 72 states and 99 transitions. [2021-12-07 00:24:09,077 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-07 00:24:09,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 99 transitions. [2021-12-07 00:24:09,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-07 00:24:09,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:09,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:09,078 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:09,078 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-07 00:24:09,078 INFO L791 eck$LassoCheckResult]: Stem: 2058#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2059#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; 2073#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2064#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 2054#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; 2055#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2056#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; 2057#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2125#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2124#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);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);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; 2121#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); 2074#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2075#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); 2118#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2117#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2087#L517-4 lis_~i~0#1 := 1; 2078#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2079#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; 2123#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; 2065#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); 2066#L520-2 [2021-12-07 00:24:09,078 INFO L793 eck$LassoCheckResult]: Loop: 2066#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2120#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; 2119#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; 2083#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; 2066#L520-2 [2021-12-07 00:24:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1451833899, now seen corresponding path program 1 times [2021-12-07 00:24:09,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:09,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766452555] [2021-12-07 00:24:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:09,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:09,099 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:09,131 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2942460, now seen corresponding path program 3 times [2021-12-07 00:24:09,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:09,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603390986] [2021-12-07 00:24:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:09,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:09,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:09,140 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:09,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash 500759334, now seen corresponding path program 1 times [2021-12-07 00:24:09,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:09,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099591760] [2021-12-07 00:24:09,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:09,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-07 00:24:09,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:09,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099591760] [2021-12-07 00:24:09,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099591760] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:24:09,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857236332] [2021-12-07 00:24:09,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:09,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:24:09,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:09,186 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:24:09,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2021-12-07 00:24:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:09,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-07 00:24:09,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-07 00:24:09,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:24:09,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857236332] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:24:09,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 00:24:09,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2021-12-07 00:24:09,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173699354] [2021-12-07 00:24:09,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:24:09,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:09,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:24:09,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:24:09,353 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. cyclomatic complexity: 32 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:09,377 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2021-12-07 00:24:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:24:09,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 103 transitions. [2021-12-07 00:24:09,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-07 00:24:09,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 64 states and 86 transitions. [2021-12-07 00:24:09,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-07 00:24:09,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-07 00:24:09,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 86 transitions. [2021-12-07 00:24:09,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:24:09,379 INFO L681 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-12-07 00:24:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 86 transitions. [2021-12-07 00:24:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2021-12-07 00:24:09,381 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) [2021-12-07 00:24:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2021-12-07 00:24:09,381 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-12-07 00:24:09,381 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-12-07 00:24:09,382 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-07 00:24:09,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2021-12-07 00:24:09,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-07 00:24:09,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:09,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:09,383 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:09,383 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:09,383 INFO L791 eck$LassoCheckResult]: Stem: 2292#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2293#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; 2307#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2298#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 2288#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; 2289#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2290#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; 2291#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2325#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2324#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2323#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2318#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1);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);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2319#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2308#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2309#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2322#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2326#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2327#L517-4 lis_~i~0#1 := 1; 2332#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2333#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; 2314#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; 2299#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); 2300#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2312#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2303#L519-2 [2021-12-07 00:24:09,383 INFO L793 eck$LassoCheckResult]: Loop: 2303#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2304#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2294#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; 2295#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; 2337#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; 2336#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2335#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2303#L519-2 [2021-12-07 00:24:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2021-12-07 00:24:09,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:09,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887987604] [2021-12-07 00:24:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:09,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:24:09,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:09,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887987604] [2021-12-07 00:24:09,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887987604] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:24:09,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899478402] [2021-12-07 00:24:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:09,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:24:09,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:09,430 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:24:09,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2021-12-07 00:24:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:09,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-07 00:24:09,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:24:09,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:24:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:24:09,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899478402] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:24:09,580 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:24:09,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-07 00:24:09,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25533005] [2021-12-07 00:24:09,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:24:09,580 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-07 00:24:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 4 times [2021-12-07 00:24:09,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:09,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967924674] [2021-12-07 00:24:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:09,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:09,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:09,588 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:09,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:09,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-07 00:24:09,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-07 00:24:09,700 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 24 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) [2021-12-07 00:24:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:09,778 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2021-12-07 00:24:09,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 00:24:09,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2021-12-07 00:24:09,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-07 00:24:09,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 64 transitions. [2021-12-07 00:24:09,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-07 00:24:09,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-07 00:24:09,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2021-12-07 00:24:09,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:24:09,780 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2021-12-07 00:24:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2021-12-07 00:24:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2021-12-07 00:24:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2021-12-07 00:24:09,783 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2021-12-07 00:24:09,783 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2021-12-07 00:24:09,783 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-07 00:24:09,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 63 transitions. [2021-12-07 00:24:09,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-07 00:24:09,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:09,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:09,784 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:09,784 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:09,784 INFO L791 eck$LassoCheckResult]: Stem: 2560#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2561#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; 2574#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2566#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 2556#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; 2557#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2558#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; 2559#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2591#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; 2589#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2588#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2582#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);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);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; 2583#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); 2586#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2599#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); 2575#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2576#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); 2587#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2590#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2584#L517-4 lis_~i~0#1 := 1; 2585#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2598#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2593#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2592#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2562#L520-3 [2021-12-07 00:24:09,784 INFO L793 eck$LassoCheckResult]: Loop: 2562#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; 2563#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; 2580#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; 2595#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2594#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2571#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2572#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2562#L520-3 [2021-12-07 00:24:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:09,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1572106802, now seen corresponding path program 1 times [2021-12-07 00:24:09,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:09,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339652205] [2021-12-07 00:24:09,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:09,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-07 00:24:09,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:09,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339652205] [2021-12-07 00:24:09,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339652205] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:24:09,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:24:09,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:24:09,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538462226] [2021-12-07 00:24:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:24:09,815 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-07 00:24:09,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 5 times [2021-12-07 00:24:09,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:09,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166543487] [2021-12-07 00:24:09,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:09,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:09,820 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:09,825 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:09,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:09,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:24:09,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:24:09,935 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:09,950 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2021-12-07 00:24:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:24:09,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2021-12-07 00:24:09,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-07 00:24:09,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 64 transitions. [2021-12-07 00:24:09,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-12-07 00:24:09,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-12-07 00:24:09,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2021-12-07 00:24:09,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:24:09,952 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2021-12-07 00:24:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2021-12-07 00:24:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2021-12-07 00:24:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 46 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-12-07 00:24:09,954 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-07 00:24:09,954 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-07 00:24:09,954 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-07 00:24:09,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2021-12-07 00:24:09,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-07 00:24:09,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:09,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:09,954 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:09,955 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:09,955 INFO L791 eck$LassoCheckResult]: Stem: 2663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2664#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; 2677#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2669#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 2659#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; 2660#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2661#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; 2662#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2696#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; 2693#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2692#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2687#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);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);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; 2688#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); 2678#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2679#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); 2691#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2697#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); 2695#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2694#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2689#L517-4 lis_~i~0#1 := 1; 2690#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2665#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; 2666#L521 assume !lis_#t~short11#1; 2670#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); 2671#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2682#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2674#L519-2 [2021-12-07 00:24:09,955 INFO L793 eck$LassoCheckResult]: Loop: 2674#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2675#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2680#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; 2701#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; 2703#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; 2702#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2700#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2674#L519-2 [2021-12-07 00:24:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:09,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1035359454, now seen corresponding path program 1 times [2021-12-07 00:24:09,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:09,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670934649] [2021-12-07 00:24:09,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:09,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-07 00:24:09,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:09,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670934649] [2021-12-07 00:24:09,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670934649] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:24:09,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:24:09,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:24:09,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543213939] [2021-12-07 00:24:09,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:24:09,981 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-07 00:24:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:09,982 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 6 times [2021-12-07 00:24:09,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:09,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023093680] [2021-12-07 00:24:09,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:09,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:09,987 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:09,992 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:10,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:10,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:24:10,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:24:10,102 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 19 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) [2021-12-07 00:24:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:10,111 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2021-12-07 00:24:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:24:10,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 66 transitions. [2021-12-07 00:24:10,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-07 00:24:10,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 66 transitions. [2021-12-07 00:24:10,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-07 00:24:10,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-12-07 00:24:10,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2021-12-07 00:24:10,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:24:10,112 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2021-12-07 00:24:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2021-12-07 00:24:10,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-07 00:24:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 50 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2021-12-07 00:24:10,114 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2021-12-07 00:24:10,114 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2021-12-07 00:24:10,114 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-07 00:24:10,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 66 transitions. [2021-12-07 00:24:10,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-07 00:24:10,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:10,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:10,115 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:10,115 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:10,115 INFO L791 eck$LassoCheckResult]: Stem: 2767#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2768#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; 2782#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2773#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 2763#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; 2764#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2765#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; 2766#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2803#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; 2800#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2799#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2794#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);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);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; 2795#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); 2783#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2784#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); 2798#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2804#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); 2802#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2801#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2796#L517-4 lis_~i~0#1 := 1; 2797#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2807#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; 2811#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; 2806#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); 2775#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2787#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2778#L519-2 [2021-12-07 00:24:10,115 INFO L793 eck$LassoCheckResult]: Loop: 2778#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2779#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2769#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; 2770#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; 2790#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; 2809#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2808#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2778#L519-2 [2021-12-07 00:24:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:10,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2021-12-07 00:24:10,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:10,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904369436] [2021-12-07 00:24:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:10,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:10,145 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:10,168 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:10,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:10,169 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 7 times [2021-12-07 00:24:10,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:10,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898975080] [2021-12-07 00:24:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:10,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:10,172 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:10,176 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:10,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1635630457, now seen corresponding path program 1 times [2021-12-07 00:24:10,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:10,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654791221] [2021-12-07 00:24:10,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:10,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-07 00:24:10,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:10,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654791221] [2021-12-07 00:24:10,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654791221] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:24:10,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500385408] [2021-12-07 00:24:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:10,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:24:10,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:10,215 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:24:10,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2021-12-07 00:24:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:10,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 00:24:10,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-07 00:24:10,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:24:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-07 00:24:10,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500385408] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:24:10,359 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:24:10,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-12-07 00:24:10,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925309533] [2021-12-07 00:24:10,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:24:10,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:10,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 00:24:10,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-07 00:24:10,462 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. cyclomatic complexity: 19 Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:10,516 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2021-12-07 00:24:10,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 00:24:10,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 90 transitions. [2021-12-07 00:24:10,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-12-07 00:24:10,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 56 transitions. [2021-12-07 00:24:10,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-12-07 00:24:10,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-07 00:24:10,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2021-12-07 00:24:10,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:24:10,518 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2021-12-07 00:24:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2021-12-07 00:24:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2021-12-07 00:24:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2021-12-07 00:24:10,519 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-12-07 00:24:10,519 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-12-07 00:24:10,519 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-07 00:24:10,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2021-12-07 00:24:10,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-12-07 00:24:10,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:10,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:10,520 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:10,520 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2021-12-07 00:24:10,520 INFO L791 eck$LassoCheckResult]: Stem: 3098#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3099#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; 3107#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3102#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 3094#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; 3095#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3096#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; 3097#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3123#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; 3122#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3121#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3114#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);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);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; 3115#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); 3108#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3109#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); 3117#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3120#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); 3119#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3118#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3116#L517-4 lis_~i~0#1 := 1; 3111#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3112#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; 3133#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; 3131#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); 3130#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3124#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3105#L519-2 [2021-12-07 00:24:10,520 INFO L793 eck$LassoCheckResult]: Loop: 3105#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3106#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3129#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; 3128#L521 assume !lis_#t~short11#1; 3126#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; 3110#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3100#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; 3101#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; 3113#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; 3104#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3125#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3105#L519-2 [2021-12-07 00:24:10,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:10,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 3 times [2021-12-07 00:24:10,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:10,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909833270] [2021-12-07 00:24:10,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:10,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:10,552 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:10,573 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 1 times [2021-12-07 00:24:10,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:10,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922758005] [2021-12-07 00:24:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:10,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:10,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:10,583 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:10,583 INFO L85 PathProgramCache]: Analyzing trace with hash 116956416, now seen corresponding path program 1 times [2021-12-07 00:24:10,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:10,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569624664] [2021-12-07 00:24:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:10,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-07 00:24:10,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:10,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569624664] [2021-12-07 00:24:10,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569624664] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:24:10,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250690483] [2021-12-07 00:24:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:10,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:24:10,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:10,980 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:24:10,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2021-12-07 00:24:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:11,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-07 00:24:11,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:11,071 INFO L388 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 [2021-12-07 00:24:11,110 INFO L388 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 [2021-12-07 00:24:11,112 INFO L388 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 [2021-12-07 00:24:11,165 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-07 00:24:11,165 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-12-07 00:24:11,168 INFO L388 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 [2021-12-07 00:24:11,329 INFO L354 Elim1Store]: treesize reduction 172, result has 20.4 percent of original size [2021-12-07 00:24:11,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 74 [2021-12-07 00:24:11,334 INFO L388 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 78 treesize of output 72 [2021-12-07 00:24:11,510 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-07 00:24:11,511 INFO L388 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 37 treesize of output 13 [2021-12-07 00:24:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-07 00:24:11,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:24:11,680 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_lis_~j~0#1| Int)) (or (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (<= (+ (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1) (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4))))) (forall ((v_ArrVal_854 (Array Int Int))) (let ((.cse2 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (store .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) (+ (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_854) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 4)) (+ (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) 1))))))) is different from false [2021-12-07 00:24:11,709 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_854 (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 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1)) (.cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4))) (or (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse2 .cse1 .cse3)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_854) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 .cse1) 1))) (<= .cse3 (select .cse2 .cse1)))))) is different from false [2021-12-07 00:24:11,796 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (|ULTIMATE.start_lis_~j~0#1| Int)) (let ((.cse4 (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_849))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (.cse0 (+ (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1))) (or (<= .cse0 (select .cse1 .cse2)) (let ((.cse3 (select (store (store .cse4 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 .cse0)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_854) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse3 .cse2) 1)))))))) is different from false [2021-12-07 00:24:11,808 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:24:11,808 INFO L388 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 451 treesize of output 271 [2021-12-07 00:24:11,813 INFO L388 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 424 treesize of output 412 [2021-12-07 00:24:11,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:24:11,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:24:11,841 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:24:11,841 INFO L388 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 320 treesize of output 308 [2021-12-07 00:24:11,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:24:11,853 INFO L388 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 285 treesize of output 253 [2021-12-07 00:24:11,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:24:11,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:24:11,869 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:24:11,869 INFO L388 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 370 treesize of output 358 [2021-12-07 00:24:11,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:24:11,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:24:11,899 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:24:11,899 INFO L388 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 282 treesize of output 308 [2021-12-07 00:24:12,550 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2021-12-07 00:24:12,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250690483] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:24:12,550 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:24:12,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 42 [2021-12-07 00:24:12,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310644050] [2021-12-07 00:24:12,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:24:12,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:12,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-07 00:24:12,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1328, Unknown=4, NotChecked=228, Total=1722 [2021-12-07 00:24:12,680 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:16,975 INFO L93 Difference]: Finished difference Result 222 states and 284 transitions. [2021-12-07 00:24:16,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2021-12-07 00:24:16,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 284 transitions. [2021-12-07 00:24:16,977 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 94 [2021-12-07 00:24:16,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 284 transitions. [2021-12-07 00:24:16,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 206 [2021-12-07 00:24:16,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 206 [2021-12-07 00:24:16,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 284 transitions. [2021-12-07 00:24:16,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:24:16,979 INFO L681 BuchiCegarLoop]: Abstraction has 222 states and 284 transitions. [2021-12-07 00:24:16,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 284 transitions. [2021-12-07 00:24:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 146. [2021-12-07 00:24:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 145 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2021-12-07 00:24:16,983 INFO L704 BuchiCegarLoop]: Abstraction has 146 states and 189 transitions. [2021-12-07 00:24:16,983 INFO L587 BuchiCegarLoop]: Abstraction has 146 states and 189 transitions. [2021-12-07 00:24:16,983 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-07 00:24:16,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 189 transitions. [2021-12-07 00:24:16,983 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 49 [2021-12-07 00:24:16,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:16,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:16,984 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:16,984 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2021-12-07 00:24:16,984 INFO L791 eck$LassoCheckResult]: Stem: 3818#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3819#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; 3828#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3822#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 3814#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; 3815#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3816#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; 3817#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3827#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; 3844#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3843#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3836#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);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);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; 3837#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); 3840#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3847#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); 3848#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3841#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); 3842#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3890#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3889#L517-4 lis_~i~0#1 := 1; 3887#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3885#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; 3882#L521 assume !lis_#t~short11#1; 3883#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; 3880#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3923#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3932#L519-2 [2021-12-07 00:24:16,984 INFO L793 eck$LassoCheckResult]: Loop: 3932#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3832#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3833#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; 3954#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; 3953#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; 3863#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3922#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; 3918#L521 assume !lis_#t~short11#1; 3920#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; 3934#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3933#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3932#L519-2 [2021-12-07 00:24:16,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1035361376, now seen corresponding path program 1 times [2021-12-07 00:24:16,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:16,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019175001] [2021-12-07 00:24:16,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:16,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:17,002 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:17,017 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:17,018 INFO L85 PathProgramCache]: Analyzing trace with hash -943386241, now seen corresponding path program 2 times [2021-12-07 00:24:17,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:17,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011427732] [2021-12-07 00:24:17,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:17,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:17,022 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:17,026 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:17,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:17,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1364618304, now seen corresponding path program 1 times [2021-12-07 00:24:17,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:17,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619774178] [2021-12-07 00:24:17,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:17,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-07 00:24:17,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:17,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619774178] [2021-12-07 00:24:17,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619774178] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:24:17,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335266639] [2021-12-07 00:24:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:17,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:24:17,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:17,295 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:24:17,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2021-12-07 00:24:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:17,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-07 00:24:17,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:17,386 INFO L388 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 [2021-12-07 00:24:17,403 INFO L388 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 [2021-12-07 00:24:17,406 INFO L388 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 [2021-12-07 00:24:17,444 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-12-07 00:24:17,444 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2021-12-07 00:24:17,446 INFO L388 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 19 treesize of output 21 [2021-12-07 00:24:17,471 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-07 00:24:17,471 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-12-07 00:24:17,474 INFO L388 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 23 treesize of output 23 [2021-12-07 00:24:17,587 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 00:24:17,587 INFO L388 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 33 treesize of output 13 [2021-12-07 00:24:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-07 00:24:17,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:24:17,698 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-07 00:24:17,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-07 00:24:17,711 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_955 Int)) (let ((.cse0 (select (store (let ((.cse2 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse1 (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_955)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_953))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 4) 1)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-07 00:24:17,719 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_955 Int)) (let ((.cse0 (select (store (let ((.cse2 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse1 (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 4) v_ArrVal_955)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_953))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 8) 1)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-07 00:24:17,728 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:24:17,728 INFO L388 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 231 treesize of output 148 [2021-12-07 00:24:17,732 INFO L388 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 269 treesize of output 263 [2021-12-07 00:24:17,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:24:17,751 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:24:17,752 INFO L388 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 500 treesize of output 496 [2021-12-07 00:24:17,773 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 00:24:17,773 INFO L388 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 402 treesize of output 378 [2021-12-07 00:24:17,784 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 00:24:17,784 INFO L388 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 504 treesize of output 480 [2021-12-07 00:24:17,810 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 00:24:17,811 INFO L388 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 889 treesize of output 841 [2021-12-07 00:24:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 8 not checked. [2021-12-07 00:24:18,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335266639] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:24:18,079 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:24:18,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 12] total 33 [2021-12-07 00:24:18,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444719938] [2021-12-07 00:24:18,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:24:18,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:18,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-07 00:24:18,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=721, Unknown=4, NotChecked=228, Total=1056 [2021-12-07 00:24:18,221 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. cyclomatic complexity: 49 Second operand has 33 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:19,253 INFO L93 Difference]: Finished difference Result 224 states and 290 transitions. [2021-12-07 00:24:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-07 00:24:19,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 290 transitions. [2021-12-07 00:24:19,254 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 110 [2021-12-07 00:24:19,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 224 states and 290 transitions. [2021-12-07 00:24:19,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2021-12-07 00:24:19,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2021-12-07 00:24:19,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 290 transitions. [2021-12-07 00:24:19,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:24:19,256 INFO L681 BuchiCegarLoop]: Abstraction has 224 states and 290 transitions. [2021-12-07 00:24:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 290 transitions. [2021-12-07 00:24:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 169. [2021-12-07 00:24:19,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 169 states have (on average 1.2840236686390532) internal successors, (217), 168 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 217 transitions. [2021-12-07 00:24:19,261 INFO L704 BuchiCegarLoop]: Abstraction has 169 states and 217 transitions. [2021-12-07 00:24:19,261 INFO L587 BuchiCegarLoop]: Abstraction has 169 states and 217 transitions. [2021-12-07 00:24:19,261 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-07 00:24:19,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 217 transitions. [2021-12-07 00:24:19,261 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2021-12-07 00:24:19,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:19,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:19,262 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:19,262 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2021-12-07 00:24:19,262 INFO L791 eck$LassoCheckResult]: Stem: 4511#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4512#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; 4521#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4515#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 4507#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; 4508#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4509#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; 4510#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4518#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; 4534#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4533#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4528#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);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);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; 4529#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); 4531#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4537#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); 4538#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4532#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); 4522#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4523#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); 4536#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4581#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4577#L517-4 lis_~i~0#1 := 1; 4578#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4573#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; 4574#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; 4567#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; 4568#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4641#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4637#L519-2 [2021-12-07 00:24:19,262 INFO L793 eck$LassoCheckResult]: Loop: 4637#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4638#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4633#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; 4634#L521 assume !lis_#t~short11#1; 4653#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; 4556#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4651#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; 4648#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; 4646#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; 4645#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4650#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4637#L519-2 [2021-12-07 00:24:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:19,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1573720900, now seen corresponding path program 1 times [2021-12-07 00:24:19,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:19,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634493407] [2021-12-07 00:24:19,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:19,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:24:19,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:19,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634493407] [2021-12-07 00:24:19,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634493407] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:24:19,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787081632] [2021-12-07 00:24:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:19,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:24:19,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:19,321 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:24:19,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2021-12-07 00:24:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:19,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-07 00:24:19,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:24:19,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:24:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:24:19,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787081632] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:24:19,477 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:24:19,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-07 00:24:19,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037970961] [2021-12-07 00:24:19,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:24:19,477 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-07 00:24:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 3 times [2021-12-07 00:24:19,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:19,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960080011] [2021-12-07 00:24:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:19,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:19,481 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:24:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:24:19,485 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:24:19,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:24:19,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-07 00:24:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-07 00:24:19,647 INFO L87 Difference]: Start difference. First operand 169 states and 217 transitions. cyclomatic complexity: 55 Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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) [2021-12-07 00:24:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:24:19,755 INFO L93 Difference]: Finished difference Result 261 states and 330 transitions. [2021-12-07 00:24:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 00:24:19,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 330 transitions. [2021-12-07 00:24:19,757 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 84 [2021-12-07 00:24:19,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 255 states and 322 transitions. [2021-12-07 00:24:19,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2021-12-07 00:24:19,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 236 [2021-12-07 00:24:19,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 322 transitions. [2021-12-07 00:24:19,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:24:19,759 INFO L681 BuchiCegarLoop]: Abstraction has 255 states and 322 transitions. [2021-12-07 00:24:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 322 transitions. [2021-12-07 00:24:19,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 229. [2021-12-07 00:24:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 229 states have (on average 1.2663755458515285) internal successors, (290), 228 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:24:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 290 transitions. [2021-12-07 00:24:19,763 INFO L704 BuchiCegarLoop]: Abstraction has 229 states and 290 transitions. [2021-12-07 00:24:19,763 INFO L587 BuchiCegarLoop]: Abstraction has 229 states and 290 transitions. [2021-12-07 00:24:19,763 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-07 00:24:19,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 290 transitions. [2021-12-07 00:24:19,764 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 74 [2021-12-07 00:24:19,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:24:19,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:24:19,764 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:24:19,764 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2021-12-07 00:24:19,765 INFO L791 eck$LassoCheckResult]: Stem: 5133#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5134#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; 5143#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5137#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 5129#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; 5130#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5164#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; 5140#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5131#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; 5132#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5161#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; 5160#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5159#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5152#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);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);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; 5153#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); 5156#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5172#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); 5173#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5157#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); 5158#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5239#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); 5146#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5147#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 5244#L517-4 lis_~i~0#1 := 1; 5243#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5242#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; 5240#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; 5237#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; 5238#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5329#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5318#L519-2 [2021-12-07 00:24:19,765 INFO L793 eck$LassoCheckResult]: Loop: 5318#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5325#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5324#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; 5323#L521 assume !lis_#t~short11#1; 5321#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; 5209#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5319#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; 5313#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; 5314#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; 5183#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5317#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5318#L519-2 [2021-12-07 00:24:19,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:24:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash -11228634, now seen corresponding path program 2 times [2021-12-07 00:24:19,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:24:19,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351954357] [2021-12-07 00:24:19,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:24:19,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:24:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:24:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:24:20,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:24:20,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351954357] [2021-12-07 00:24:20,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351954357] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:24:20,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33343698] [2021-12-07 00:24:20,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 00:24:20,151 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:24:20,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:24:20,151 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:24:20,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2021-12-07 00:24:20,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 00:24:20,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:24:20,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-07 00:24:20,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:24:20,230 INFO L388 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 [2021-12-07 00:24:20,252 INFO L388 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 [2021-12-07 00:24:20,254 INFO L388 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 [2021-12-07 00:24:20,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:24:20,301 INFO L388 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 31 treesize of output 33 [2021-12-07 00:24:20,303 INFO L388 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 30 treesize of output 30 [2021-12-07 00:24:20,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:24:20,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:24:20,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:24:20,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2021-12-07 00:24:20,369 INFO L388 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 34 treesize of output 32 [2021-12-07 00:24:20,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:24:20,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:24:20,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:24:20,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:24:20,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:24:20,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:24:20,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-12-07 00:24:20,460 INFO L388 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 34 treesize of output 32 [2021-12-07 00:24:57,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:24:57,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:24:57,510 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:24:57,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 16 [2021-12-07 00:24:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-07 00:24:57,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:24:57,599 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1127 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) v_ArrVal_1127)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-07 00:24:57,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_190| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (forall ((v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1127 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))) is different from false [2021-12-07 00:24:58,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_190| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1127 Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (let ((.cse0 (select (store (let ((.cse1 (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1121))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) is different from false [2021-12-07 00:24:58,859 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_191| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_191| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_190| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1127 Int)) (or (let ((.cse0 (select (store (let ((.cse1 (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_191| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1121))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |v_ULTIMATE.start_lis_~i~0#1_191| 1)))))) is different from false [2021-12-07 00:24:58,894 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_190| Int) (|v_ULTIMATE.start_lis_~i~0#1_191| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1127 Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_191| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (let ((.cse0 (select (store (let ((.cse1 (store (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1119))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_191| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1121))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |v_ULTIMATE.start_lis_~i~0#1_191| 1)))) is different from false [2021-12-07 00:24:58,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_190| Int) (|v_ULTIMATE.start_lis_~i~0#1_191| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1127 Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |v_ULTIMATE.start_lis_~i~0#1_191| 1)) (< |v_ULTIMATE.start_lis_~i~0#1_191| (+ |c_ULTIMATE.start_lis_~i~0#1| 2)) (let ((.cse0 (select (store (let ((.cse1 (store (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1119))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_191| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1121))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) is different from false [2021-12-07 00:24:58,934 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:24:58,934 INFO L388 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 473 treesize of output 294 [2021-12-07 00:24:58,944 INFO L388 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 541 treesize of output 535 [2021-12-07 00:24:58,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:24:58,967 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:24:58,967 INFO L388 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 6432 treesize of output 6260 [2021-12-07 00:24:59,257 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 00:24:59,258 INFO L388 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 3881 treesize of output 3833 [2021-12-07 00:24:59,291 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 00:24:59,291 INFO L388 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 4085 treesize of output 4037 [2021-12-07 00:24:59,399 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 00:24:59,399 INFO L388 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 5383 treesize of output 5287 [2021-12-07 00:24:59,537 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 00:24:59,537 INFO L388 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 3338 treesize of output 3242 [2021-12-07 00:25:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 15 not checked. [2021-12-07 00:25:01,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33343698] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:25:01,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:25:01,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 13] total 41 [2021-12-07 00:25:01,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128911995] [2021-12-07 00:25:01,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:25:01,628 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-07 00:25:01,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:25:01,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 4 times [2021-12-07 00:25:01,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:25:01,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014791342] [2021-12-07 00:25:01,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:25:01,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:25:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:25:01,635 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:25:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:25:01,639 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:25:01,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:25:01,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-07 00:25:01,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1049, Unknown=8, NotChecked=426, Total=1640 [2021-12-07 00:25:01,794 INFO L87 Difference]: Start difference. First operand 229 states and 290 transitions. cyclomatic complexity: 70 Second operand has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 41 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:25:34,403 WARN L227 SmtUtils]: Spent 30.75s on a formula simplification. DAG size of input: 74 DAG size of output: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 00:25:46,416 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_lis_~i~0#1| 4)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|)) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1)) 1) (<= 1 (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1 (- 4)))) (forall ((|v_ULTIMATE.start_lis_~i~0#1_191| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_191| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_190| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1127 Int)) (or (let ((.cse2 (select (store (let ((.cse3 (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_191| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1121))) (store .cse3 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse2 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |v_ULTIMATE.start_lis_~i~0#1_191| 1)))))) (= |c_ULTIMATE.start_lis_~i~0#1| 1) (or (<= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* 4 |c_ULTIMATE.start_lis_~i~0#1|) 1) (* 4 |c_ULTIMATE.start_lis_~N#1|)) (and (= (select .cse0 0) 1) (= (select .cse0 4) 1))))) is different from false [2021-12-07 00:25:50,043 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|)) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) 1) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (<= 2 |c_ULTIMATE.start_lis_~i~0#1|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_190| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1127 Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (let ((.cse1 (select (store (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1121))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))))) is different from false [2021-12-07 00:26:02,047 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse2 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse0 (= (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2)) 1))) (and (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|)) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) .cse0 (<= 1 (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 (- 4)))) (forall ((|v_ULTIMATE.start_lis_~i~0#1_191| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_191| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_190| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1127 Int)) (or (let ((.cse3 (select (store (let ((.cse4 (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_191| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1121))) (store .cse4 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |v_ULTIMATE.start_lis_~i~0#1_191| 1)))))) (= |c_ULTIMATE.start_lis_~i~0#1| 1) (let ((.cse5 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (or (<= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse5 13) (* 4 |c_ULTIMATE.start_lis_~N#1|)) (and (= (select .cse1 0) 1) .cse0 (= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse5) 4) (<= (+ (div (* |c_ULTIMATE.start_lis_~best~0#1.offset| (- 1)) 4) 4) |c_ULTIMATE.start_lis_~N#1|))))))) is different from false [2021-12-07 00:26:14,052 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|)) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4))) 1) (forall ((|v_ULTIMATE.start_lis_~i~0#1_190| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (forall ((v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1127 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))) (= (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) 1) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (<= 2 |c_ULTIMATE.start_lis_~i~0#1|))) is different from false [2021-12-07 00:26:14,828 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|)) (or (and (= (select .cse0 0) 1) (<= (+ (div (* |c_ULTIMATE.start_lis_~best~0#1.offset| (- 1)) 4) 4) |c_ULTIMATE.start_lis_~N#1|) (= (select .cse0 4) 1)) (<= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 9 (* 4 |c_ULTIMATE.start_lis_~i~0#1|)) (* 4 |c_ULTIMATE.start_lis_~N#1|))) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) 1) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (<= 2 |c_ULTIMATE.start_lis_~i~0#1|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_190| Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1127 Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (let ((.cse1 (select (store (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1121))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))))) is different from false [2021-12-07 00:26:26,853 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|)) (or (and (= (select .cse0 0) 1) (<= (+ (div (* |c_ULTIMATE.start_lis_~best~0#1.offset| (- 1)) 4) 4) |c_ULTIMATE.start_lis_~N#1|) (= (select .cse0 4) 1)) (<= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 9 (* 4 |c_ULTIMATE.start_lis_~i~0#1|)) (* 4 |c_ULTIMATE.start_lis_~N#1|))) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4))) 1) (forall ((|v_ULTIMATE.start_lis_~i~0#1_190| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_190| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (forall ((v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1127 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_190| 4)) v_ArrVal_1127)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))) (= (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) 1) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (<= 2 |c_ULTIMATE.start_lis_~i~0#1|))) is different from false [2021-12-07 00:26:44,576 WARN L227 SmtUtils]: Spent 17.65s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 00:26:52,912 WARN L227 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 31 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 00:27:00,086 WARN L227 SmtUtils]: Spent 7.11s on a formula simplification. DAG size of input: 35 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 00:27:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:27:00,124 INFO L93 Difference]: Finished difference Result 210 states and 264 transitions. [2021-12-07 00:27:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-07 00:27:00,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 264 transitions. [2021-12-07 00:27:00,126 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 74 [2021-12-07 00:27:00,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 210 states and 264 transitions. [2021-12-07 00:27:00,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 192 [2021-12-07 00:27:00,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2021-12-07 00:27:00,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 264 transitions. [2021-12-07 00:27:00,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:27:00,127 INFO L681 BuchiCegarLoop]: Abstraction has 210 states and 264 transitions. [2021-12-07 00:27:00,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 264 transitions. [2021-12-07 00:27:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2021-12-07 00:27:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 208 states have (on average 1.2596153846153846) internal successors, (262), 207 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 262 transitions. [2021-12-07 00:27:00,131 INFO L704 BuchiCegarLoop]: Abstraction has 208 states and 262 transitions. [2021-12-07 00:27:00,131 INFO L587 BuchiCegarLoop]: Abstraction has 208 states and 262 transitions. [2021-12-07 00:27:00,131 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-12-07 00:27:00,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 262 transitions. [2021-12-07 00:27:00,131 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 74 [2021-12-07 00:27:00,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:27:00,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:27:00,132 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:27:00,132 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2021-12-07 00:27:00,132 INFO L791 eck$LassoCheckResult]: Stem: 5829#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5830#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; 5838#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5833#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 5825#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; 5826#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5827#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; 5828#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5857#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; 5858#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5863#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; 5856#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5855#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5848#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);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);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; 5849#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); 5852#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5869#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); 5870#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5853#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); 5854#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5910#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); 5841#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5842#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 5932#L517-4 lis_~i~0#1 := 1; 5931#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5930#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; 5928#L521 assume !lis_#t~short11#1; 5929#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; 5964#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5962#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5959#L519-2 [2021-12-07 00:27:00,132 INFO L793 eck$LassoCheckResult]: Loop: 5959#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5958#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5957#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; 5955#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; 5954#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; 5953#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5952#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; 5881#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; 5882#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; 5963#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5960#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5959#L519-2 [2021-12-07 00:27:00,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:00,132 INFO L85 PathProgramCache]: Analyzing trace with hash -11169052, now seen corresponding path program 2 times [2021-12-07 00:27:00,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:00,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635296761] [2021-12-07 00:27:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:00,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:27:00,149 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:27:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:27:00,164 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:27:00,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:00,165 INFO L85 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 8 times [2021-12-07 00:27:00,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:00,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122745499] [2021-12-07 00:27:00,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:00,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:27:00,169 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:27:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:27:00,174 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:27:00,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:27:00,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1948580350, now seen corresponding path program 2 times [2021-12-07 00:27:00,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:27:00,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357750580] [2021-12-07 00:27:00,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:27:00,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:27:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:27:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:27:00,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:27:00,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357750580] [2021-12-07 00:27:00,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357750580] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:27:00,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46664278] [2021-12-07 00:27:00,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-07 00:27:00,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:27:00,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:27:00,680 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:27:00,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2021-12-07 00:27:00,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-07 00:27:00,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:27:00,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-07 00:27:00,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:27:00,780 INFO L388 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 [2021-12-07 00:27:00,829 INFO L388 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 [2021-12-07 00:27:00,832 INFO L388 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 [2021-12-07 00:27:00,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:27:00,888 INFO L388 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 28 treesize of output 30 [2021-12-07 00:27:00,891 INFO L388 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 27 treesize of output 27 [2021-12-07 00:27:00,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:27:00,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:27:00,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:27:00,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-12-07 00:27:00,962 INFO L388 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 [2021-12-07 00:27:01,206 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:27:01,207 INFO L388 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 [2021-12-07 00:27:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-07 00:27:01,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:27:01,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1253 Int) (v_ArrVal_1252 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) v_ArrVal_1253)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) 1)))) is different from false [2021-12-07 00:27:01,390 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_203| Int)) (or (forall ((v_ArrVal_1253 Int) (v_ArrVal_1252 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_203| 4)) v_ArrVal_1253)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) 1)))) (< |v_ULTIMATE.start_lis_~i~0#1_203| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) is different from false [2021-12-07 00:27:01,419 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1250 Int) (v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1253 Int) (|v_ULTIMATE.start_lis_~i~0#1_203| Int) (v_ArrVal_1252 (Array Int Int))) (or (let ((.cse0 (select (store (let ((.cse1 (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) v_ArrVal_1250)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1249))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_203| 4)) v_ArrVal_1253))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) 1))) (< 1 v_ArrVal_1250) (< |v_ULTIMATE.start_lis_~i~0#1_203| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) is different from false [2021-12-07 00:27:01,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1250 Int) (v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1253 Int) (|v_ULTIMATE.start_lis_~i~0#1_203| Int) (v_ArrVal_1252 (Array Int Int))) (or (let ((.cse0 (select (store (let ((.cse1 (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) v_ArrVal_1250)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1249))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_203| 4)) v_ArrVal_1253))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) 1))) (< 1 v_ArrVal_1250) (< |v_ULTIMATE.start_lis_~i~0#1_203| (+ |c_ULTIMATE.start_lis_~i~0#1| 2)))) is different from false [2021-12-07 00:27:01,466 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:27:01,466 INFO L388 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 231 treesize of output 148 [2021-12-07 00:27:01,472 INFO L388 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 277 treesize of output 271 [2021-12-07 00:27:01,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:27:01,483 INFO L388 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 509 treesize of output 477 [2021-12-07 00:27:01,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:27:01,499 INFO L388 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 445 treesize of output 413 [2021-12-07 00:27:01,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:27:01,507 INFO L388 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 551 treesize of output 519 [2021-12-07 00:27:01,541 INFO L354 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2021-12-07 00:27:01,541 INFO L388 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 1792 treesize of output 1678 [2021-12-07 00:27:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 12 not checked. [2021-12-07 00:27:17,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46664278] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:27:17,482 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:27:17,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14, 14] total 45 [2021-12-07 00:27:17,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870955375] [2021-12-07 00:27:17,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:27:17,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:27:17,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-07 00:27:17,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1481, Unknown=4, NotChecked=324, Total=1980 [2021-12-07 00:27:17,685 INFO L87 Difference]: Start difference. First operand 208 states and 262 transitions. cyclomatic complexity: 63 Second operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 45 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:27:30,269 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse0 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse2 (<= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 9 .cse0) (* 4 |c_ULTIMATE.start_lis_~N#1|))) (.cse1 (select .cse4 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4))))) (and (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|)) (= |c_ULTIMATE.start_lis_~i~0#1| 2) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (or (and (= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse0) 8) (= .cse1 1)) .cse2) (forall ((|v_ULTIMATE.start_lis_~i~0#1_203| Int)) (or (forall ((v_ArrVal_1253 Int) (v_ArrVal_1252 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_203| 4)) v_ArrVal_1253)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1252) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) 1)))) (< |v_ULTIMATE.start_lis_~i~0#1_203| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) (or (= (select .cse4 4) 1) .cse2) (<= 1 (select .cse4 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4))) (<= .cse1 1)))) is different from false [2021-12-07 00:28:40,151 WARN L227 SmtUtils]: Spent 1.16m on a formula simplification. DAG size of input: 86 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 00:28:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:28:41,738 INFO L93 Difference]: Finished difference Result 370 states and 473 transitions. [2021-12-07 00:28:41,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-07 00:28:41,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 473 transitions. [2021-12-07 00:28:41,740 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 146 [2021-12-07 00:28:41,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 370 states and 473 transitions. [2021-12-07 00:28:41,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2021-12-07 00:28:41,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2021-12-07 00:28:41,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 370 states and 473 transitions. [2021-12-07 00:28:41,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-07 00:28:41,743 INFO L681 BuchiCegarLoop]: Abstraction has 370 states and 473 transitions. [2021-12-07 00:28:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states and 473 transitions. [2021-12-07 00:28:41,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 233. [2021-12-07 00:28:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 233 states have (on average 1.2660944206008584) internal successors, (295), 232 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:28:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 295 transitions. [2021-12-07 00:28:41,747 INFO L704 BuchiCegarLoop]: Abstraction has 233 states and 295 transitions. [2021-12-07 00:28:41,747 INFO L587 BuchiCegarLoop]: Abstraction has 233 states and 295 transitions. [2021-12-07 00:28:41,747 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-12-07 00:28:41,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 295 transitions. [2021-12-07 00:28:41,748 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 74 [2021-12-07 00:28:41,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:28:41,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:28:41,748 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:28:41,748 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-07 00:28:41,749 INFO L791 eck$LassoCheckResult]: Stem: 6788#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6789#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; 6797#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6792#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 6784#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; 6785#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6786#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; 6787#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6814#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; 6815#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6820#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6819#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);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);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; 6816#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); 6817#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6818#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); 6822#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6821#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); 6798#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6799#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 6808#L517-4 lis_~i~0#1 := 1; 6809#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6954#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; 6953#L521 assume !lis_#t~short11#1; 6950#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; 6951#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6885#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6886#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6802#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6803#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; 6998#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; 6982#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); 6976#L520-2 [2021-12-07 00:28:41,749 INFO L793 eck$LassoCheckResult]: Loop: 6976#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6980#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; 6977#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; 6978#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; 6976#L520-2 [2021-12-07 00:28:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:28:41,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1985736812, now seen corresponding path program 2 times [2021-12-07 00:28:41,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:28:41,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870491755] [2021-12-07 00:28:41,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:28:41,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:28:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:28:41,765 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:28:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:28:41,780 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:28:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:28:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2942460, now seen corresponding path program 4 times [2021-12-07 00:28:41,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:28:41,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661839166] [2021-12-07 00:28:41,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:28:41,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:28:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:28:41,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:28:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:28:41,793 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:28:41,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:28:41,794 INFO L85 PathProgramCache]: Analyzing trace with hash -213322737, now seen corresponding path program 3 times [2021-12-07 00:28:41,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:28:41,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680409574] [2021-12-07 00:28:41,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:28:41,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:28:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:28:41,817 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:28:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:28:41,838 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:28:56,880 WARN L227 SmtUtils]: Spent 14.94s on a formula simplification. DAG size of input: 343 DAG size of output: 230 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-07 00:29:01,039 INFO L210 LassoAnalysis]: Preferences: [2021-12-07 00:29:01,039 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-07 00:29:01,039 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-07 00:29:01,039 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-07 00:29:01,040 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-07 00:29:01,040 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:01,040 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-07 00:29:01,040 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-07 00:29:01,040 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration21_Lasso [2021-12-07 00:29:01,040 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-07 00:29:01,040 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-07 00:29:01,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:01,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:01,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:01,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:01,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:01,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:01,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:01,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:01,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:01,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:01,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:01,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:06,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-07 00:29:07,497 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-07 00:29:07,497 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-07 00:29:07,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,498 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-07 00:29:07,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:29:07,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:29:07,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:29:07,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,525 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-12-07 00:29:07,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,526 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-12-07 00:29:07,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:29:07,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:29:07,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2021-12-07 00:29:07,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,558 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-12-07 00:29:07,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:29:07,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:29:07,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:29:07,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-12-07 00:29:07,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,585 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-12-07 00:29:07,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 [2021-12-07 00:29:07,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:29:07,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:29:07,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-12-07 00:29:07,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,616 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-12-07 00:29:07,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:29:07,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:29:07,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:29:07,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-12-07 00:29:07,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,645 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-12-07 00:29:07,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:29:07,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:29:07,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-12-07 00:29:07,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,675 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-07 00:29:07,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:29:07,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:29:07,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2021-12-07 00:29:07,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,707 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-12-07 00:29:07,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:29:07,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:29:07,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:29:07,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2021-12-07 00:29:07,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,735 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-12-07 00:29:07,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 [2021-12-07 00:29:07,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:29:07,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:29:07,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:29:07,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2021-12-07 00:29:07,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,765 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-12-07 00:29:07,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:29:07,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:29:07,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2021-12-07 00:29:07,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,795 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-12-07 00:29:07,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-07 00:29:07,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-07 00:29:07,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-07 00:29:07,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2021-12-07 00:29:07,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,825 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-12-07 00:29:07,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:29:07,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:29:07,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2021-12-07 00:29:07,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,854 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-12-07 00:29:07,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:29:07,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:29:07,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2021-12-07 00:29:07,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,900 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-12-07 00:29:07,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:29:07,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:29:07,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2021-12-07 00:29:07,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,931 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-12-07 00:29:07,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:29:07,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:29:07,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2021-12-07 00:29:07,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,969 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:07,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-12-07 00:29:07,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:07,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:07,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:07,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:07,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:07,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:29:07,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:29:07,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:07,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2021-12-07 00:29:07,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:07,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:07,999 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:08,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-12-07 00:29:08,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:08,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:08,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:08,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:08,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:08,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:29:08,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:29:08,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-07 00:29:08,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2021-12-07 00:29:08,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:08,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:08,029 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:08,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-12-07 00:29:08,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-07 00:29:08,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-07 00:29:08,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-07 00:29:08,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-07 00:29:08,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-07 00:29:08,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-07 00:29:08,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-07 00:29:08,068 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-07 00:29:08,134 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-12-07 00:29:08,134 INFO L444 ModelExtractionUtils]: 20 out of 64 variables were initially zero. Simplification set additionally 41 variables to zero. [2021-12-07 00:29:08,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-07 00:29:08,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:08,135 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-07 00:29:08,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-12-07 00:29:08,136 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-07 00:29:08,145 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-07 00:29:08,145 INFO L513 LassoAnalysis]: Proved termination. [2021-12-07 00:29:08,145 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0#1, v_rep(select #length ULTIMATE.start_lis_~best~0#1.base)_3) = -2*ULTIMATE.start_lis_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_lis_~best~0#1.base)_3 Supporting invariants [] [2021-12-07 00:29:08,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2021-12-07 00:29:08,856 INFO L297 tatePredicateManager]: 124 out of 126 supporting invariants were superfluous and have been removed [2021-12-07 00:29:08,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:29:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:29:08,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-07 00:29:08,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:29:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:29:09,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-07 00:29:09,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:29:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:29:09,140 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 4 loop predicates [2021-12-07 00:29:09,140 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 295 transitions. cyclomatic complexity: 71 Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:29:09,274 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 295 transitions. cyclomatic complexity: 71. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 297 states and 386 transitions. Complement of second has 14 states. [2021-12-07 00:29:09,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 5 stem states 3 non-accepting loop states 2 accepting loop states [2021-12-07 00:29:09,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:29:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2021-12-07 00:29:09,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 49 transitions. Stem has 31 letters. Loop has 4 letters. [2021-12-07 00:29:09,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:29:09,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 49 transitions. Stem has 35 letters. Loop has 4 letters. [2021-12-07 00:29:09,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:29:09,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 49 transitions. Stem has 31 letters. Loop has 8 letters. [2021-12-07 00:29:09,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-07 00:29:09,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 297 states and 386 transitions. [2021-12-07 00:29:09,277 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 92 [2021-12-07 00:29:09,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 297 states to 296 states and 384 transitions. [2021-12-07 00:29:09,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2021-12-07 00:29:09,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2021-12-07 00:29:09,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 296 states and 384 transitions. [2021-12-07 00:29:09,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:29:09,279 INFO L681 BuchiCegarLoop]: Abstraction has 296 states and 384 transitions. [2021-12-07 00:29:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states and 384 transitions. [2021-12-07 00:29:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 279. [2021-12-07 00:29:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 279 states have (on average 1.3046594982078854) internal successors, (364), 278 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:29:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 364 transitions. [2021-12-07 00:29:09,284 INFO L704 BuchiCegarLoop]: Abstraction has 279 states and 364 transitions. [2021-12-07 00:29:09,284 INFO L587 BuchiCegarLoop]: Abstraction has 279 states and 364 transitions. [2021-12-07 00:29:09,284 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-12-07 00:29:09,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 364 transitions. [2021-12-07 00:29:09,285 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 92 [2021-12-07 00:29:09,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:29:09,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:29:09,285 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:29:09,285 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2021-12-07 00:29:09,285 INFO L791 eck$LassoCheckResult]: Stem: 7981#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7982#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; 7996#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 7987#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 7977#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; 7978#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 7979#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; 7980#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 7995#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; 8019#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8016#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; 8017#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8024#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 8009#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);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);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; 8010#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); 8013#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8039#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); 8040#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8014#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); 8015#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8071#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); 7999#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8000#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); 8038#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8036#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 8037#L517-4 lis_~i~0#1 := 1; 8065#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 8066#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; 8058#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; 8059#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); 8180#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8181#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 7993#L519-2 [2021-12-07 00:29:09,285 INFO L793 eck$LassoCheckResult]: Loop: 7993#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 7994#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 8205#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; 8206#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; 8184#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; 8221#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8220#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; 8218#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; 8213#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; 8211#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8212#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 7993#L519-2 [2021-12-07 00:29:09,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:29:09,286 INFO L85 PathProgramCache]: Analyzing trace with hash 880324934, now seen corresponding path program 4 times [2021-12-07 00:29:09,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:29:09,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710622319] [2021-12-07 00:29:09,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:29:09,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:29:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:29:09,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2021-12-07 00:29:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:29:09,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:29:09,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710622319] [2021-12-07 00:29:09,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710622319] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:29:09,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37110428] [2021-12-07 00:29:09,388 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-07 00:29:09,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:29:09,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:09,390 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:29:09,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2021-12-07 00:29:09,465 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-07 00:29:09,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:29:09,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-07 00:29:09,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:29:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:29:09,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:29:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 00:29:09,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37110428] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:29:09,585 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:29:09,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-07 00:29:09,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387494164] [2021-12-07 00:29:09,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:29:09,586 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-07 00:29:09,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:29:09,586 INFO L85 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 9 times [2021-12-07 00:29:09,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:29:09,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587563284] [2021-12-07 00:29:09,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:29:09,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:29:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:29:09,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:29:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:29:09,595 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:29:09,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:29:09,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-07 00:29:09,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-12-07 00:29:09,791 INFO L87 Difference]: Start difference. First operand 279 states and 364 transitions. cyclomatic complexity: 100 Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:29:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:29:09,996 INFO L93 Difference]: Finished difference Result 459 states and 599 transitions. [2021-12-07 00:29:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-07 00:29:09,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 459 states and 599 transitions. [2021-12-07 00:29:09,998 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 130 [2021-12-07 00:29:10,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 459 states to 453 states and 593 transitions. [2021-12-07 00:29:10,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 400 [2021-12-07 00:29:10,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 408 [2021-12-07 00:29:10,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 453 states and 593 transitions. [2021-12-07 00:29:10,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-07 00:29:10,001 INFO L681 BuchiCegarLoop]: Abstraction has 453 states and 593 transitions. [2021-12-07 00:29:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states and 593 transitions. [2021-12-07 00:29:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2021-12-07 00:29:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 410 states have (on average 1.3048780487804879) internal successors, (535), 409 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:29:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 535 transitions. [2021-12-07 00:29:10,008 INFO L704 BuchiCegarLoop]: Abstraction has 410 states and 535 transitions. [2021-12-07 00:29:10,008 INFO L587 BuchiCegarLoop]: Abstraction has 410 states and 535 transitions. [2021-12-07 00:29:10,008 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-12-07 00:29:10,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 410 states and 535 transitions. [2021-12-07 00:29:10,009 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 110 [2021-12-07 00:29:10,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-07 00:29:10,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-07 00:29:10,009 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:29:10,009 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-07 00:29:10,010 INFO L791 eck$LassoCheckResult]: Stem: 8954#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8955#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; 8970#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 8960#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 8950#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; 8951#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8993#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; 8994#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8952#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; 8953#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8990#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 8982#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);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);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; 8983#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); 8986#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 9063#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); 9064#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 9059#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); 9060#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 9048#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 9049#L517-4 lis_~i~0#1 := 1; 9128#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 9127#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; 9125#L521 assume !lis_#t~short11#1; 9124#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; 9123#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 9122#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 9121#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 9120#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 9119#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; 9118#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; 9112#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); 9110#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8999#L520-3 [2021-12-07 00:29:10,010 INFO L793 eck$LassoCheckResult]: Loop: 8999#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; 9332#L521 assume !lis_#t~short11#1; 9335#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; 8965#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8999#L520-3 [2021-12-07 00:29:10,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:29:10,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1428298962, now seen corresponding path program 4 times [2021-12-07 00:29:10,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:29:10,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337381068] [2021-12-07 00:29:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:29:10,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:29:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:29:10,029 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:29:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:29:10,044 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:29:10,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:29:10,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2560232, now seen corresponding path program 1 times [2021-12-07 00:29:10,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:29:10,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411871584] [2021-12-07 00:29:10,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:29:10,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:29:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:29:10,048 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:29:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:29:10,051 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:29:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:29:10,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1976931733, now seen corresponding path program 5 times [2021-12-07 00:29:10,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:29:10,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943710585] [2021-12-07 00:29:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:29:10,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:29:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:29:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-07 00:29:10,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:29:10,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943710585] [2021-12-07 00:29:10,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943710585] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:29:10,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574279785] [2021-12-07 00:29:10,359 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-07 00:29:10,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:29:10,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:29:10,359 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:29:10,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7b03571-a784-4a9e-9a13-0cfb150d55d4/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2021-12-07 00:29:10,690 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-07 00:29:10,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-07 00:29:10,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 88 conjunts are in the unsatisfiable core [2021-12-07 00:29:10,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:29:10,703 INFO L388 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 6 treesize of output 5 [2021-12-07 00:29:10,739 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 00:29:10,739 INFO L388 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 11 treesize of output 11 [2021-12-07 00:29:10,778 INFO L354 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2021-12-07 00:29:10,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 59 [2021-12-07 00:29:10,783 INFO L388 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 [2021-12-07 00:29:10,788 INFO L388 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 [2021-12-07 00:29:10,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-12-07 00:29:10,806 INFO L388 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 17 treesize of output 11 [2021-12-07 00:29:10,820 INFO L388 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 31 treesize of output 15 [2021-12-07 00:29:10,901 INFO L354 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2021-12-07 00:29:10,901 INFO L388 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 65 [2021-12-07 00:29:10,907 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:29:10,908 INFO L388 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 36 treesize of output 38 [2021-12-07 00:29:10,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:29:10,927 INFO L388 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 29 [2021-12-07 00:29:11,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:29:11,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:29:11,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:29:11,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:29:11,015 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-07 00:29:11,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 41 [2021-12-07 00:29:11,760 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-07 00:29:11,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 85 [2021-12-07 00:29:11,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:29:11,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 00:29:11,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 00:29:11,768 INFO L388 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2021-12-07 00:29:11,849 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:29:11,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2021-12-07 00:29:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 00:29:11,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:29:13,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1591 Int) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1588 Int)) (let ((.cse1 (let ((.cse8 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse7 (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| v_ArrVal_1589) |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse8) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse8) v_ArrVal_1588)))) (store .cse9 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse9 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse8 4) 1))))) (store .cse7 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse7 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse8 4) v_ArrVal_1591)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_lis_~a#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_lis_~a#1.offset| 8)) (.cse4 (select .cse2 |c_ULTIMATE.start_lis_~a#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_lis_~a#1.offset| 4))) (or (< v_ArrVal_1588 |c_ULTIMATE.start_lis_~i~0#1|) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|))) (<= (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1) (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)))) (<= (select .cse2 .cse3) .cse4) (let ((.cse5 (select (store (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_lis_~a#1.base|))) (< (select .cse5 .cse6) (select .cse5 .cse3))) (< .cse4 (select .cse2 .cse6)) (< v_ArrVal_1591 (+ |c_ULTIMATE.start_lis_~i~0#1| 1))))))) is different from false [2021-12-07 00:29:13,812 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1591 Int) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1588 Int)) (let ((.cse5 (let ((.cse8 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse7 (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| v_ArrVal_1589) |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select (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|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse8 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse8 4) v_ArrVal_1588)))) (store .cse9 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse9 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse8 8) 1))))) (store .cse7 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse7 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse8 8) v_ArrVal_1591)))))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_lis_~a#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_lis_~a#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_lis_~a#1.offset| 8)) (.cse0 (select .cse1 |c_ULTIMATE.start_lis_~a#1.offset|))) (or (< v_ArrVal_1591 (+ |c_ULTIMATE.start_lis_~i~0#1| 2)) (< .cse0 (select .cse1 .cse2)) (let ((.cse3 (select (store (store .cse5 |c_ULTIMATE.start_lis_~best~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_lis_~a#1.base|))) (< (select .cse3 .cse2) (select .cse3 .cse4))) (< v_ArrVal_1588 (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (<= (select .cse1 .cse4) .cse0) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_lis_~best~0#1.base|))) (<= (+ (select .cse6 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1) (select .cse6 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8))))))))) is different from false [2021-12-07 00:30:07,919 WARN L227 SmtUtils]: Spent 5.79s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-07 00:30:07,920 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 00:30:08,254 INFO L388 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 4214239420309 treesize of output 4210582620833