./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD --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 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 23:30:03,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:30:03,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:30:03,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:30:03,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:30:03,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:30:03,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:30:03,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:30:03,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:30:03,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:30:03,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:30:04,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:30:04,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:30:04,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:30:04,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:30:04,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:30:04,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:30:04,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:30:04,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:30:04,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:30:04,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:30:04,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:30:04,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:30:04,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:30:04,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:30:04,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:30:04,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:30:04,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:30:04,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:30:04,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:30:04,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:30:04,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:30:04,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:30:04,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:30:04,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:30:04,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:30:04,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:30:04,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:30:04,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:30:04,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:30:04,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:30:04,064 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-28 23:30:04,120 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:30:04,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:30:04,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:30:04,122 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:30:04,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:30:04,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:30:04,124 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:30:04,125 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-28 23:30:04,125 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-28 23:30:04,125 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-28 23:30:04,127 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-28 23:30:04,127 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-28 23:30:04,127 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-28 23:30:04,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:30:04,128 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:30:04,129 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 23:30:04,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:30:04,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:30:04,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:30:04,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-28 23:30:04,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-28 23:30:04,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-28 23:30:04,131 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:30:04,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:30:04,131 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-28 23:30:04,131 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:30:04,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-28 23:30:04,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:30:04,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:30:04,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:30:04,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:30:04,136 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:30:04,137 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-28 23:30:04,137 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_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/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_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2021-10-28 23:30:04,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:30:04,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:30:04,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:30:04,488 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:30:04,490 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:30:04,491 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-10-28 23:30:04,582 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/data/887d818da/07f669c6e97441349545e7bc7f68e0ae/FLAGb4e599005 [2021-10-28 23:30:05,145 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:30:05,146 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-10-28 23:30:05,162 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/data/887d818da/07f669c6e97441349545e7bc7f68e0ae/FLAGb4e599005 [2021-10-28 23:30:05,446 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/data/887d818da/07f669c6e97441349545e7bc7f68e0ae [2021-10-28 23:30:05,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:30:05,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:30:05,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:30:05,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:30:05,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:30:05,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:30:05" (1/1) ... [2021-10-28 23:30:05,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4298f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:05, skipping insertion in model container [2021-10-28 23:30:05,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:30:05" (1/1) ... [2021-10-28 23:30:05,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:30:05,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:30:05,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:30:05,942 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:30:06,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:30:06,050 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:30:06,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:06 WrapperNode [2021-10-28 23:30:06,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:30:06,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:30:06,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:30:06,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:30:06,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:06" (1/1) ... [2021-10-28 23:30:06,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:06" (1/1) ... [2021-10-28 23:30:06,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:30:06,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:30:06,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:30:06,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:30:06,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:06" (1/1) ... [2021-10-28 23:30:06,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:06" (1/1) ... [2021-10-28 23:30:06,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:06" (1/1) ... [2021-10-28 23:30:06,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:06" (1/1) ... [2021-10-28 23:30:06,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:06" (1/1) ... [2021-10-28 23:30:06,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:06" (1/1) ... [2021-10-28 23:30:06,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:06" (1/1) ... [2021-10-28 23:30:06,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:30:06,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:30:06,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:30:06,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:30:06,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:06" (1/1) ... [2021-10-28 23:30:06,169 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:06,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:06,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:06,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-28 23:30:06,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 23:30:06,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 23:30:06,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:30:06,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 23:30:06,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:30:06,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:30:06,640 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:30:06,640 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-10-28 23:30:06,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:30:06 BoogieIcfgContainer [2021-10-28 23:30:06,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:30:06,643 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-28 23:30:06,644 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-28 23:30:06,662 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-28 23:30:06,663 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 23:30:06,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.10 11:30:05" (1/3) ... [2021-10-28 23:30:06,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75733d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 11:30:06, skipping insertion in model container [2021-10-28 23:30:06,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 23:30:06,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:30:06" (2/3) ... [2021-10-28 23:30:06,666 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75733d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 11:30:06, skipping insertion in model container [2021-10-28 23:30:06,666 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 23:30:06,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:30:06" (3/3) ... [2021-10-28 23:30:06,667 INFO L389 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2021-10-28 23:30:06,737 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-28 23:30:06,737 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-28 23:30:06,738 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-28 23:30:06,738 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-28 23:30:06,738 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-28 23:30:06,738 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-28 23:30:06,738 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-28 23:30:06,738 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-28 23:30:06,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:06,776 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-10-28 23:30:06,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:30:06,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:30:06,783 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-28 23:30:06,783 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-28 23:30:06,783 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-28 23:30:06,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:06,787 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-10-28 23:30:06,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:30:06,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:30:06,788 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-28 23:30:06,788 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-28 23:30:06,796 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 11#L530true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7#L530-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 4#L535-3true [2021-10-28 23:30:06,796 INFO L793 eck$LassoCheckResult]: Loop: 4#L535-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 17#L535-2true main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4#L535-3true [2021-10-28 23:30:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-10-28 23:30:06,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:06,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185022142] [2021-10-28 23:30:06,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:06,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:06,921 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:06,954 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:06,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-10-28 23:30:06,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:06,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135852258] [2021-10-28 23:30:06,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:06,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:06,976 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:06,996 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:07,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-10-28 23:30:07,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:07,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681378628] [2021-10-28 23:30:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:07,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:07,052 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:07,095 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:07,534 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 23:30:07,535 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 23:30:07,536 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 23:30:07,536 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 23:30:07,536 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-28 23:30:07,536 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:07,537 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 23:30:07,537 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 23:30:07,537 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2021-10-28 23:30:07,537 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 23:30:07,538 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 23:30:07,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:07,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:07,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:07,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:07,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:07,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:07,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:07,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:07,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:07,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:08,102 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-28 23:30:08,108 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-28 23:30:08,110 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:08,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:08,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:08,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:08,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:08,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 23:30:08,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:08,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:08,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:08,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 23:30:08,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 23:30:08,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-10-28 23:30:08,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:08,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:08,201 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:08,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:08,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:08,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-10-28 23:30:08,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:08,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:08,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 23:30:08,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:08,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:08,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:08,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 23:30:08,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 23:30:08,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:08,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:08,260 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:08,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:08,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:08,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-10-28 23:30:08,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:08,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:08,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:08,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:08,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:08,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 23:30:08,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 23:30:08,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:08,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:08,352 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:08,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:08,353 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:08,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-10-28 23:30:08,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:08,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:08,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 23:30:08,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:08,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:08,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:08,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 23:30:08,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 23:30:08,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:08,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:08,435 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:08,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:08,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:08,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:08,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:08,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:08,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:08,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:08,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 23:30:08,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 23:30:08,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-10-28 23:30:08,490 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-28 23:30:08,547 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-10-28 23:30:08,547 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-10-28 23:30:08,549 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:08,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:08,554 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:08,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-28 23:30:08,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-10-28 23:30:08,587 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-28 23:30:08,588 INFO L513 LassoAnalysis]: Proved termination. [2021-10-28 23:30:08,588 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2021-10-28 23:30:08,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:08,648 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-10-28 23:30:08,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:08,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-28 23:30:08,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:30:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:08,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-28 23:30:08,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:30:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:30:08,810 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-10-28 23:30:08,812 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) [2021-10-28 23:30:08,908 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. [2021-10-28 23:30:08,909 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 [2021-10-28 23:30:08,911 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) [2021-10-28 23:30:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2021-10-28 23:30:08,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2021-10-28 23:30:08,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 23:30:08,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2021-10-28 23:30:08,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 23:30:08,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 4 letters. [2021-10-28 23:30:08,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 23:30:08,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 99 transitions. [2021-10-28 23:30:08,932 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-10-28 23:30:08,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 21 states and 30 transitions. [2021-10-28 23:30:08,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-10-28 23:30:08,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-10-28 23:30:08,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2021-10-28 23:30:08,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:30:08,942 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-10-28 23:30:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2021-10-28 23:30:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-10-28 23:30:08,972 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) [2021-10-28 23:30:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2021-10-28 23:30:08,976 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-10-28 23:30:08,976 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-10-28 23:30:08,976 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-28 23:30:08,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2021-10-28 23:30:08,979 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-10-28 23:30:08,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:30:08,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:30:08,980 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-10-28 23:30:08,980 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-28 23:30:08,981 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 152#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 160#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 156#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 147#L535-3 assume !(main_~i~1 < main_~array_size~0); 149#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 162#L517-3 [2021-10-28 23:30:08,982 INFO L793 eck$LassoCheckResult]: Loop: 162#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 161#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 162#L517-3 [2021-10-28 23:30:08,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:08,983 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-10-28 23:30:08,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:08,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142766281] [2021-10-28 23:30:08,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:08,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:30:09,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:30:09,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142766281] [2021-10-28 23:30:09,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142766281] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:30:09,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:30:09,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:30:09,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139408401] [2021-10-28 23:30:09,090 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 23:30:09,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:09,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2021-10-28 23:30:09,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:09,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521565169] [2021-10-28 23:30:09,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:09,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:09,130 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:09,152 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:09,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:09,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:30:09,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:30:09,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:30:09,290 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) [2021-10-28 23:30:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:30:09,328 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2021-10-28 23:30:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:30:09,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2021-10-28 23:30:09,339 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-10-28 23:30:09,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2021-10-28 23:30:09,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-10-28 23:30:09,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-10-28 23:30:09,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-10-28 23:30:09,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:30:09,347 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-10-28 23:30:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-10-28 23:30:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-10-28 23:30:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2021-10-28 23:30:09,350 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-10-28 23:30:09,351 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-10-28 23:30:09,351 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-28 23:30:09,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2021-10-28 23:30:09,352 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-10-28 23:30:09,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:30:09,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:30:09,355 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:09,355 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-28 23:30:09,356 INFO L791 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 202#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 210#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 206#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 197#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 198#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 199#L535-3 assume !(main_~i~1 < main_~array_size~0); 200#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 212#L517-3 [2021-10-28 23:30:09,356 INFO L793 eck$LassoCheckResult]: Loop: 212#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 211#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 212#L517-3 [2021-10-28 23:30:09,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:09,357 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-10-28 23:30:09,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:09,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211200236] [2021-10-28 23:30:09,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:09,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:09,396 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:09,447 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:09,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:09,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2021-10-28 23:30:09,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:09,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419818805] [2021-10-28 23:30:09,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:09,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:09,482 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:09,491 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2021-10-28 23:30:09,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:09,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271123113] [2021-10-28 23:30:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:09,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:09,548 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:09,597 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:10,596 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 23:30:10,596 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 23:30:10,596 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 23:30:10,596 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 23:30:10,596 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-28 23:30:10,596 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:10,597 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 23:30:10,597 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 23:30:10,597 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2021-10-28 23:30:10,597 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 23:30:10,597 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 23:30:10,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:10,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:10,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:10,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:10,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:10,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:10,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:11,951 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-28 23:30:11,951 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-28 23:30:11,952 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:11,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:11,959 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:11,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-10-28 23:30:11,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:11,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:11,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 23:30:11,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:11,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:11,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:11,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 23:30:11,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 23:30:11,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:12,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:12,022 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:12,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:12,024 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:12,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-10-28 23:30:12,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:12,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:12,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:12,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:12,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:12,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 23:30:12,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 23:30:12,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:12,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-10-28 23:30:12,110 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:12,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:12,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:12,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:12,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:12,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 23:30:12,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:12,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:12,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:12,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 23:30:12,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 23:30:12,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-10-28 23:30:12,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:12,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:12,202 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:12,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:12,204 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:12,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:12,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:12,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 23:30:12,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:12,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:12,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:12,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 23:30:12,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 23:30:12,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-10-28 23:30:12,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:12,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:12,280 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:12,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:12,282 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:12,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:12,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:12,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:12,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:12,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:12,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 23:30:12,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 23:30:12,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-10-28 23:30:12,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:12,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:12,366 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:12,367 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:12,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:12,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:12,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 23:30:12,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:12,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:12,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:12,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 23:30:12,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 23:30:12,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-10-28 23:30:12,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:12,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:12,408 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:12,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:12,409 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:12,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-10-28 23:30:12,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:12,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:12,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 23:30:12,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:12,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:12,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:12,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 23:30:12,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 23:30:12,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:12,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:12,457 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:12,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:12,464 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:12,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-10-28 23:30:12,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:12,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:12,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:12,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:12,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:12,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 23:30:12,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 23:30:12,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:12,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:12,532 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:12,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:12,533 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:12,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-10-28 23:30:12,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:12,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:12,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:12,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:12,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:12,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 23:30:12,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 23:30:12,620 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-28 23:30:12,691 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-10-28 23:30:12,691 INFO L444 ModelExtractionUtils]: 28 out of 61 variables were initially zero. Simplification set additionally 30 variables to zero. [2021-10-28 23:30:12,691 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:12,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:12,693 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:12,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-10-28 23:30:12,822 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-28 23:30:12,832 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-28 23:30:12,833 INFO L513 LassoAnalysis]: Proved termination. [2021-10-28 23:30:12,833 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2021-10-28 23:30:12,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-10-28 23:30:12,950 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2021-10-28 23:30:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:12,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-28 23:30:12,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:30:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:13,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-28 23:30:13,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:30:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:30:13,069 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-10-28 23:30:13,069 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:13,087 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 35 transitions. Complement of second has 7 states. [2021-10-28 23:30:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-10-28 23:30:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-10-28 23:30:13,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2021-10-28 23:30:13,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 23:30:13,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2021-10-28 23:30:13,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 23:30:13,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2021-10-28 23:30:13,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 23:30:13,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-10-28 23:30:13,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-10-28 23:30:13,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2021-10-28 23:30:13,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-10-28 23:30:13,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-10-28 23:30:13,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2021-10-28 23:30:13,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 23:30:13,092 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-10-28 23:30:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2021-10-28 23:30:13,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-10-28 23:30:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-10-28 23:30:13,095 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-10-28 23:30:13,095 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-10-28 23:30:13,095 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-28 23:30:13,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2021-10-28 23:30:13,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-10-28 23:30:13,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:30:13,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:30:13,096 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:13,097 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-28 23:30:13,097 INFO L791 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 385#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 393#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 389#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 380#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 381#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 382#L535-3 assume !(main_~i~1 < main_~array_size~0); 383#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 400#L517-3 assume !(lis_~i~0 < lis_~N); 401#L517-4 lis_~i~0 := 1; 392#L519-3 [2021-10-28 23:30:13,097 INFO L793 eck$LassoCheckResult]: Loop: 392#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 386#L520-3 assume !(lis_~j~0 < lis_~i~0); 387#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 392#L519-3 [2021-10-28 23:30:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:13,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2021-10-28 23:30:13,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:13,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102864374] [2021-10-28 23:30:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:13,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:30:13,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:30:13,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102864374] [2021-10-28 23:30:13,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102864374] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:30:13,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:30:13,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:30:13,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664517177] [2021-10-28 23:30:13,155 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 23:30:13,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2021-10-28 23:30:13,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:13,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810117188] [2021-10-28 23:30:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:13,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:13,162 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:13,172 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:13,194 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 23:30:13,194 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 23:30:13,195 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 23:30:13,195 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 23:30:13,195 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-10-28 23:30:13,195 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:13,195 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 23:30:13,195 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 23:30:13,195 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-10-28 23:30:13,196 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 23:30:13,196 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 23:30:13,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:13,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:13,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:13,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:13,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:13,276 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-28 23:30:13,277 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-10-28 23:30:13,279 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:13,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:13,280 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:13,291 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-28 23:30:13,291 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-28 23:30:13,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-10-28 23:30:13,314 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-10-28 23:30:13,314 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_3=1} Honda state: {v_rep~unnamed0~0~P_PID_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-10-28 23:30:13,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:13,359 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:13,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:13,360 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:13,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-28 23:30:13,372 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-28 23:30:13,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-10-28 23:30:13,394 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-10-28 23:30:13,394 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_3=2} Honda state: {v_rep~unnamed0~0~P_PGID_3=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-10-28 23:30:13,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:13,423 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:13,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:13,424 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:13,429 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-28 23:30:13,429 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-28 23:30:13,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-10-28 23:30:13,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:13,506 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:13,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:13,507 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:13,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-10-28 23:30:13,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-10-28 23:30:13,514 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-28 23:30:13,738 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-10-28 23:30:13,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:13,746 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 23:30:13,746 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 23:30:13,746 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 23:30:13,746 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 23:30:13,746 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-28 23:30:13,746 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:13,746 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 23:30:13,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 23:30:13,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-10-28 23:30:13,746 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 23:30:13,746 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 23:30:13,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:13,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:13,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:13,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:13,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:13,834 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-28 23:30:13,834 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-28 23:30:13,834 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:13,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:13,838 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:13,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:13,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:13,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:13,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:13,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:13,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 23:30:13,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 23:30:13,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-10-28 23:30:13,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:13,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:13,927 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:13,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:13,928 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:13,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:13,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:13,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:13,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:13,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:13,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 23:30:13,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 23:30:13,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-10-28 23:30:13,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 23:30:13,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-10-28 23:30:13,992 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:13,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:13,993 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:13,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-10-28 23:30:14,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 23:30:14,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 23:30:14,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 23:30:14,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 23:30:14,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 23:30:14,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 23:30:14,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 23:30:14,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 23:30:14,036 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-28 23:30:14,040 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-10-28 23:30:14,040 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-10-28 23:30:14,040 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:14,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:14,042 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 23:30:14,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:14,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-10-28 23:30:14,082 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-28 23:30:14,082 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-10-28 23:30:14,082 INFO L513 LassoAnalysis]: Proved termination. [2021-10-28 23:30:14,082 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2021-10-28 23:30:14,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:14,109 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-10-28 23:30:14,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:14,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-28 23:30:14,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:30:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:14,199 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-28 23:30:14,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:30:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:30:14,246 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-10-28 23:30:14,246 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:14,314 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 67 transitions. Complement of second has 9 states. [2021-10-28 23:30:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-10-28 23:30:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-10-28 23:30:14,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2021-10-28 23:30:14,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 23:30:14,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2021-10-28 23:30:14,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 23:30:14,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2021-10-28 23:30:14,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 23:30:14,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2021-10-28 23:30:14,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2021-10-28 23:30:14,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2021-10-28 23:30:14,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-10-28 23:30:14,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-10-28 23:30:14,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2021-10-28 23:30:14,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 23:30:14,321 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 62 transitions. [2021-10-28 23:30:14,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2021-10-28 23:30:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2021-10-28 23:30:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2021-10-28 23:30:14,325 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2021-10-28 23:30:14,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:30:14,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:30:14,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:30:14,326 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:30:14,381 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2021-10-28 23:30:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:30:14,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2021-10-28 23:30:14,383 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 23:30:14,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2021-10-28 23:30:14,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-28 23:30:14,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-28 23:30:14,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2021-10-28 23:30:14,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 23:30:14,385 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2021-10-28 23:30:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2021-10-28 23:30:14,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-10-28 23:30:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2021-10-28 23:30:14,389 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-10-28 23:30:14,389 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-10-28 23:30:14,389 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-28 23:30:14,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2021-10-28 23:30:14,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 23:30:14,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:30:14,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:30:14,391 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:14,391 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:14,391 INFO L791 eck$LassoCheckResult]: Stem: 586#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 587#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 601#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 593#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 582#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 583#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 584#L535-3 assume !(main_~i~1 < main_~array_size~0); 585#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 610#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 602#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 603#L517-3 assume !(lis_~i~0 < lis_~N); 611#L517-4 lis_~i~0 := 1; 612#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 588#L520-3 [2021-10-28 23:30:14,392 INFO L793 eck$LassoCheckResult]: Loop: 588#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 589#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 594#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 595#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 606#L520-3 assume !(lis_~j~0 < lis_~i~0); 598#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 599#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 588#L520-3 [2021-10-28 23:30:14,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:14,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2021-10-28 23:30:14,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:14,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823297860] [2021-10-28 23:30:14,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:14,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:30:14,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:30:14,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823297860] [2021-10-28 23:30:14,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823297860] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:30:14,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995954772] [2021-10-28 23:30:14,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:14,453 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:30:14,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:14,470 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:30:14,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-10-28 23:30:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:14,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-28 23:30:14,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:30:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:30:14,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995954772] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:30:14,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:30:14,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2021-10-28 23:30:14,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647897652] [2021-10-28 23:30:14,641 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 23:30:14,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:14,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2021-10-28 23:30:14,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:14,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287167175] [2021-10-28 23:30:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:14,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:14,652 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:14,663 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:14,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:30:14,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 23:30:14,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-28 23:30:14,880 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:30:15,084 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2021-10-28 23:30:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 23:30:15,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 109 transitions. [2021-10-28 23:30:15,086 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-10-28 23:30:15,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 81 transitions. [2021-10-28 23:30:15,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-10-28 23:30:15,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-10-28 23:30:15,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2021-10-28 23:30:15,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 23:30:15,087 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 81 transitions. [2021-10-28 23:30:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2021-10-28 23:30:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2021-10-28 23:30:15,091 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) [2021-10-28 23:30:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2021-10-28 23:30:15,091 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2021-10-28 23:30:15,091 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2021-10-28 23:30:15,091 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-28 23:30:15,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2021-10-28 23:30:15,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 23:30:15,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:30:15,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:30:15,093 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:15,093 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:15,093 INFO L791 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 762#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 776#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 768#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 757#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 758#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 759#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 760#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 791#L535-3 assume !(main_~i~1 < main_~array_size~0); 785#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 786#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 789#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 790#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 777#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 778#L517-3 assume !(lis_~i~0 < lis_~N); 787#L517-4 lis_~i~0 := 1; 779#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 763#L520-3 [2021-10-28 23:30:15,094 INFO L793 eck$LassoCheckResult]: Loop: 763#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 764#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 769#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 770#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 781#L520-3 assume !(lis_~j~0 < lis_~i~0); 773#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 774#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 763#L520-3 [2021-10-28 23:30:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2021-10-28 23:30:15,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:15,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680833215] [2021-10-28 23:30:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:15,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:15,118 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:15,144 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2021-10-28 23:30:15,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:15,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369051664] [2021-10-28 23:30:15,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:15,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:15,153 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:15,162 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:15,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2021-10-28 23:30:15,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:15,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607709998] [2021-10-28 23:30:15,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:15,163 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:15,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-28 23:30:15,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:30:15,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607709998] [2021-10-28 23:30:15,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607709998] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:30:15,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452710138] [2021-10-28 23:30:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:15,260 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:30:15,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:15,261 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:30:15,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-10-28 23:30:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:15,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-28 23:30:15,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:30:15,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-28 23:30:15,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452710138] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:30:15,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:30:15,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-10-28 23:30:15,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853520753] [2021-10-28 23:30:15,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:30:15,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 23:30:15,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-28 23:30:15,812 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 19 Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:30:16,008 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2021-10-28 23:30:16,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 23:30:16,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 92 transitions. [2021-10-28 23:30:16,010 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2021-10-28 23:30:16,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 83 transitions. [2021-10-28 23:30:16,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-10-28 23:30:16,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-10-28 23:30:16,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 83 transitions. [2021-10-28 23:30:16,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 23:30:16,012 INFO L681 BuchiCegarLoop]: Abstraction has 62 states and 83 transitions. [2021-10-28 23:30:16,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 83 transitions. [2021-10-28 23:30:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2021-10-28 23:30:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 54 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2021-10-28 23:30:16,019 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-10-28 23:30:16,019 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-10-28 23:30:16,019 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-28 23:30:16,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2021-10-28 23:30:16,021 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-10-28 23:30:16,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:30:16,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:30:16,023 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:16,023 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-28 23:30:16,023 INFO L791 eck$LassoCheckResult]: Stem: 962#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 963#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 977#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 969#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 958#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 959#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 960#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 961#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1006#L535-3 assume !(main_~i~1 < main_~array_size~0); 988#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 989#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 978#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 979#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 992#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 996#L517-3 assume !(lis_~i~0 < lis_~N); 990#L517-4 lis_~i~0 := 1; 991#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1000#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 984#L521 [2021-10-28 23:30:16,024 INFO L793 eck$LassoCheckResult]: Loop: 984#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 970#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 971#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 983#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 984#L521 [2021-10-28 23:30:16,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1159051365, now seen corresponding path program 1 times [2021-10-28 23:30:16,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:16,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697563254] [2021-10-28 23:30:16,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:16,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:16,080 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:16,141 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:16,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2655420, now seen corresponding path program 1 times [2021-10-28 23:30:16,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:16,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063559027] [2021-10-28 23:30:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:16,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:16,158 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:16,169 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:16,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:16,174 INFO L85 PathProgramCache]: Analyzing trace with hash -651990240, now seen corresponding path program 1 times [2021-10-28 23:30:16,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:16,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901488678] [2021-10-28 23:30:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:16,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 23:30:16,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:30:16,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901488678] [2021-10-28 23:30:16,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901488678] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:30:16,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067940049] [2021-10-28 23:30:16,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:16,257 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:30:16,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:16,262 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:30:16,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-10-28 23:30:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:16,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-28 23:30:16,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:30:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 23:30:16,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067940049] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:30:16,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-28 23:30:16,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-10-28 23:30:16,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712641984] [2021-10-28 23:30:16,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:30:16,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:30:16,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:30:16,728 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) [2021-10-28 23:30:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:30:16,798 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2021-10-28 23:30:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:30:16,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2021-10-28 23:30:16,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 23:30:16,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2021-10-28 23:30:16,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-10-28 23:30:16,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-10-28 23:30:16,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2021-10-28 23:30:16,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 23:30:16,801 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 97 transitions. [2021-10-28 23:30:16,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2021-10-28 23:30:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2021-10-28 23:30:16,806 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) [2021-10-28 23:30:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2021-10-28 23:30:16,807 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2021-10-28 23:30:16,807 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2021-10-28 23:30:16,807 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-28 23:30:16,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 88 transitions. [2021-10-28 23:30:16,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 23:30:16,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:30:16,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:30:16,809 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:16,809 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-28 23:30:16,809 INFO L791 eck$LassoCheckResult]: Stem: 1165#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1166#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1178#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1171#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1161#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1162#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1163#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1164#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1214#L535-3 assume !(main_~i~1 < main_~array_size~0); 1213#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1198#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1179#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1180#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1199#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1218#L517-3 assume !(lis_~i~0 < lis_~N); 1196#L517-4 lis_~i~0 := 1; 1184#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1185#L520-3 assume !(lis_~j~0 < lis_~i~0); 1221#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1200#L519-3 assume !(lis_~i~0 < lis_~N); 1197#L519-4 lis_~i~0 := 0; 1191#L523-3 [2021-10-28 23:30:16,809 INFO L793 eck$LassoCheckResult]: Loop: 1191#L523-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 1192#L524 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 1193#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1191#L523-3 [2021-10-28 23:30:16,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:16,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2057131266, now seen corresponding path program 1 times [2021-10-28 23:30:16,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:16,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014858916] [2021-10-28 23:30:16,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:16,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 23:30:16,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:30:16,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014858916] [2021-10-28 23:30:16,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014858916] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:30:16,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:30:16,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:30:16,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777375098] [2021-10-28 23:30:16,882 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 23:30:16,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2021-10-28 23:30:16,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:16,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245655068] [2021-10-28 23:30:16,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:16,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:16,888 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:16,891 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:16,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:30:16,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:30:16,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:30:16,946 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) [2021-10-28 23:30:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:30:16,987 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2021-10-28 23:30:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:30:16,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2021-10-28 23:30:16,989 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 23:30:16,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 88 transitions. [2021-10-28 23:30:16,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-10-28 23:30:16,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-10-28 23:30:16,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 88 transitions. [2021-10-28 23:30:16,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 23:30:16,992 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 88 transitions. [2021-10-28 23:30:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 88 transitions. [2021-10-28 23:30:17,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2021-10-28 23:30:17,007 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) [2021-10-28 23:30:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2021-10-28 23:30:17,010 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-10-28 23:30:17,010 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-10-28 23:30:17,010 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-28 23:30:17,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 86 transitions. [2021-10-28 23:30:17,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 23:30:17,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:30:17,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:30:17,013 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:17,014 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:17,014 INFO L791 eck$LassoCheckResult]: Stem: 1303#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1304#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1317#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1309#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1299#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1300#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1301#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1302#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1349#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1350#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1351#L535-3 assume !(main_~i~1 < main_~array_size~0); 1348#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1347#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1346#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1345#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1343#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1342#L517-3 assume !(lis_~i~0 < lis_~N); 1341#L517-4 lis_~i~0 := 1; 1339#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1340#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1326#L521 assume !lis_#t~short11; 1310#L521-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1311#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1305#L520-3 assume !(lis_~j~0 < lis_~i~0); 1306#L519-2 [2021-10-28 23:30:17,014 INFO L793 eck$LassoCheckResult]: Loop: 1306#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1314#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1336#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1355#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1357#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1356#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1354#L520-3 assume !(lis_~j~0 < lis_~i~0); 1306#L519-2 [2021-10-28 23:30:17,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:17,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1034472260, now seen corresponding path program 1 times [2021-10-28 23:30:17,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:17,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359838779] [2021-10-28 23:30:17,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:17,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-28 23:30:17,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:30:17,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359838779] [2021-10-28 23:30:17,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359838779] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:30:17,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:30:17,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:30:17,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747552960] [2021-10-28 23:30:17,053 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 23:30:17,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:17,053 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 3 times [2021-10-28 23:30:17,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:17,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776065142] [2021-10-28 23:30:17,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:17,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:17,060 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:17,084 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:17,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:30:17,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:30:17,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:30:17,311 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) [2021-10-28 23:30:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:30:17,326 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2021-10-28 23:30:17,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:30:17,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2021-10-28 23:30:17,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-28 23:30:17,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2021-10-28 23:30:17,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-10-28 23:30:17,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-10-28 23:30:17,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2021-10-28 23:30:17,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 23:30:17,329 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-10-28 23:30:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2021-10-28 23:30:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-10-28 23:30:17,332 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) [2021-10-28 23:30:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2021-10-28 23:30:17,333 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-10-28 23:30:17,333 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-10-28 23:30:17,333 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-28 23:30:17,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2021-10-28 23:30:17,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-28 23:30:17,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:30:17,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:30:17,336 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:17,336 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:17,336 INFO L791 eck$LassoCheckResult]: Stem: 1443#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1444#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1458#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1449#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1438#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1439#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1497#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1496#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1495#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1441#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1440#L535-3 assume !(main_~i~1 < main_~array_size~0); 1442#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1475#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1479#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1480#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1459#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1460#L517-3 assume !(lis_~i~0 < lis_~N); 1476#L517-4 lis_~i~0 := 1; 1477#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1445#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1446#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1506#L521-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1461#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1462#L520-3 assume !(lis_~j~0 < lis_~i~0); 1454#L519-2 [2021-10-28 23:30:17,336 INFO L793 eck$LassoCheckResult]: Loop: 1454#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1455#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1481#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1499#L521 assume !lis_#t~short11; 1501#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1500#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1498#L520-3 assume !(lis_~j~0 < lis_~i~0); 1454#L519-2 [2021-10-28 23:30:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2021-10-28 23:30:17,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:17,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615710820] [2021-10-28 23:30:17,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:17,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:30:17,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:30:17,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615710820] [2021-10-28 23:30:17,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615710820] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:30:17,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869479705] [2021-10-28 23:30:17,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:17,470 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:30:17,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:30:17,475 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:30:17,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-10-28 23:30:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:30:17,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-28 23:30:17,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:30:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 23:30:17,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869479705] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:30:17,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:30:17,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-10-28 23:30:17,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010475832] [2021-10-28 23:30:17,760 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 23:30:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash 782608452, now seen corresponding path program 1 times [2021-10-28 23:30:17,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:17,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616738311] [2021-10-28 23:30:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:17,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:17,766 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:17,771 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:17,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:30:17,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-28 23:30:17,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-10-28 23:30:17,899 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. cyclomatic complexity: 28 Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:30:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:30:18,264 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2021-10-28 23:30:18,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 23:30:18,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 99 transitions. [2021-10-28 23:30:18,266 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-10-28 23:30:18,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 99 transitions. [2021-10-28 23:30:18,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-10-28 23:30:18,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-10-28 23:30:18,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 99 transitions. [2021-10-28 23:30:18,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 23:30:18,267 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 99 transitions. [2021-10-28 23:30:18,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 99 transitions. [2021-10-28 23:30:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2021-10-28 23:30:18,271 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) [2021-10-28 23:30:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2021-10-28 23:30:18,271 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-28 23:30:18,272 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-28 23:30:18,272 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-28 23:30:18,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2021-10-28 23:30:18,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-28 23:30:18,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 23:30:18,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 23:30:18,274 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:30:18,274 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-28 23:30:18,274 INFO L791 eck$LassoCheckResult]: Stem: 1687#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1688#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1702#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1693#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1683#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1684#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1685#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1686#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1725#L535-3 assume !(main_~i~1 < main_~array_size~0); 1727#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1741#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1740#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1739#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1737#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1736#L517-3 assume !(lis_~i~0 < lis_~N); 1719#L517-4 lis_~i~0 := 1; 1705#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1706#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1749#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1747#L521-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1746#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1723#L520-3 assume !(lis_~j~0 < lis_~i~0); 1724#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1743#L519-3 assume !(lis_~i~0 < lis_~N); 1720#L519-4 lis_~i~0 := 0; 1711#L523-3 [2021-10-28 23:30:18,275 INFO L793 eck$LassoCheckResult]: Loop: 1711#L523-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 1712#L524 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 1716#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1711#L523-3 [2021-10-28 23:30:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:18,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2021-10-28 23:30:18,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:18,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403432448] [2021-10-28 23:30:18,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:18,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:18,303 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:18,331 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:18,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 2 times [2021-10-28 23:30:18,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:18,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057888874] [2021-10-28 23:30:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:18,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:18,337 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:18,340 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:18,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:30:18,341 INFO L85 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2021-10-28 23:30:18,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:30:18,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934941454] [2021-10-28 23:30:18,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:30:18,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:30:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:18,373 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:30:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:30:18,406 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:30:24,872 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 23:30:24,872 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 23:30:24,872 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 23:30:24,872 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 23:30:24,872 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-28 23:30:24,872 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 23:30:24,872 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 23:30:24,872 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 23:30:24,872 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration11_Lasso [2021-10-28 23:30:24,872 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 23:30:24,872 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 23:30:24,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:24,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 23:30:25,547 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-28 23:30:25,551 INFO L168 Benchmark]: Toolchain (without parser) took 20099.50 ms. Allocated memory was 98.6 MB in the beginning and 148.9 MB in the end (delta: 50.3 MB). Free memory was 55.6 MB in the beginning and 85.1 MB in the end (delta: -29.5 MB). Peak memory consumption was 77.0 MB. Max. memory is 16.1 GB. [2021-10-28 23:30:25,552 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 98.6 MB. Free memory is still 72.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:30:25,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.06 ms. Allocated memory is still 98.6 MB. Free memory was 55.4 MB in the beginning and 66.6 MB in the end (delta: -11.1 MB). Peak memory consumption was 4.3 MB. Max. memory is 16.1 GB. [2021-10-28 23:30:25,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.10 ms. Allocated memory is still 98.6 MB. Free memory was 66.2 MB in the beginning and 64.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:30:25,553 INFO L168 Benchmark]: Boogie Preprocessor took 34.51 ms. Allocated memory is still 98.6 MB. Free memory was 64.3 MB in the beginning and 62.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:30:25,554 INFO L168 Benchmark]: RCFGBuilder took 499.46 ms. Allocated memory is still 98.6 MB. Free memory was 62.8 MB in the beginning and 50.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-28 23:30:25,554 INFO L168 Benchmark]: BuchiAutomizer took 18906.19 ms. Allocated memory was 98.6 MB in the beginning and 148.9 MB in the end (delta: 50.3 MB). Free memory was 50.6 MB in the beginning and 85.1 MB in the end (delta: -34.5 MB). Peak memory consumption was 74.6 MB. Max. memory is 16.1 GB. [2021-10-28 23:30:25,557 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 98.6 MB. Free memory is still 72.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 598.06 ms. Allocated memory is still 98.6 MB. Free memory was 55.4 MB in the beginning and 66.6 MB in the end (delta: -11.1 MB). Peak memory consumption was 4.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.10 ms. Allocated memory is still 98.6 MB. Free memory was 66.2 MB in the beginning and 64.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.51 ms. Allocated memory is still 98.6 MB. Free memory was 64.3 MB in the beginning and 62.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 499.46 ms. Allocated memory is still 98.6 MB. Free memory was 62.8 MB in the beginning and 50.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 18906.19 ms. Allocated memory was 98.6 MB in the beginning and 148.9 MB in the end (delta: 50.3 MB). Free memory was 50.6 MB in the beginning and 85.1 MB in the end (delta: -34.5 MB). Peak memory consumption was 74.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-28 23:30:25,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:25,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-10-28 23:30:26,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:26,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-10-28 23:30:26,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6a96493-522b-4a9b-97c4-6452a2bff521/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...