./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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:28:43,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:28:43,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:28:43,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:28:43,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:28:43,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:28:43,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:28:43,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:28:43,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:28:43,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:28:43,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:28:43,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:28:43,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:28:43,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:28:43,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:28:43,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:28:43,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:28:43,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:28:43,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:28:43,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:28:43,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:28:43,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:28:43,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:28:43,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:28:43,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:28:43,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:28:43,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:28:43,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:28:43,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:28:43,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:28:43,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:28:43,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:28:43,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:28:43,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:28:43,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:28:43,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:28:43,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:28:43,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:28:43,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:28:43,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:28:43,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:28:43,160 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-16 11:28:43,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:28:43,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:28:43,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:28:43,229 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:28:43,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:28:43,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:28:43,231 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:28:43,232 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-16 11:28:43,232 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-16 11:28:43,232 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-16 11:28:43,233 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-16 11:28:43,234 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-16 11:28:43,234 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-16 11:28:43,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:28:43,234 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:28:43,234 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:28:43,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:28:43,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:28:43,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:28:43,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-16 11:28:43,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-16 11:28:43,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-16 11:28:43,236 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:28:43,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:28:43,238 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-16 11:28:43,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:28:43,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-16 11:28:43,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:28:43,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:28:43,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:28:43,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:28:43,241 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-16 11:28:43,241 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_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/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_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2022-11-16 11:28:43,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:28:43,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:28:43,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:28:43,554 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:28:43,555 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:28:43,557 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-11-16 11:28:43,646 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/data/d268151a2/7966f301879e4689aba39ac8acc08530/FLAG0a1363a10 [2022-11-16 11:28:44,246 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:28:44,247 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-11-16 11:28:44,270 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/data/d268151a2/7966f301879e4689aba39ac8acc08530/FLAG0a1363a10 [2022-11-16 11:28:44,506 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/data/d268151a2/7966f301879e4689aba39ac8acc08530 [2022-11-16 11:28:44,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:28:44,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:28:44,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:28:44,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:28:44,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:28:44,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:28:44" (1/1) ... [2022-11-16 11:28:44,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37bbd17c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:44, skipping insertion in model container [2022-11-16 11:28:44,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:28:44" (1/1) ... [2022-11-16 11:28:44,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:28:44,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:28:45,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:28:45,059 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:28:45,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:28:45,169 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:28:45,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45 WrapperNode [2022-11-16 11:28:45,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:28:45,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:28:45,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:28:45,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:28:45,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45" (1/1) ... [2022-11-16 11:28:45,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45" (1/1) ... [2022-11-16 11:28:45,238 INFO L138 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2022-11-16 11:28:45,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:28:45,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:28:45,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:28:45,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:28:45,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45" (1/1) ... [2022-11-16 11:28:45,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45" (1/1) ... [2022-11-16 11:28:45,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45" (1/1) ... [2022-11-16 11:28:45,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45" (1/1) ... [2022-11-16 11:28:45,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45" (1/1) ... [2022-11-16 11:28:45,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45" (1/1) ... [2022-11-16 11:28:45,300 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45" (1/1) ... [2022-11-16 11:28:45,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45" (1/1) ... [2022-11-16 11:28:45,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:28:45,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:28:45,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:28:45,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:28:45,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45" (1/1) ... [2022-11-16 11:28:45,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:45,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:45,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:45,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-16 11:28:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:28:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:28:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:28:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:28:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:28:45,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:28:45,549 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:28:45,552 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:28:45,782 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:28:45,789 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:28:45,790 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-16 11:28:45,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:28:45 BoogieIcfgContainer [2022-11-16 11:28:45,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:28:45,793 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-16 11:28:45,794 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-16 11:28:45,799 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-16 11:28:45,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:28:45,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 11:28:44" (1/3) ... [2022-11-16 11:28:45,801 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6aa1b539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:28:45, skipping insertion in model container [2022-11-16 11:28:45,801 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:28:45,802 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:45" (2/3) ... [2022-11-16 11:28:45,802 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6aa1b539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:28:45, skipping insertion in model container [2022-11-16 11:28:45,802 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:28:45,802 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:28:45" (3/3) ... [2022-11-16 11:28:45,804 INFO L332 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2022-11-16 11:28:45,868 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-16 11:28:45,872 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-16 11:28:45,873 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-16 11:28:45,873 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-16 11:28:45,886 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-16 11:28:45,886 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-16 11:28:45,886 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-16 11:28:45,887 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-16 11:28:45,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:45,937 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2022-11-16 11:28:45,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:28:45,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:28:45,967 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-16 11:28:45,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-16 11:28:45,967 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-16 11:28:45,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:45,976 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2022-11-16 11:28:45,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:28:45,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:28:45,977 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-16 11:28:45,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-16 11:28:45,986 INFO L748 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 10#L530true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6#L530-2true call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3#L535-3true [2022-11-16 11:28:45,987 INFO L750 eck$LassoCheckResult]: Loop: 3#L535-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 16#L535-2true main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3#L535-3true [2022-11-16 11:28:45,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:45,994 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-11-16 11:28:46,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:46,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480920031] [2022-11-16 11:28:46,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:46,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:46,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:46,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-11-16 11:28:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:46,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147077514] [2022-11-16 11:28:46,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:46,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:46,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:46,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:46,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:46,205 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-11-16 11:28:46,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:46,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716272717] [2022-11-16 11:28:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:46,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:46,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:46,689 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:28:46,690 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:28:46,690 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:28:46,690 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:28:46,691 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-16 11:28:46,691 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:46,691 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:28:46,691 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:28:46,692 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2022-11-16 11:28:46,692 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:28:46,693 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:28:46,727 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:46,740 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:46,749 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:46,778 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:46,782 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:46,786 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:47,001 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:47,005 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:47,010 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:47,014 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:47,496 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:28:47,501 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-16 11:28:47,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:47,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:47,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:47,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-16 11:28:47,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:47,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:47,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:47,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:47,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:47,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:47,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:47,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:47,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:47,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:47,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:47,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:47,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:47,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-16 11:28:47,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:47,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:47,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:47,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:47,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:47,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:47,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:47,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:47,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:47,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:47,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:47,626 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:47,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-16 11:28:47,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:47,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:47,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:47,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:47,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:47,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:47,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:47,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:47,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:47,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:47,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:47,681 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:47,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:47,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-16 11:28:47,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:47,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:47,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:47,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:47,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:47,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:47,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:47,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:47,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:47,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:47,742 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:47,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-16 11:28:47,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:47,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:47,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:47,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:47,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:47,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:47,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:47,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:47,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:47,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:47,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:47,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:47,794 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:47,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-16 11:28:47,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:47,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:47,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:47,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:47,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:47,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:47,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:47,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:47,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:47,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:47,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:47,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:47,828 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:47,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-16 11:28:47,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:47,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:47,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:47,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:47,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:47,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:47,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:47,943 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-16 11:28:47,976 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-11-16 11:28:47,976 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-11-16 11:28:47,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:47,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:47,987 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:47,998 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-16 11:28:48,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-16 11:28:48,029 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-16 11:28:48,030 INFO L513 LassoAnalysis]: Proved termination. [2022-11-16 11:28:48,030 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~array_size~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~array_size~0#1 Supporting invariants [] [2022-11-16 11:28:48,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:48,058 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-11-16 11:28:48,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:48,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:28:48,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:28:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:48,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:28:48,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:28:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:48,219 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-16 11:28:48,222 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:48,295 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 99 transitions. Complement of second has 7 states. [2022-11-16 11:28:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-16 11:28:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-11-16 11:28:48,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2022-11-16 11:28:48,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:28:48,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2022-11-16 11:28:48,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:28:48,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 4 letters. [2022-11-16 11:28:48,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:28:48,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 99 transitions. [2022-11-16 11:28:48,315 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-16 11:28:48,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 21 states and 30 transitions. [2022-11-16 11:28:48,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-11-16 11:28:48,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-16 11:28:48,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2022-11-16 11:28:48,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:48,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-11-16 11:28:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2022-11-16 11:28:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-16 11:28:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2022-11-16 11:28:48,356 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-11-16 11:28:48,357 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-11-16 11:28:48,357 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-16 11:28:48,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2022-11-16 11:28:48,358 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-16 11:28:48,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:28:48,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:28:48,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:28:48,360 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-16 11:28:48,360 INFO L748 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 159#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 155#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 146#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 148#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 161#L517-3 [2022-11-16 11:28:48,361 INFO L750 eck$LassoCheckResult]: Loop: 161#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 160#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 161#L517-3 [2022-11-16 11:28:48,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-11-16 11:28:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:48,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901061832] [2022-11-16 11:28:48,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:48,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:48,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:48,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901061832] [2022-11-16 11:28:48,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901061832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:48,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:48,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:28:48,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122686687] [2022-11-16 11:28:48,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:48,506 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:28:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2022-11-16 11:28:48,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:48,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024330499] [2022-11-16 11:28:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:48,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:48,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:48,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:48,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:48,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:28:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:28:48,660 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:48,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:48,704 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-11-16 11:28:48,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2022-11-16 11:28:48,706 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-16 11:28:48,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2022-11-16 11:28:48,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-11-16 11:28:48,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-16 11:28:48,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-11-16 11:28:48,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:48,708 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-11-16 11:28:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-11-16 11:28:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-11-16 11:28:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-11-16 11:28:48,711 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-11-16 11:28:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:28:48,716 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-11-16 11:28:48,716 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-16 11:28:48,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2022-11-16 11:28:48,719 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-16 11:28:48,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:28:48,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:28:48,722 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:48,722 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-16 11:28:48,723 INFO L748 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 209#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 205#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 196#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 197#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 198#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 199#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 211#L517-3 [2022-11-16 11:28:48,723 INFO L750 eck$LassoCheckResult]: Loop: 211#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 210#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 211#L517-3 [2022-11-16 11:28:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-11-16 11:28:48,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:48,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240966565] [2022-11-16 11:28:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:48,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:48,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:48,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:48,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:48,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2022-11-16 11:28:48,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:48,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986136189] [2022-11-16 11:28:48,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:48,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:48,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:48,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:48,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:48,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2022-11-16 11:28:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:48,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683175885] [2022-11-16 11:28:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:48,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:48,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:49,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:49,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-11-16 11:28:50,224 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:28:50,225 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:28:50,225 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:28:50,225 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:28:50,225 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-16 11:28:50,225 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:50,225 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:28:50,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:28:50,226 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2022-11-16 11:28:50,226 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:28:50,226 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:28:50,234 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,241 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,245 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,248 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,256 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,260 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,265 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,269 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,273 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,279 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,283 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,287 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,291 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,295 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,299 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,303 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,307 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,309 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,313 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,317 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,320 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,323 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,327 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,331 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:50,336 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:51,318 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:52,473 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:28:52,474 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-16 11:28:52,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:52,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:52,476 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:52,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-16 11:28:52,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:52,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:52,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:52,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:52,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:52,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:52,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:52,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:52,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:52,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:52,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:52,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:52,516 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:52,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:52,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-16 11:28:52,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:52,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:52,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:52,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:52,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:52,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:52,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:52,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:52,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:52,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:52,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:52,564 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:52,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-16 11:28:52,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:52,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:52,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:52,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:52,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:52,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:52,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:52,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:52,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:52,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-11-16 11:28:52,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:52,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:52,616 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:52,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:52,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-16 11:28:52,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:52,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:52,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:52,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:52,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:52,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:52,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:52,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:52,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:52,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:52,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:52,663 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:52,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-16 11:28:52,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:52,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:52,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:52,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:52,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:52,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:52,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:52,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:52,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:52,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:52,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:52,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:52,712 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:52,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:52,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-16 11:28:52,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:52,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:52,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:52,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:52,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:52,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:52,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:52,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:52,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:52,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:52,765 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:52,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:52,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-16 11:28:52,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:52,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:52,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:52,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:52,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:52,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:52,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:52,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:52,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:52,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:52,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:52,800 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:52,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:52,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-16 11:28:52,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:52,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:52,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:52,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:52,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:52,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:52,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:52,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:52,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:52,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:52,845 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:52,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:52,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-16 11:28:52,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:52,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:52,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:52,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:52,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:52,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:52,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:52,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:52,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:52,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:52,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:52,896 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:52,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:52,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:52,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:52,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:52,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:52,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:52,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:52,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:52,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-16 11:28:52,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:52,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:52,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:52,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:52,982 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:53,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:53,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:53,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-16 11:28:53,026 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,036 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-16 11:28:53,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:53,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:53,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:53,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,096 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-16 11:28:53,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 [2022-11-16 11:28:53,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:53,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:53,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,133 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-16 11:28:53,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:53,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:53,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:53,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,175 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-16 11:28:53,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:53,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:53,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:53,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,198 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-16 11:28:53,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:53,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:53,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,255 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-16 11:28:53,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:53,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:53,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:53,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,300 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:53,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:53,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:53,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-16 11:28:53,332 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,341 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-16 11:28:53,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:53,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:53,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,401 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-16 11:28:53,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:53,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:53,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:53,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,440 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-16 11:28:53,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:53,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:53,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:53,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-11-16 11:28:53,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,483 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-16 11:28:53,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:53,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:53,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:53,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-11-16 11:28:53,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,505 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-16 11:28:53,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:53,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:53,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:53,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,543 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-16 11:28:53,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:53,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:53,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,597 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-16 11:28:53,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:53,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:53,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,652 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:53,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:53,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:53,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-16 11:28:53,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,693 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:53,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:53,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:53,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-16 11:28:53,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,744 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-16 11:28:53,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:53,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:53,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,802 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-16 11:28:53,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:53,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:53,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,852 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,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 [2022-11-16 11:28:53,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-16 11:28:53,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:53,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:53,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,888 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-16 11:28:53,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:53,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:53,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:28:53,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:53,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:53,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:53,935 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:53,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:53,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-16 11:28:53,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:53,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:53,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:53,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:53,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:28:53,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:28:54,005 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-16 11:28:54,067 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-11-16 11:28:54,067 INFO L444 ModelExtractionUtils]: 9 out of 61 variables were initially zero. Simplification set additionally 48 variables to zero. [2022-11-16 11:28:54,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:54,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:54,069 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:54,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-16 11:28:54,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-16 11:28:54,097 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-16 11:28:54,097 INFO L513 LassoAnalysis]: Proved termination. [2022-11-16 11:28:54,098 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~best~0#1.offset, ULTIMATE.start_lis_~i~0#1, v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_1) = -1*ULTIMATE.start_lis_~best~0#1.offset - 4*ULTIMATE.start_lis_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_1 Supporting invariants [] [2022-11-16 11:28:54,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:54,198 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2022-11-16 11:28:54,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:54,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:28:54,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:28:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:54,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:28:54,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:28:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:54,323 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-16 11:28:54,323 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:54,364 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 35 transitions. Complement of second has 7 states. [2022-11-16 11:28:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-16 11:28:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-11-16 11:28:54,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2022-11-16 11:28:54,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:28:54,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2022-11-16 11:28:54,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:28:54,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2022-11-16 11:28:54,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:28:54,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2022-11-16 11:28:54,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-16 11:28:54,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2022-11-16 11:28:54,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-11-16 11:28:54,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-11-16 11:28:54,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2022-11-16 11:28:54,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:28:54,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-11-16 11:28:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2022-11-16 11:28:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-16 11:28:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2022-11-16 11:28:54,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-11-16 11:28:54,371 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-11-16 11:28:54,371 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-16 11:28:54,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2022-11-16 11:28:54,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-16 11:28:54,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:28:54,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:28:54,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:54,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:28:54,373 INFO L748 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 388#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 396#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 392#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 383#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 384#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 385#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 386#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 403#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 404#L517-4 lis_~i~0#1 := 1; 395#L519-3 [2022-11-16 11:28:54,373 INFO L750 eck$LassoCheckResult]: Loop: 395#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 389#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 390#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 395#L519-3 [2022-11-16 11:28:54,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:54,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2022-11-16 11:28:54,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:54,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944860323] [2022-11-16 11:28:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:54,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:28:54,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:54,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944860323] [2022-11-16 11:28:54,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944860323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:54,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:54,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:28:54,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591481324] [2022-11-16 11:28:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:54,475 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:28:54,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2022-11-16 11:28:54,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:54,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550833714] [2022-11-16 11:28:54,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:54,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:54,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:54,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:54,504 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:28:54,505 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:28:54,505 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:28:54,505 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:28:54,505 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-16 11:28:54,505 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:54,505 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:28:54,506 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:28:54,506 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2022-11-16 11:28:54,506 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:28:54,506 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:28:54,507 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:54,516 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:54,518 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:54,520 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:54,523 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:54,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:54,600 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:28:54,600 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-16 11:28:54,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:54,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:54,603 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:54,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-16 11:28:54,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:28:54,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-16 11:28:54,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:54,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:54,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:54,647 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:54,651 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-16 11:28:54,651 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:28:54,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-16 11:28:54,800 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-16 11:28:54,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-11-16 11:28:54,803 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:28:54,804 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:28:54,804 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:28:54,804 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:28:54,804 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-16 11:28:54,804 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:54,804 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:28:54,804 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:28:54,804 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2022-11-16 11:28:54,804 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:28:54,804 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:28:54,806 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:54,822 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:54,826 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:54,829 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:54,833 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:28:54,891 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:28:54,891 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-16 11:28:54,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:54,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:54,893 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:54,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:28:54,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:28:54,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:28:54,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:28:54,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:28:54,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:28:54,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:28:54,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:28:54,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-16 11:28:54,927 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-16 11:28:54,932 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-16 11:28:54,932 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-16 11:28:54,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:28:54,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:54,933 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:54,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-16 11:28:54,938 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-16 11:28:54,938 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-16 11:28:54,938 INFO L513 LassoAnalysis]: Proved termination. [2022-11-16 11:28:54,938 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [] [2022-11-16 11:28:54,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-11-16 11:28:54,941 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-16 11:28:54,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:54,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:28:54,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:28:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:55,017 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:28:55,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:28:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:55,059 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-11-16 11:28:55,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:55,133 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 67 transitions. Complement of second has 9 states. [2022-11-16 11:28:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-11-16 11:28:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-11-16 11:28:55,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2022-11-16 11:28:55,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:28:55,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2022-11-16 11:28:55,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:28:55,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2022-11-16 11:28:55,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:28:55,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2022-11-16 11:28:55,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-11-16 11:28:55,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2022-11-16 11:28:55,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-16 11:28:55,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-11-16 11:28:55,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2022-11-16 11:28:55,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:28:55,139 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2022-11-16 11:28:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2022-11-16 11:28:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2022-11-16 11:28:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2022-11-16 11:28:55,142 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 50 transitions. [2022-11-16 11:28:55,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:55,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:28:55,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:28:55,143 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:55,191 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2022-11-16 11:28:55,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2022-11-16 11:28:55,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-16 11:28:55,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2022-11-16 11:28:55,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-11-16 11:28:55,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-11-16 11:28:55,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2022-11-16 11:28:55,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:28:55,194 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-11-16 11:28:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2022-11-16 11:28:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-11-16 11:28:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2022-11-16 11:28:55,197 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-11-16 11:28:55,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:28:55,198 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-11-16 11:28:55,198 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-16 11:28:55,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2022-11-16 11:28:55,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-16 11:28:55,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:28:55,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:28:55,200 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:55,200 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:55,200 INFO L748 eck$LassoCheckResult]: Stem: 588#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 604#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 595#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 584#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 585#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 586#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 587#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 613#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 605#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 606#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 614#L517-4 lis_~i~0#1 := 1; 615#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 590#L520-3 [2022-11-16 11:28:55,201 INFO L750 eck$LassoCheckResult]: Loop: 590#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 591#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 596#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 597#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 607#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 600#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 601#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 590#L520-3 [2022-11-16 11:28:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2022-11-16 11:28:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:55,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853125627] [2022-11-16 11:28:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:28:55,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:55,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853125627] [2022-11-16 11:28:55,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853125627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:28:55,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391668051] [2022-11-16 11:28:55,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:55,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:28:55,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:55,382 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:28:55,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-16 11:28:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:55,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:28:55,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:28:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:28:55,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:28:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:28:55,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391668051] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:28:55,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:28:55,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-11-16 11:28:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214776248] [2022-11-16 11:28:55,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:28:55,588 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:28:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2022-11-16 11:28:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:55,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517977217] [2022-11-16 11:28:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:55,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:55,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:55,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:28:55,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:28:55,824 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:56,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:56,080 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2022-11-16 11:28:56,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 109 transitions. [2022-11-16 11:28:56,081 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-11-16 11:28:56,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 81 transitions. [2022-11-16 11:28:56,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-11-16 11:28:56,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-11-16 11:28:56,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2022-11-16 11:28:56,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:28:56,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 81 transitions. [2022-11-16 11:28:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2022-11-16 11:28:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2022-11-16 11:28:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-11-16 11:28:56,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-11-16 11:28:56,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:28:56,087 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-11-16 11:28:56,087 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-16 11:28:56,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2022-11-16 11:28:56,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-16 11:28:56,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:28:56,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:28:56,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:56,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:56,089 INFO L748 eck$LassoCheckResult]: Stem: 800#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 801#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 816#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 807#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 796#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 797#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 798#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 799#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 831#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 826#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 827#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 817#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 818#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 830#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 832#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 828#L517-4 lis_~i~0#1 := 1; 820#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 802#L520-3 [2022-11-16 11:28:56,089 INFO L750 eck$LassoCheckResult]: Loop: 802#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 803#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 808#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 809#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 819#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 812#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 813#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 802#L520-3 [2022-11-16 11:28:56,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2022-11-16 11:28:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:56,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672370081] [2022-11-16 11:28:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:56,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:56,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:56,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:56,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2022-11-16 11:28:56,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:56,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218562737] [2022-11-16 11:28:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:56,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:56,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:56,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2022-11-16 11:28:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:56,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298037622] [2022-11-16 11:28:56,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:56,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:56,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-11-16 11:28:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:28:56,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:56,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298037622] [2022-11-16 11:28:56,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298037622] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:28:56,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718355065] [2022-11-16 11:28:56,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:56,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:28:56,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:56,439 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:28:56,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-11-16 11:28:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:56,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:28:56,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:28:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:28:56,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:28:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:28:56,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718355065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:28:56,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:28:56,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-11-16 11:28:56,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684414453] [2022-11-16 11:28:56,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:28:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:57,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:28:57,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:28:57,014 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 19 Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:57,195 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-11-16 11:28:57,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 92 transitions. [2022-11-16 11:28:57,196 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2022-11-16 11:28:57,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 83 transitions. [2022-11-16 11:28:57,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-11-16 11:28:57,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-11-16 11:28:57,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 83 transitions. [2022-11-16 11:28:57,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:28:57,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-11-16 11:28:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 83 transitions. [2022-11-16 11:28:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-11-16 11:28:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 54 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2022-11-16 11:28:57,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 75 transitions. [2022-11-16 11:28:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:28:57,202 INFO L428 stractBuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2022-11-16 11:28:57,203 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-16 11:28:57,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2022-11-16 11:28:57,203 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-11-16 11:28:57,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:28:57,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:28:57,204 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:57,204 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-16 11:28:57,205 INFO L748 eck$LassoCheckResult]: Stem: 1071#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1072#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1086#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1078#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1067#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1068#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1069#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1070#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1115#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1097#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1098#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1087#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1088#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1101#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1105#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1099#L517-4 lis_~i~0#1 := 1; 1100#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1109#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1093#L521 [2022-11-16 11:28:57,205 INFO L750 eck$LassoCheckResult]: Loop: 1093#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1079#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1080#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1092#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1093#L521 [2022-11-16 11:28:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1159051365, now seen corresponding path program 1 times [2022-11-16 11:28:57,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:57,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689683022] [2022-11-16 11:28:57,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:57,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:57,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:57,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:57,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2655420, now seen corresponding path program 1 times [2022-11-16 11:28:57,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:57,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270422712] [2022-11-16 11:28:57,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:57,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:57,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:57,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash -651990240, now seen corresponding path program 1 times [2022-11-16 11:28:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:57,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654229074] [2022-11-16 11:28:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:28:57,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:57,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654229074] [2022-11-16 11:28:57,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654229074] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:28:57,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212797224] [2022-11-16 11:28:57,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:57,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:28:57,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:57,407 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:28:57,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-16 11:28:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:57,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:28:57,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:28:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:28:57,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:28:57,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212797224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:57,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:28:57,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-11-16 11:28:57,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321145436] [2022-11-16 11:28:57,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:57,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:57,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:28:57,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:28:57,859 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 27 Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:57,939 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-11-16 11:28:57,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2022-11-16 11:28:57,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-16 11:28:57,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2022-11-16 11:28:57,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-11-16 11:28:57,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-11-16 11:28:57,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2022-11-16 11:28:57,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:28:57,942 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-11-16 11:28:57,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2022-11-16 11:28:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2022-11-16 11:28:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.375) internal successors, (88), 63 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2022-11-16 11:28:57,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 88 transitions. [2022-11-16 11:28:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:28:57,948 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2022-11-16 11:28:57,949 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-16 11:28:57,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 88 transitions. [2022-11-16 11:28:57,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-16 11:28:57,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:28:57,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:28:57,951 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:57,951 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:28:57,951 INFO L748 eck$LassoCheckResult]: Stem: 1274#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1289#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1281#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1270#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1271#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1272#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1273#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1319#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1306#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1307#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1310#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1311#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1290#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1291#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1308#L517-4 lis_~i~0#1 := 1; 1292#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1293#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1332#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1314#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 1309#L519-4 lis_~i~0#1 := 0; 1303#L523-3 [2022-11-16 11:28:57,952 INFO L750 eck$LassoCheckResult]: Loop: 1303#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 1304#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 1305#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 1303#L523-3 [2022-11-16 11:28:57,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2057131266, now seen corresponding path program 1 times [2022-11-16 11:28:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:57,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865018240] [2022-11-16 11:28:57,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:57,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:28:58,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:58,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865018240] [2022-11-16 11:28:58,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865018240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:58,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:58,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:28:58,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730622762] [2022-11-16 11:28:58,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:58,022 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:28:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:58,023 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2022-11-16 11:28:58,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:58,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871776690] [2022-11-16 11:28:58,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:58,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:58,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:58,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:58,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:58,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:28:58,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:28:58,090 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. cyclomatic complexity: 30 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:58,139 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2022-11-16 11:28:58,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2022-11-16 11:28:58,140 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-16 11:28:58,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 88 transitions. [2022-11-16 11:28:58,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-16 11:28:58,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-16 11:28:58,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 88 transitions. [2022-11-16 11:28:58,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:28:58,141 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-11-16 11:28:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 88 transitions. [2022-11-16 11:28:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-11-16 11:28:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.34375) internal successors, (86), 63 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2022-11-16 11:28:58,145 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-11-16 11:28:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:28:58,146 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-11-16 11:28:58,146 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-16 11:28:58,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 86 transitions. [2022-11-16 11:28:58,147 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-16 11:28:58,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:28:58,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:28:58,148 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:58,148 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:58,148 INFO L748 eck$LassoCheckResult]: Stem: 1412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1413#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1425#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1418#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1408#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1409#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1410#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1411#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1462#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1458#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1457#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1459#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1443#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1426#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1427#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1456#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1455#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1454#L517-4 lis_~i~0#1 := 1; 1452#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1453#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1433#L521 assume !lis_#t~short11#1; 1419#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1420#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1414#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1415#L519-2 [2022-11-16 11:28:58,148 INFO L750 eck$LassoCheckResult]: Loop: 1415#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1423#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1447#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1464#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1466#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1465#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1463#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1415#L519-2 [2022-11-16 11:28:58,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:58,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1034472260, now seen corresponding path program 1 times [2022-11-16 11:28:58,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:58,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971741005] [2022-11-16 11:28:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 11:28:58,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:58,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971741005] [2022-11-16 11:28:58,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971741005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:58,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:58,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:28:58,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074591598] [2022-11-16 11:28:58,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:58,193 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:28:58,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:58,194 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 3 times [2022-11-16 11:28:58,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:58,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599817593] [2022-11-16 11:28:58,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:58,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:58,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:58,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:58,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:58,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:58,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:58,442 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:58,458 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2022-11-16 11:28:58,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2022-11-16 11:28:58,459 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-16 11:28:58,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2022-11-16 11:28:58,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-11-16 11:28:58,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-11-16 11:28:58,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2022-11-16 11:28:58,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:28:58,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-16 11:28:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2022-11-16 11:28:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-16 11:28:58,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.318840579710145) internal successors, (91), 68 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2022-11-16 11:28:58,464 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-16 11:28:58,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:58,472 INFO L428 stractBuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-16 11:28:58,473 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-16 11:28:58,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2022-11-16 11:28:58,474 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-16 11:28:58,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:28:58,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:28:58,475 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:58,476 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:58,476 INFO L748 eck$LassoCheckResult]: Stem: 1551#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1552#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1566#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1557#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1547#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1548#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1549#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1550#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1599#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1600#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1601#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1580#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1581#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1597#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1596#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1595#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1594#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1593#L517-4 lis_~i~0#1 := 1; 1591#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1592#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1615#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1613#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1612#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1602#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1562#L519-2 [2022-11-16 11:28:58,477 INFO L750 eck$LassoCheckResult]: Loop: 1562#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1563#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1553#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1554#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1574#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1559#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1572#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1562#L519-2 [2022-11-16 11:28:58,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:58,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2022-11-16 11:28:58,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:58,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683168778] [2022-11-16 11:28:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:58,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:28:58,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:58,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683168778] [2022-11-16 11:28:58,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683168778] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:28:58,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634493776] [2022-11-16 11:28:58,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:58,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:28:58,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:58,719 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:28:58,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-16 11:28:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:58,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:28:58,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:28:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:28:58,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:28:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:28:59,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634493776] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:28:59,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:28:59,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-16 11:28:59,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435566223] [2022-11-16 11:28:59,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:28:59,042 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:28:59,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 4 times [2022-11-16 11:28:59,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:59,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201818042] [2022-11-16 11:28:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:59,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:59,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:59,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:59,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:28:59,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:28:59,290 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. cyclomatic complexity: 28 Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:59,530 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2022-11-16 11:28:59,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 99 transitions. [2022-11-16 11:28:59,531 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-11-16 11:28:59,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 99 transitions. [2022-11-16 11:28:59,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-11-16 11:28:59,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-11-16 11:28:59,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 99 transitions. [2022-11-16 11:28:59,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:28:59,532 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-11-16 11:28:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 99 transitions. [2022-11-16 11:28:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-11-16 11:28:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-11-16 11:28:59,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-11-16 11:28:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:28:59,545 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-11-16 11:28:59,545 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-16 11:28:59,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2022-11-16 11:28:59,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-16 11:28:59,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:28:59,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:28:59,546 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:59,547 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-16 11:28:59,547 INFO L748 eck$LassoCheckResult]: Stem: 1863#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1864#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1878#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1869#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1859#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1860#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1861#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1862#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1902#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1904#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1914#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1913#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1912#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1911#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1910#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1898#L517-4 lis_~i~0#1 := 1; 1881#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1882#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1889#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1890#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1871#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1927#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1926#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1919#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 1899#L519-4 lis_~i~0#1 := 0; 1893#L523-3 [2022-11-16 11:28:59,547 INFO L750 eck$LassoCheckResult]: Loop: 1893#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 1894#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 1895#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 1893#L523-3 [2022-11-16 11:28:59,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:59,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2022-11-16 11:28:59,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:59,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384179504] [2022-11-16 11:28:59,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:59,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:59,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:59,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:59,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 2 times [2022-11-16 11:28:59,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:59,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908255609] [2022-11-16 11:28:59,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:59,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:59,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:59,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:59,681 INFO L85 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2022-11-16 11:28:59,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:59,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457441796] [2022-11-16 11:28:59,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:59,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:59,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:59,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:29:05,422 WARN L233 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 261 DAG size of output: 187 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:29:07,338 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:29:07,339 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:29:07,339 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:29:07,339 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:29:07,339 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-16 11:29:07,339 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:07,339 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:29:07,339 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:29:07,339 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration11_Lasso [2022-11-16 11:29:07,339 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:29:07,339 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:29:07,346 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:07,349 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:07,350 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:07,352 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:07,354 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:07,359 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:07,362 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:07,365 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:07,367 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:07,369 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:07,372 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,938 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,940 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,945 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,948 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,951 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,953 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,955 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,960 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,963 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,966 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,969 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,971 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:09,973 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:11,190 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:29:11,191 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-16 11:29:11,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,210 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:11,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-11-16 11:29:11,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:11,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:29:11,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:11,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:11,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:11,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:29:11,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:29:11,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:11,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:11,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,259 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:11,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-11-16 11:29:11,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:11,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:29:11,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:11,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:11,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:11,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:29:11,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:29:11,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:11,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:11,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,303 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:11,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-11-16 11:29:11,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:11,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:29:11,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:11,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:11,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:11,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:29:11,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:29:11,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:11,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:11,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,348 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:11,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-11-16 11:29:11,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:11,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:29:11,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:11,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:11,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:11,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:29:11,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:29:11,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:11,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:11,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,398 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-11-16 11:29:11,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:11,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:11,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:11,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:11,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:11,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:29:11,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:29:11,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:11,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-11-16 11:29:11,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,428 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-11-16 11:29:11,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:11,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:11,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:29:11,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:11,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:11,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:11,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:29:11,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:29:11,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:11,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:11,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,454 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-11-16 11:29:11,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:11,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:11,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:11,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:11,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:11,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:29:11,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:29:11,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:11,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-11-16 11:29:11,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,480 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-11-16 11:29:11,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:11,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:11,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:29:11,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:11,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:11,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:11,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:29:11,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:29:11,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:11,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-11-16 11:29:11,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,505 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-11-16 11:29:11,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:11,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:11,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:29:11,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:11,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:11,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:11,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:29:11,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:29:11,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:11,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-11-16 11:29:11,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,536 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-11-16 11:29:11,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:11,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:11,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:29:11,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:11,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:11,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:11,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:29:11,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:29:11,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:11,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-11-16 11:29:11,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,557 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-11-16 11:29:11,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:11,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:11,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:11,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:11,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:11,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:29:11,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:29:11,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:11,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-11-16 11:29:11,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,586 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-11-16 11:29:11,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:11,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:11,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:11,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:11,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:11,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:29:11,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:29:11,670 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-16 11:29:11,762 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-11-16 11:29:11,762 INFO L444 ModelExtractionUtils]: 10 out of 67 variables were initially zero. Simplification set additionally 54 variables to zero. [2022-11-16 11:29:11,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:11,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:11,770 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:11,775 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-16 11:29:11,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-11-16 11:29:11,812 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-16 11:29:11,812 INFO L513 LassoAnalysis]: Proved termination. [2022-11-16 11:29:11,813 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~N#1, ULTIMATE.start_lis_~i~0#1) = 1*ULTIMATE.start_lis_~N#1 - 1*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2022-11-16 11:29:11,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:12,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:12,234 INFO L156 tatePredicateManager]: 45 out of 45 supporting invariants were superfluous and have been removed [2022-11-16 11:29:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:29:12,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:29:12,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:29:12,399 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-16 11:29:12,399 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 93 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:12,423 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 93 transitions. cyclomatic complexity: 28. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 74 states and 98 transitions. Complement of second has 4 states. [2022-11-16 11:29:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-11-16 11:29:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-11-16 11:29:12,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 25 letters. Loop has 3 letters. [2022-11-16 11:29:12,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:29:12,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 28 letters. Loop has 3 letters. [2022-11-16 11:29:12,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:29:12,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 25 letters. Loop has 6 letters. [2022-11-16 11:29:12,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:29:12,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2022-11-16 11:29:12,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-16 11:29:12,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 51 states and 66 transitions. [2022-11-16 11:29:12,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-16 11:29:12,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-11-16 11:29:12,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2022-11-16 11:29:12,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:29:12,433 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-11-16 11:29:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2022-11-16 11:29:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-16 11:29:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 50 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2022-11-16 11:29:12,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-11-16 11:29:12,450 INFO L428 stractBuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-11-16 11:29:12,450 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-16 11:29:12,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 66 transitions. [2022-11-16 11:29:12,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-16 11:29:12,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:29:12,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:29:12,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:29:12,453 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:29:12,453 INFO L748 eck$LassoCheckResult]: Stem: 2291#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2306#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2297#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2287#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2288#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2289#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2290#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2327#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2324#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2323#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2318#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2319#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2307#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2308#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2322#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2328#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2326#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2325#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2320#L517-4 lis_~i~0#1 := 1; 2321#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2331#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2335#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2330#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2299#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2311#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2302#L519-2 [2022-11-16 11:29:12,456 INFO L750 eck$LassoCheckResult]: Loop: 2302#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2303#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2293#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2294#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2314#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2333#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2332#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2302#L519-2 [2022-11-16 11:29:12,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:12,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2022-11-16 11:29:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:12,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929395058] [2022-11-16 11:29:12,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:12,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:29:12,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:29:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:29:12,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:29:12,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 5 times [2022-11-16 11:29:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:12,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703307249] [2022-11-16 11:29:12,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:29:12,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:29:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:29:12,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:29:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1635630457, now seen corresponding path program 1 times [2022-11-16 11:29:12,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:12,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025547027] [2022-11-16 11:29:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 11:29:12,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:12,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025547027] [2022-11-16 11:29:12,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025547027] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:29:12,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221168610] [2022-11-16 11:29:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:12,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:29:12,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:12,787 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:29:12,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-11-16 11:29:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:12,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:29:12,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 11:29:13,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:29:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 11:29:13,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221168610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:29:13,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:29:13,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-16 11:29:13,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792223126] [2022-11-16 11:29:13,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:29:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:13,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:29:13,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:29:13,317 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. cyclomatic complexity: 19 Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:29:13,425 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-11-16 11:29:13,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 90 transitions. [2022-11-16 11:29:13,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-11-16 11:29:13,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 56 transitions. [2022-11-16 11:29:13,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-11-16 11:29:13,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-11-16 11:29:13,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2022-11-16 11:29:13,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:29:13,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-11-16 11:29:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2022-11-16 11:29:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-11-16 11:29:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-11-16 11:29:13,430 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-11-16 11:29:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:29:13,431 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-11-16 11:29:13,432 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-16 11:29:13,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2022-11-16 11:29:13,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-16 11:29:13,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:29:13,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:29:13,433 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:29:13,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-11-16 11:29:13,434 INFO L748 eck$LassoCheckResult]: Stem: 2622#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2623#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2632#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2626#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2618#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2619#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2620#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2621#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2631#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2647#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2646#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2639#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2640#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2633#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2634#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2642#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2645#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2644#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2643#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2641#L517-4 lis_~i~0#1 := 1; 2635#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2636#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2657#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2655#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2654#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2648#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2629#L519-2 [2022-11-16 11:29:13,434 INFO L750 eck$LassoCheckResult]: Loop: 2629#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2630#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2653#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2652#L521 assume !lis_#t~short11#1; 2650#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2637#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2624#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2625#L521 assume !lis_#t~short11#1; 2627#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2628#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2649#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2629#L519-2 [2022-11-16 11:29:13,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:13,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 3 times [2022-11-16 11:29:13,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:13,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909018286] [2022-11-16 11:29:13,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:13,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:29:13,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:29:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:29:13,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:29:13,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:13,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1752732867, now seen corresponding path program 1 times [2022-11-16 11:29:13,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:13,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868124837] [2022-11-16 11:29:13,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:13,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:29:13,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:29:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:29:13,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:29:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash 117015998, now seen corresponding path program 1 times [2022-11-16 11:29:13,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:13,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506238525] [2022-11-16 11:29:13,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:13,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:29:13,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:29:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:29:13,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:29:27,051 WARN L233 SmtUtils]: Spent 13.14s on a formula simplification. DAG size of input: 290 DAG size of output: 205 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:29:31,940 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:29:31,940 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:29:31,940 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:29:31,940 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:29:31,940 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-16 11:29:31,940 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:31,940 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:29:31,940 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:29:31,940 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration13_Lasso [2022-11-16 11:29:31,940 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:29:31,940 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:29:31,945 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:31,949 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:31,952 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:31,955 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:31,958 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:31,961 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:31,965 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,276 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,280 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,288 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,290 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,294 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,297 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,300 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,303 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,305 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,309 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,312 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,315 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,317 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,321 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,324 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,327 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,330 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:38,333 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:29:39,483 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:29:39,483 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-16 11:29:39,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:39,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:39,485 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:39,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-11-16 11:29:39,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:39,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:39,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:29:39,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:39,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:39,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:39,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:29:39,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:29:39,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:39,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-11-16 11:29:39,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:39,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:39,508 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:39,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-11-16 11:29:39,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:39,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:39,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:39,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:39,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:39,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:29:39,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:29:39,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:39,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-11-16 11:29:39,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:39,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:39,533 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:39,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-11-16 11:29:39,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:39,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:39,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:29:39,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:39,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:39,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:39,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:29:39,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:29:39,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:39,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-11-16 11:29:39,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:39,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:39,557 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:39,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-11-16 11:29:39,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:39,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:39,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:29:39,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:39,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:39,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:39,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:29:39,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:29:39,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:39,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:39,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:39,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:39,601 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:39,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:39,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-11-16 11:29:39,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:39,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:29:39,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:39,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:39,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:39,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:29:39,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:29:39,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:39,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:39,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:39,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:39,652 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:39,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:39,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-11-16 11:29:39,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:39,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:39,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:39,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:39,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:29:39,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:29:39,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:29:39,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:39,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:39,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:39,696 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:39,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-16 11:29:39,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-11-16 11:29:39,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:29:39,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:29:39,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:29:39,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:29:39,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:29:39,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:29:39,732 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-16 11:29:39,740 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-11-16 11:29:39,740 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-11-16 11:29:39,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:29:39,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:39,747 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:29:39,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-11-16 11:29:39,749 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-16 11:29:39,768 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2022-11-16 11:29:39,768 INFO L513 LassoAnalysis]: Proved termination. [2022-11-16 11:29:39,768 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset (* ULTIMATE.start_lis_~i~0#1 4)))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset (* ULTIMATE.start_lis_~i~0#1 4)))_2 + 1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset 8))_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset 4))_2 - 2 >= 0, -1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset 4))_2 >= 0] [2022-11-16 11:29:39,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:40,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:40,258 INFO L156 tatePredicateManager]: 47 out of 49 supporting invariants were superfluous and have been removed [2022-11-16 11:29:40,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:40,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 11:29:40,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:40,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:29:40,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:40,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-16 11:29:40,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-16 11:29:40,780 INFO L321 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2022-11-16 11:29:40,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2022-11-16 11:29:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:40,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 11:29:40,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:29:41,314 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 6 loop predicates [2022-11-16 11:29:41,314 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:41,533 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 52 transitions. Complement of second has 10 states. [2022-11-16 11:29:41,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 8 stem states 0 non-accepting loop states 1 accepting loop states [2022-11-16 11:29:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-11-16 11:29:41,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 26 letters. Loop has 11 letters. [2022-11-16 11:29:41,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:29:41,535 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-16 11:29:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:41,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 11:29:41,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:41,825 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-16 11:29:41,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-16 11:29:41,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-16 11:29:41,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-16 11:29:41,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:29:41,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2022-11-16 11:29:41,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:29:42,519 INFO L321 Elim1Store]: treesize reduction 23, result has 43.9 percent of original size [2022-11-16 11:29:42,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 96 [2022-11-16 11:29:42,562 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-11-16 11:29:42,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 51 [2022-11-16 11:29:42,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 11:29:42,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2022-11-16 11:29:42,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:42,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:42,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:42,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:42,693 INFO L321 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2022-11-16 11:29:42,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 125 [2022-11-16 11:29:42,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:42,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:42,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:42,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:42,937 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-16 11:29:42,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 42 [2022-11-16 11:29:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:43,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 11:29:43,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:29:43,558 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 6 loop predicates [2022-11-16 11:29:43,558 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:43,678 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 52 transitions. Complement of second has 6 states. [2022-11-16 11:29:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2022-11-16 11:29:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-11-16 11:29:43,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 26 letters. Loop has 11 letters. [2022-11-16 11:29:43,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:29:43,681 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-16 11:29:43,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:43,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 11:29:43,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:43,956 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-16 11:29:43,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-16 11:29:43,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-16 11:29:43,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-16 11:29:44,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 19 [2022-11-16 11:29:44,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:29:44,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:44,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:44,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:44,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:44,454 INFO L321 Elim1Store]: treesize reduction 19, result has 50.0 percent of original size [2022-11-16 11:29:44,455 INFO L350 Elim1Store]: Elim1 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 79 treesize of output 68 [2022-11-16 11:29:44,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 11:29:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:44,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 11:29:44,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:29:44,914 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 6 loop predicates [2022-11-16 11:29:44,915 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:44,917 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 49 transitions. Complement of second has 2 states. [2022-11-16 11:29:44,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 1 states 1 stem states 0 non-accepting loop states 0 accepting loop states [2022-11-16 11:29:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1 states to 1 states and 4 transitions. [2022-11-16 11:29:44,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1 states and 4 transitions. Stem has 26 letters. Loop has 11 letters. [2022-11-16 11:29:44,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:29:44,918 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-16 11:29:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:45,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 11:29:45,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:45,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:29:45,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:45,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-16 11:29:45,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-16 11:29:45,412 INFO L321 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2022-11-16 11:29:45,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2022-11-16 11:29:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:45,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 11:29:45,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:29:45,899 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.8 stem predicates 6 loop predicates [2022-11-16 11:29:45,899 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:46,150 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 76 states and 98 transitions. Complement of second has 13 states. [2022-11-16 11:29:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 8 stem states 0 non-accepting loop states 1 accepting loop states [2022-11-16 11:29:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-11-16 11:29:46,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 26 letters. Loop has 11 letters. [2022-11-16 11:29:46,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:29:46,152 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-16 11:29:46,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:46,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 11:29:46,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:46,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:29:46,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:46,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-16 11:29:46,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-16 11:29:46,660 INFO L321 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2022-11-16 11:29:46,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2022-11-16 11:29:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:46,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 11:29:46,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:29:47,082 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.8 stem predicates 6 loop predicates [2022-11-16 11:29:47,083 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:47,939 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 608 states and 955 transitions. Complement of second has 107 states 25 powerset states82 rank states. The highest rank that occured is 5 [2022-11-16 11:29:47,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 8 stem states 8 non-accepting loop states 2 accepting loop states [2022-11-16 11:29:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 160 transitions. [2022-11-16 11:29:47,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 160 transitions. Stem has 26 letters. Loop has 11 letters. [2022-11-16 11:29:47,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:29:47,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 160 transitions. Stem has 37 letters. Loop has 11 letters. [2022-11-16 11:29:47,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:29:47,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 160 transitions. Stem has 26 letters. Loop has 22 letters. [2022-11-16 11:29:47,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:29:47,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 955 transitions. [2022-11-16 11:29:47,951 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 102 [2022-11-16 11:29:47,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 572 states and 906 transitions. [2022-11-16 11:29:47,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2022-11-16 11:29:47,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 345 [2022-11-16 11:29:47,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 572 states and 906 transitions. [2022-11-16 11:29:47,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:29:47,959 INFO L218 hiAutomatonCegarLoop]: Abstraction has 572 states and 906 transitions. [2022-11-16 11:29:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states and 906 transitions. [2022-11-16 11:29:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 173. [2022-11-16 11:29:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 173 states have (on average 1.699421965317919) internal successors, (294), 172 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 294 transitions. [2022-11-16 11:29:47,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 173 states and 294 transitions. [2022-11-16 11:29:47,970 INFO L428 stractBuchiCegarLoop]: Abstraction has 173 states and 294 transitions. [2022-11-16 11:29:47,970 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-16 11:29:47,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 294 transitions. [2022-11-16 11:29:47,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-11-16 11:29:47,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:29:47,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:29:47,973 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:29:47,973 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-11-16 11:29:47,973 INFO L748 eck$LassoCheckResult]: Stem: 4475#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4476#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; 4496#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4485#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 4484#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; 4548#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4552#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; 4545#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4550#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; 4538#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4540#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4509#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4510#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); 4533#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4571#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); 4529#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4518#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); 4519#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4553#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4522#L517-4 lis_~i~0#1 := 1; 4570#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4569#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; 4566#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; 4560#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; 4561#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4636#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4490#L519-2 [2022-11-16 11:29:47,973 INFO L750 eck$LassoCheckResult]: Loop: 4490#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4491#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4502#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; 4482#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; 4506#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; 4608#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4607#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; 4588#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; 4583#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; 4580#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4574#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4490#L519-2 [2022-11-16 11:29:47,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1035301794, now seen corresponding path program 1 times [2022-11-16 11:29:47,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:47,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976134272] [2022-11-16 11:29:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:29:49,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:49,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976134272] [2022-11-16 11:29:49,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976134272] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:29:49,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656779392] [2022-11-16 11:29:49,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:49,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:29:49,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:49,859 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:29:49,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-11-16 11:29:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:50,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 11:29:50,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:50,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:29:50,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-16 11:29:50,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 11:29:50,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-16 11:29:50,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-16 11:29:50,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:50,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:50,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:50,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-11-16 11:29:50,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-16 11:29:50,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:50,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2022-11-16 11:29:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 11:29:50,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:29:50,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_954 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_954)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_953) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2022-11-16 11:29:50,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_273| Int)) (or (not (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 1) |v_ULTIMATE.start_lis_~i~0#1_273|)) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_954 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |v_ULTIMATE.start_lis_~i~0#1_273|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_954)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_953) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))) is different from false [2022-11-16 11:29:51,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:51,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 146 [2022-11-16 11:29:51,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 256 [2022-11-16 11:29:51,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 617 treesize of output 569 [2022-11-16 11:29:51,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 579 treesize of output 555 [2022-11-16 11:29:51,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 641 treesize of output 617 [2022-11-16 11:29:51,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:51,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 375 treesize of output 365 [2022-11-16 11:29:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 5 not checked. [2022-11-16 11:29:52,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656779392] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:29:52,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:29:52,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 11] total 38 [2022-11-16 11:29:52,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232844454] [2022-11-16 11:29:52,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:29:52,426 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:29:52,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:52,427 INFO L85 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 6 times [2022-11-16 11:29:52,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:52,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105469786] [2022-11-16 11:29:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:29:52,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:29:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:29:52,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:29:52,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:52,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 11:29:52,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1093, Unknown=10, NotChecked=138, Total=1406 [2022-11-16 11:29:52,890 INFO L87 Difference]: Start difference. First operand 173 states and 294 transitions. cyclomatic complexity: 134 Second operand has 38 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:29:54,111 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (forall ((|v_ULTIMATE.start_lis_~i~0#1_273| Int)) (or (not (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 1) |v_ULTIMATE.start_lis_~i~0#1_273|)) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_954 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse2 (+ (* 4 |v_ULTIMATE.start_lis_~i~0#1_273|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_954)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_953) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 .cse1) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))) (< (select .cse2 .cse1) (+ (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2022-11-16 11:30:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:01,682 INFO L93 Difference]: Finished difference Result 293 states and 516 transitions. [2022-11-16 11:30:01,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 293 states and 516 transitions. [2022-11-16 11:30:01,685 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 45 [2022-11-16 11:30:01,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 293 states to 293 states and 516 transitions. [2022-11-16 11:30:01,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2022-11-16 11:30:01,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2022-11-16 11:30:01,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 293 states and 516 transitions. [2022-11-16 11:30:01,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:30:01,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 293 states and 516 transitions. [2022-11-16 11:30:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states and 516 transitions. [2022-11-16 11:30:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 206. [2022-11-16 11:30:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 206 states have (on average 1.7184466019417475) internal successors, (354), 205 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 354 transitions. [2022-11-16 11:30:01,696 INFO L240 hiAutomatonCegarLoop]: Abstraction has 206 states and 354 transitions. [2022-11-16 11:30:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 11:30:01,703 INFO L428 stractBuchiCegarLoop]: Abstraction has 206 states and 354 transitions. [2022-11-16 11:30:01,704 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-16 11:30:01,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 354 transitions. [2022-11-16 11:30:01,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-11-16 11:30:01,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:30:01,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:30:01,707 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:01,712 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-11-16 11:30:01,712 INFO L748 eck$LassoCheckResult]: Stem: 5175#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5176#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; 5196#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5184#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 5183#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; 5235#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5241#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; 5232#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5224#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; 5221#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5220#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5208#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 5209#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); 5252#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5264#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); 5248#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5217#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); 5198#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5199#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 5237#L517-4 lis_~i~0#1 := 1; 5342#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5337#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; 5295#L521 assume !lis_#t~short11#1; 5296#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; 5267#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5254#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5190#L519-2 [2022-11-16 11:30:01,714 INFO L750 eck$LassoCheckResult]: Loop: 5190#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5191#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5178#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; 5179#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; 5205#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; 5188#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5203#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; 5344#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; 5339#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; 5269#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5345#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5190#L519-2 [2022-11-16 11:30:01,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:01,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1035361376, now seen corresponding path program 1 times [2022-11-16 11:30:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:01,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034009313] [2022-11-16 11:30:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:01,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:01,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:30:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:01,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:30:01,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 7 times [2022-11-16 11:30:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:01,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570279164] [2022-11-16 11:30:01,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:01,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:01,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:30:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:01,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:30:01,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:01,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1364677886, now seen corresponding path program 1 times [2022-11-16 11:30:01,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:01,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709216500] [2022-11-16 11:30:01,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:01,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:30:03,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:03,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709216500] [2022-11-16 11:30:03,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709216500] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:30:03,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862931116] [2022-11-16 11:30:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:03,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:03,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:30:03,877 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:30:03,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-11-16 11:30:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:04,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 11:30:04,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:30:04,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:30:04,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-16 11:30:04,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 11:30:04,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-16 11:30:04,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 11:30:04,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:04,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2022-11-16 11:30:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:30:04,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:30:05,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1055 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1055) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ 1 (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)))))) is different from false [2022-11-16 11:30:05,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:05,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 74 [2022-11-16 11:30:05,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2022-11-16 11:30:05,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2022-11-16 11:30:05,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 108 [2022-11-16 11:30:05,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:05,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 97 [2022-11-16 11:30:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-11-16 11:30:05,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862931116] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:30:05,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:30:05,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 39 [2022-11-16 11:30:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885463241] [2022-11-16 11:30:05,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:30:06,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:30:06,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 11:30:06,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1270, Unknown=2, NotChecked=72, Total=1482 [2022-11-16 11:30:06,216 INFO L87 Difference]: Start difference. First operand 206 states and 354 transitions. cyclomatic complexity: 161 Second operand has 39 states, 39 states have (on average 2.230769230769231) internal successors, (87), 39 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:11,225 INFO L93 Difference]: Finished difference Result 599 states and 1084 transitions. [2022-11-16 11:30:11,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 599 states and 1084 transitions. [2022-11-16 11:30:11,231 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 67 [2022-11-16 11:30:11,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 599 states to 599 states and 1084 transitions. [2022-11-16 11:30:11,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2022-11-16 11:30:11,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2022-11-16 11:30:11,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 599 states and 1084 transitions. [2022-11-16 11:30:11,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:30:11,238 INFO L218 hiAutomatonCegarLoop]: Abstraction has 599 states and 1084 transitions. [2022-11-16 11:30:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states and 1084 transitions. [2022-11-16 11:30:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 358. [2022-11-16 11:30:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 358 states have (on average 1.776536312849162) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 636 transitions. [2022-11-16 11:30:11,253 INFO L240 hiAutomatonCegarLoop]: Abstraction has 358 states and 636 transitions. [2022-11-16 11:30:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-16 11:30:11,256 INFO L428 stractBuchiCegarLoop]: Abstraction has 358 states and 636 transitions. [2022-11-16 11:30:11,256 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-16 11:30:11,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 358 states and 636 transitions. [2022-11-16 11:30:11,259 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-11-16 11:30:11,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:30:11,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:30:11,264 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:11,264 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-11-16 11:30:11,265 INFO L748 eck$LassoCheckResult]: Stem: 6320#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6321#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; 6341#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6353#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 6391#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; 6385#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6384#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; 6381#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6376#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; 6374#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6370#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6358#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 6359#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); 6420#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6421#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); 6422#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6367#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); 6368#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6418#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); 6397#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6657#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 6539#L517-4 lis_~i~0#1 := 1; 6660#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6585#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; 6658#L521 assume !lis_#t~short11#1; 6525#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; 6521#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6570#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6427#L519-2 [2022-11-16 11:30:11,265 INFO L750 eck$LassoCheckResult]: Loop: 6427#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6424#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6557#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; 6505#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; 6552#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; 6483#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6481#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; 6326#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; 6354#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; 6332#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6345#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6427#L519-2 [2022-11-16 11:30:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1573780482, now seen corresponding path program 2 times [2022-11-16 11:30:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:11,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136617013] [2022-11-16 11:30:11,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:30:11,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:11,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136617013] [2022-11-16 11:30:11,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136617013] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:30:11,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007860335] [2022-11-16 11:30:11,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:30:11,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:11,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:30:11,527 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:30:11,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-11-16 11:30:11,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:30:11,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:30:11,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:30:11,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:30:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:30:11,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:30:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:30:12,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007860335] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:30:12,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:30:12,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-16 11:30:12,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261431695] [2022-11-16 11:30:12,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:30:12,027 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:30:12,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 8 times [2022-11-16 11:30:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:12,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434559510] [2022-11-16 11:30:12,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:12,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:12,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:30:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:12,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:30:12,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:30:12,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 11:30:12,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:30:12,572 INFO L87 Difference]: Start difference. First operand 358 states and 636 transitions. cyclomatic complexity: 293 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) [2022-11-16 11:30:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:12,878 INFO L93 Difference]: Finished difference Result 443 states and 770 transitions. [2022-11-16 11:30:12,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 443 states and 770 transitions. [2022-11-16 11:30:12,882 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 31 [2022-11-16 11:30:12,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 443 states to 429 states and 743 transitions. [2022-11-16 11:30:12,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2022-11-16 11:30:12,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2022-11-16 11:30:12,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 429 states and 743 transitions. [2022-11-16 11:30:12,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:30:12,890 INFO L218 hiAutomatonCegarLoop]: Abstraction has 429 states and 743 transitions. [2022-11-16 11:30:12,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states and 743 transitions. [2022-11-16 11:30:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 367. [2022-11-16 11:30:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 367 states have (on average 1.7302452316076293) internal successors, (635), 366 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 635 transitions. [2022-11-16 11:30:12,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 367 states and 635 transitions. [2022-11-16 11:30:12,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:30:12,903 INFO L428 stractBuchiCegarLoop]: Abstraction has 367 states and 635 transitions. [2022-11-16 11:30:12,903 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-16 11:30:12,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 367 states and 635 transitions. [2022-11-16 11:30:12,905 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-11-16 11:30:12,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:30:12,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:30:12,906 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:12,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-16 11:30:12,907 INFO L748 eck$LassoCheckResult]: Stem: 7314#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7315#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; 7334#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 7344#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 7373#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; 7372#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 7370#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; 7368#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 7367#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; 7364#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 7366#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 7379#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 7409#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); 7405#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7401#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); 7397#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7393#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); 7392#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7376#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 7353#L517-4 lis_~i~0#1 := 1; 7355#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 7603#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; 7600#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; 7601#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); 7427#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 7428#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 7328#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 7329#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 7317#L520-3 [2022-11-16 11:30:12,907 INFO L750 eck$LassoCheckResult]: Loop: 7317#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; 7318#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; 7345#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; 7340#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 7317#L520-3 [2022-11-16 11:30:12,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1509233465, now seen corresponding path program 1 times [2022-11-16 11:30:12,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:12,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723237218] [2022-11-16 11:30:12,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:12,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:12,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:30:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:13,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:30:13,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 2 times [2022-11-16 11:30:13,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:13,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596895919] [2022-11-16 11:30:13,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:13,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:13,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:30:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:13,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:30:13,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:13,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1715330260, now seen corresponding path program 2 times [2022-11-16 11:30:13,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:13,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275080303] [2022-11-16 11:30:13,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:13,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:30:15,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:15,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275080303] [2022-11-16 11:30:15,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275080303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:30:15,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339638086] [2022-11-16 11:30:15,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:30:15,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:15,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:30:15,265 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:30:15,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-11-16 11:30:15,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:30:15,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:30:15,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 11:30:15,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:30:15,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:30:15,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-16 11:30:15,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 11:30:15,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-16 11:30:15,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 11:30:16,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:16,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:16,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:16,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:30:16,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2022-11-16 11:30:16,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-16 11:30:16,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:16,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2022-11-16 11:30:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 11:30:16,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:30:18,541 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1254 Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (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|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1250))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (or (< (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (select .cse0 .cse1)) (let ((.cse2 (select (store (store .cse3 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 .cse1 v_ArrVal_1254)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse2 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))))) is different from false [2022-11-16 11:30:18,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:18,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 331 treesize of output 199 [2022-11-16 11:30:18,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 297 [2022-11-16 11:30:18,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 218 treesize of output 194 [2022-11-16 11:30:18,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 182 [2022-11-16 11:30:18,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 295 treesize of output 271 [2022-11-16 11:30:18,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:18,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 206 treesize of output 206 [2022-11-16 11:30:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-11-16 11:30:19,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339638086] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:30:19,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:30:19,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 43 [2022-11-16 11:30:19,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033767439] [2022-11-16 11:30:19,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:30:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:30:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-16 11:30:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1559, Unknown=5, NotChecked=80, Total=1806 [2022-11-16 11:30:19,342 INFO L87 Difference]: Start difference. First operand 367 states and 635 transitions. cyclomatic complexity: 285 Second operand has 43 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:25,477 INFO L93 Difference]: Finished difference Result 766 states and 1374 transitions. [2022-11-16 11:30:25,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 766 states and 1374 transitions. [2022-11-16 11:30:25,483 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 91 [2022-11-16 11:30:25,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 766 states to 763 states and 1368 transitions. [2022-11-16 11:30:25,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2022-11-16 11:30:25,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 297 [2022-11-16 11:30:25,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 763 states and 1368 transitions. [2022-11-16 11:30:25,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:30:25,490 INFO L218 hiAutomatonCegarLoop]: Abstraction has 763 states and 1368 transitions. [2022-11-16 11:30:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states and 1368 transitions. [2022-11-16 11:30:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 376. [2022-11-16 11:30:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 376 states have (on average 1.6941489361702127) internal successors, (637), 375 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 637 transitions. [2022-11-16 11:30:25,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 376 states and 637 transitions. [2022-11-16 11:30:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-16 11:30:25,502 INFO L428 stractBuchiCegarLoop]: Abstraction has 376 states and 637 transitions. [2022-11-16 11:30:25,502 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-16 11:30:25,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 376 states and 637 transitions. [2022-11-16 11:30:25,504 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-11-16 11:30:25,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:30:25,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:30:25,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:25,505 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-16 11:30:25,506 INFO L748 eck$LassoCheckResult]: Stem: 8767#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8768#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; 8789#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 8801#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 8834#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; 8832#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8833#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; 8846#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8829#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; 8844#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8824#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; 8835#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8839#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 8877#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 8815#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); 8816#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8865#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); 8884#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8857#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); 8793#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8794#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); 8918#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 9029#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 8810#L517-4 lis_~i~0#1 := 1; 8811#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 8931#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; 8929#L521 assume !lis_#t~short11#1; 8904#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; 9006#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8888#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 8889#L519-2 [2022-11-16 11:30:25,506 INFO L750 eck$LassoCheckResult]: Loop: 8889#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 8887#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 9082#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; 9081#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; 9078#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; 9075#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 9069#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; 9066#L521 assume !lis_#t~short11#1; 9032#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; 9003#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 9001#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 8889#L519-2 [2022-11-16 11:30:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash -11169052, now seen corresponding path program 3 times [2022-11-16 11:30:25,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:25,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702835970] [2022-11-16 11:30:25,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:25,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:25,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:30:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:25,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:30:25,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:25,583 INFO L85 PathProgramCache]: Analyzing trace with hash -943386241, now seen corresponding path program 1 times [2022-11-16 11:30:25,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:25,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120198819] [2022-11-16 11:30:25,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:25,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:30:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:25,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:30:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1948639932, now seen corresponding path program 2 times [2022-11-16 11:30:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:25,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756943196] [2022-11-16 11:30:25,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-16 11:30:26,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:26,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756943196] [2022-11-16 11:30:26,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756943196] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:30:26,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910792284] [2022-11-16 11:30:26,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:30:26,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:30:26,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:30:26,807 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:30:26,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_201a3d67-1856-45ec-a9b0-5073578a498b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-11-16 11:30:27,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:30:27,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:30:27,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 11:30:27,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:30:27,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:30:27,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-16 11:30:27,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 11:30:27,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:27,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-16 11:30:27,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 11:30:27,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:27,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:27,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-11-16 11:30:27,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2022-11-16 11:30:27,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:27,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:27,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:27,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:27,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:30:27,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-11-16 11:30:27,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-16 11:30:27,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:27,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 16 [2022-11-16 11:30:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 11:30:27,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:30:28,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1386 Int) (v_ArrVal_1387 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1386)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1387) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2022-11-16 11:30:28,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_317| Int)) (or (not (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 1) |v_ULTIMATE.start_lis_~i~0#1_317|)) (forall ((v_ArrVal_1386 Int) (v_ArrVal_1387 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |v_ULTIMATE.start_lis_~i~0#1_317|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1386)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1387) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))) is different from false [2022-11-16 11:30:37,516 WARN L233 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:30:52,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:52,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 477 treesize of output 298 [2022-11-16 11:30:52,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 550 treesize of output 544 [2022-11-16 11:30:52,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1524 treesize of output 1428 [2022-11-16 11:30:52,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1200 treesize of output 1152 [2022-11-16 11:30:52,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1324 treesize of output 1276 [2022-11-16 11:30:52,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:52,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 4848 treesize of output 4670 [2022-11-16 11:30:53,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:30:53,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2517 treesize of output 2421