./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/eureka_05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/eureka_05.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be --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 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/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: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:35:54,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:35:54,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:35:54,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:35:54,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:35:54,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:35:54,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:35:54,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:35:54,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:35:54,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:35:54,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:35:54,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:35:54,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:35:54,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:35:54,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:35:54,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:35:54,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:35:54,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:35:54,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:35:54,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:35:54,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:35:54,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:35:54,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:35:54,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:35:54,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:35:54,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:35:54,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:35:54,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:35:54,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:35:54,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:35:54,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:35:54,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:35:54,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:35:54,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:35:54,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:35:54,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:35:54,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:35:54,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:35:54,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:35:54,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:35:54,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:35:54,126 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-21 19:35:54,151 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:35:54,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:35:54,152 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:35:54,152 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:35:54,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:35:54,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:35:54,153 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:35:54,154 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-21 19:35:54,154 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-21 19:35:54,154 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-21 19:35:54,154 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-21 19:35:54,155 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-21 19:35:54,155 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-21 19:35:54,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:35:54,155 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:35:54,155 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:35:54,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:35:54,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:35:54,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:35:54,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-21 19:35:54,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-21 19:35:54,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-21 19:35:54,157 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:35:54,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:35:54,157 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-21 19:35:54,157 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:35:54,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-21 19:35:54,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:35:54,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:35:54,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:35:54,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:35:54,159 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:35:54,160 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-21 19:35:54,160 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_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/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_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be 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 -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab [2021-10-21 19:35:54,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:35:54,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:35:54,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:35:54,484 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:35:54,485 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:35:54,486 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/loops/eureka_05.i [2021-10-21 19:35:54,555 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/data/fc6442dee/bd25bea35b2345e780f6d80f9a215604/FLAG39cac99c6 [2021-10-21 19:35:55,090 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:35:55,091 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/sv-benchmarks/c/loops/eureka_05.i [2021-10-21 19:35:55,098 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/data/fc6442dee/bd25bea35b2345e780f6d80f9a215604/FLAG39cac99c6 [2021-10-21 19:35:55,516 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/data/fc6442dee/bd25bea35b2345e780f6d80f9a215604 [2021-10-21 19:35:55,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:35:55,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:35:55,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:35:55,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:35:55,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:35:55,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd14d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55, skipping insertion in model container [2021-10-21 19:35:55,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:35:55,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:35:55,741 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/sv-benchmarks/c/loops/eureka_05.i[810,823] [2021-10-21 19:35:55,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:35:55,766 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:35:55,779 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/sv-benchmarks/c/loops/eureka_05.i[810,823] [2021-10-21 19:35:55,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:35:55,803 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:35:55,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55 WrapperNode [2021-10-21 19:35:55,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:35:55,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:35:55,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:35:55,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:35:55,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:35:55,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:35:55,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:35:55,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:35:55,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:35:55,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:35:55,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:35:55,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:35:55,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55" (1/1) ... [2021-10-21 19:35:55,883 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:35:55,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:35:55,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:35:55,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-21 19:35:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:35:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:35:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 19:35:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:35:55,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:35:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-21 19:35:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 19:35:56,313 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:35:56,328 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-10-21 19:35:56,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:35:56 BoogieIcfgContainer [2021-10-21 19:35:56,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:35:56,331 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-21 19:35:56,331 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-21 19:35:56,335 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-21 19:35:56,336 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:35:56,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.10 07:35:55" (1/3) ... [2021-10-21 19:35:56,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@422b9d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:35:56, skipping insertion in model container [2021-10-21 19:35:56,337 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:35:56,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:35:55" (2/3) ... [2021-10-21 19:35:56,338 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@422b9d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:35:56, skipping insertion in model container [2021-10-21 19:35:56,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:35:56,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:35:56" (3/3) ... [2021-10-21 19:35:56,339 INFO L389 chiAutomizerObserver]: Analyzing ICFG eureka_05.i [2021-10-21 19:35:56,416 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-21 19:35:56,416 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-21 19:35:56,417 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-21 19:35:56,417 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-21 19:35:56,417 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-21 19:35:56,417 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-21 19:35:56,417 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-21 19:35:56,417 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-21 19:35:56,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.5) 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-21 19:35:56,462 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-10-21 19:35:56,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:35:56,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:35:56,469 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 19:35:56,469 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-21 19:35:56,469 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-21 19:35:56,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.5) 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-21 19:35:56,473 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-10-21 19:35:56,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:35:56,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:35:56,473 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 19:35:56,473 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-21 19:35:56,488 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 14#L-1true havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 7#L44-3true [2021-10-21 19:35:56,488 INFO L793 eck$LassoCheckResult]: Loop: 7#L44-3true assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 19#L44-2true main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 7#L44-3true [2021-10-21 19:35:56,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:56,500 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-21 19:35:56,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:56,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642941345] [2021-10-21 19:35:56,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:56,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:35:56,649 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:35:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:35:56,712 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:35:56,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:56,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-10-21 19:35:56,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:56,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702436319] [2021-10-21 19:35:56,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:56,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:35:56,741 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:35:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:35:56,763 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:35:56,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:56,767 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-10-21 19:35:56,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:56,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606416408] [2021-10-21 19:35:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:56,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:35:56,809 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:35:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:35:56,859 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:35:57,797 INFO L210 LassoAnalysis]: Preferences: [2021-10-21 19:35:57,798 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-21 19:35:57,798 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-21 19:35:57,799 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-21 19:35:57,799 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-21 19:35:57,799 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:35:57,800 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-21 19:35:57,800 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-21 19:35:57,800 INFO L133 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration1_Lasso [2021-10-21 19:35:57,801 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-21 19:35:57,801 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-21 19:35:57,838 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-21 19:35:57,845 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-21 19:35:57,872 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-21 19:35:57,876 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-21 19:35:57,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-21 19:35:57,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-21 19:35:58,288 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-21 19:35:58,292 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-21 19:35:58,295 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-21 19:35:58,625 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-21 19:35:58,629 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-21 19:35:58,636 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:35:58,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:35:58,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:35:58,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-10-21 19:35:58,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 19:35:58,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:35:58,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:35:58,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:35:58,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:35:58,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:35:58,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:35:58,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:35:58,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:35:58,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-10-21 19:35:58,723 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:35:58,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:35:58,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:35:58,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 19:35:58,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:35:58,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:35:58,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:35:58,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:35:58,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:35:58,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:35:58,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:35:58,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-10-21 19:35:58,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:35:58,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-10-21 19:35:58,792 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:35:58,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:35:58,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:35:58,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 19:35:58,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:35:58,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:35:58,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:35:58,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:35:58,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:35:58,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:35:58,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-10-21 19:35:58,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:35:58,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-10-21 19:35:58,873 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:35:58,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:35:58,874 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:35:58,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 19:35:58,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:35:58,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:35:58,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:35:58,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:35:58,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:35:58,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:35:58,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:35:58,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-10-21 19:35:58,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:35:58,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-10-21 19:35:58,943 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:35:58,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:35:58,945 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:35:58,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 19:35:58,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:35:58,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:35:58,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:35:58,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:35:58,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:35:58,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:35:58,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-10-21 19:35:58,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:35:59,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-10-21 19:35:59,019 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:35:59,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:35:59,021 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:35:59,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 19:35:59,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:35:59,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:35:59,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:35:59,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:35:59,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:35:59,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:35:59,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-10-21 19:35:59,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:35:59,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-10-21 19:35:59,100 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:35:59,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:35:59,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:35:59,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-10-21 19:35:59,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-21 19:35:59,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:35:59,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:35:59,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:35:59,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:35:59,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:35:59,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:35:59,148 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-21 19:35:59,184 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-10-21 19:35:59,184 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-10-21 19:35:59,185 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:35:59,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:35:59,188 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:35:59,224 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-21 19:35:59,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-10-21 19:35:59,249 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-21 19:35:59,249 INFO L513 LassoAnalysis]: Proved termination. [2021-10-21 19:35:59,249 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#array~1.base)_1) = 8*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~#array~1.base)_1 Supporting invariants [] [2021-10-21 19:35:59,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-10-21 19:35:59,387 INFO L297 tatePredicateManager]: 31 out of 31 supporting invariants were superfluous and have been removed [2021-10-21 19:35:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:35:59,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-21 19:35:59,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:35:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:35:59,448 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-21 19:35:59,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:35:59,486 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-21 19:35:59,501 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-21 19:35:59,503 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.5) 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-21 19:35:59,555 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.5) 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 48 states and 71 transitions. Complement of second has 8 states. [2021-10-21 19:35:59,556 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-21 19:35:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-21 19:35:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2021-10-21 19:35:59,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 2 letters. Loop has 2 letters. [2021-10-21 19:35:59,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:35:59,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 4 letters. Loop has 2 letters. [2021-10-21 19:35:59,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:35:59,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 2 letters. Loop has 4 letters. [2021-10-21 19:35:59,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:35:59,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 71 transitions. [2021-10-21 19:35:59,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-21 19:35:59,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 18 states and 24 transitions. [2021-10-21 19:35:59,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-10-21 19:35:59,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-10-21 19:35:59,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2021-10-21 19:35:59,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:35:59,580 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-10-21 19:35:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2021-10-21 19:35:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-10-21 19:35:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:35:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2021-10-21 19:35:59,608 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-10-21 19:35:59,608 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-10-21 19:35:59,608 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-21 19:35:59,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2021-10-21 19:35:59,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-21 19:35:59,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:35:59,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:35:59,611 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-21 19:35:59,611 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:35:59,612 INFO L791 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 238#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 239#L44-3 assume !(main_~i~1 >= 0); 240#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 236#L30-3 [2021-10-21 19:35:59,612 INFO L793 eck$LassoCheckResult]: Loop: 236#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 249#L32-3 assume !(SelectionSort_~i~0 < ~n~0); 250#L32-4 call SelectionSort_#t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem7;havoc SelectionSort_#t~mem7;call SelectionSort_#t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem8, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem8;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 235#L30-2 SelectionSort_#t~post3 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post3;havoc SelectionSort_#t~post3; 236#L30-3 [2021-10-21 19:35:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-10-21 19:35:59,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:59,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494248852] [2021-10-21 19:35:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:59,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:35:59,687 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-21 19:35:59,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:35:59,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494248852] [2021-10-21 19:35:59,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494248852] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:35:59,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:35:59,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:35:59,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617070528] [2021-10-21 19:35:59,692 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:35:59,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:59,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 1 times [2021-10-21 19:35:59,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:59,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809711466] [2021-10-21 19:35:59,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:59,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:35:59,704 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:35:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:35:59,714 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:35:59,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:35:59,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:35:59,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:35:59,841 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-21 19:35:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:35:59,857 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2021-10-21 19:35:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:35:59,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2021-10-21 19:35:59,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:35:59,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 22 transitions. [2021-10-21 19:35:59,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-10-21 19:35:59,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-10-21 19:35:59,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2021-10-21 19:35:59,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:35:59,860 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-10-21 19:35:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2021-10-21 19:35:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-10-21 19:35:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 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-21 19:35:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-21 19:35:59,863 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-21 19:35:59,863 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-21 19:35:59,863 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-21 19:35:59,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2021-10-21 19:35:59,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:35:59,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:35:59,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:35:59,864 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-10-21 19:35:59,864 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:35:59,865 INFO L791 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 279#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 280#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 281#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 282#L44-3 assume !(main_~i~1 >= 0); 283#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 277#L30-3 [2021-10-21 19:35:59,865 INFO L793 eck$LassoCheckResult]: Loop: 277#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 291#L32-3 assume !(SelectionSort_~i~0 < ~n~0); 292#L32-4 call SelectionSort_#t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem7;havoc SelectionSort_#t~mem7;call SelectionSort_#t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem8, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem8;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 276#L30-2 SelectionSort_#t~post3 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post3;havoc SelectionSort_#t~post3; 277#L30-3 [2021-10-21 19:35:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:59,865 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-10-21 19:35:59,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:59,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488233126] [2021-10-21 19:35:59,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:59,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:35:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:35:59,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:35:59,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488233126] [2021-10-21 19:35:59,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488233126] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:35:59,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883226632] [2021-10-21 19:35:59,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:59,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:35:59,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:35:59,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:35:59,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-21 19:35:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:35:59,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-21 19:35:59,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:35:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:35:59,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883226632] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:35:59,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:35:59,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-10-21 19:35:59,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933782471] [2021-10-21 19:35:59,970 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:35:59,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:35:59,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 2 times [2021-10-21 19:35:59,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:35:59,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018246692] [2021-10-21 19:35:59,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:35:59,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:35:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:35:59,979 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:35:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:35:59,987 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:00,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:00,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:36:00,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:36:00,099 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 7 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-21 19:36:00,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:00,127 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-10-21 19:36:00,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:36:00,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2021-10-21 19:36:00,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:36:00,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2021-10-21 19:36:00,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-10-21 19:36:00,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-10-21 19:36:00,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2021-10-21 19:36:00,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:00,130 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-10-21 19:36:00,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2021-10-21 19:36:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-10-21 19:36:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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-21 19:36:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-10-21 19:36:00,146 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-10-21 19:36:00,146 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-10-21 19:36:00,146 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-21 19:36:00,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2021-10-21 19:36:00,147 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:36:00,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:00,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:00,147 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-10-21 19:36:00,147 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:36:00,148 INFO L791 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 338#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 339#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 340#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 341#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 342#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 353#L44-3 assume !(main_~i~1 >= 0); 343#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 336#L30-3 [2021-10-21 19:36:00,148 INFO L793 eck$LassoCheckResult]: Loop: 336#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 351#L32-3 assume !(SelectionSort_~i~0 < ~n~0); 352#L32-4 call SelectionSort_#t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem7;havoc SelectionSort_#t~mem7;call SelectionSort_#t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem8, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem8;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 335#L30-2 SelectionSort_#t~post3 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post3;havoc SelectionSort_#t~post3; 336#L30-3 [2021-10-21 19:36:00,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:00,148 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2021-10-21 19:36:00,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:00,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071049275] [2021-10-21 19:36:00,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:00,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:00,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-10-21 19:36:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:00,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:00,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071049275] [2021-10-21 19:36:00,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071049275] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:00,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856520016] [2021-10-21 19:36:00,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-21 19:36:00,234 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:00,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:00,241 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:00,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-21 19:36:00,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-21 19:36:00,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:36:00,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-21 19:36:00,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:00,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856520016] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:00,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:36:00,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-10-21 19:36:00,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190758173] [2021-10-21 19:36:00,341 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:36:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:00,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 3 times [2021-10-21 19:36:00,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:00,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359135232] [2021-10-21 19:36:00,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:00,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:00,349 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:00,357 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:00,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:36:00,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:00,462 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-21 19:36:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:00,482 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-10-21 19:36:00,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:36:00,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2021-10-21 19:36:00,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:36:00,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2021-10-21 19:36:00,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-10-21 19:36:00,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-10-21 19:36:00,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2021-10-21 19:36:00,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:00,485 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-10-21 19:36:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2021-10-21 19:36:00,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-10-21 19:36:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-10-21 19:36:00,488 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-10-21 19:36:00,488 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-10-21 19:36:00,488 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-21 19:36:00,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2021-10-21 19:36:00,489 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:36:00,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:00,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:00,490 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2021-10-21 19:36:00,490 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:36:00,490 INFO L791 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 408#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 409#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 410#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 411#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 412#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 423#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 425#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 424#L44-3 assume !(main_~i~1 >= 0); 413#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 406#L30-3 [2021-10-21 19:36:00,490 INFO L793 eck$LassoCheckResult]: Loop: 406#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 421#L32-3 assume !(SelectionSort_~i~0 < ~n~0); 422#L32-4 call SelectionSort_#t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem7;havoc SelectionSort_#t~mem7;call SelectionSort_#t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem8, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem8;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 405#L30-2 SelectionSort_#t~post3 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post3;havoc SelectionSort_#t~post3; 406#L30-3 [2021-10-21 19:36:00,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:00,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2021-10-21 19:36:00,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:00,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282604916] [2021-10-21 19:36:00,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:00,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:00,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:00,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282604916] [2021-10-21 19:36:00,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282604916] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:00,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195556268] [2021-10-21 19:36:00,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-21 19:36:00,534 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:00,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:00,535 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:00,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-21 19:36:00,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-10-21 19:36:00,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:36:00,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-21 19:36:00,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:00,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195556268] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:00,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:36:00,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-10-21 19:36:00,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16449067] [2021-10-21 19:36:00,644 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:36:00,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:00,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 4 times [2021-10-21 19:36:00,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:00,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576717493] [2021-10-21 19:36:00,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:00,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:00,656 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:00,670 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:00,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:00,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:36:00,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:36:00,778 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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-21 19:36:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:00,809 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-10-21 19:36:00,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:36:00,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2021-10-21 19:36:00,811 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:36:00,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2021-10-21 19:36:00,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-10-21 19:36:00,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-10-21 19:36:00,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2021-10-21 19:36:00,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:00,813 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-10-21 19:36:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2021-10-21 19:36:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2021-10-21 19:36:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-10-21 19:36:00,815 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-10-21 19:36:00,815 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-10-21 19:36:00,817 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-21 19:36:00,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2021-10-21 19:36:00,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:36:00,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:00,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:00,820 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-10-21 19:36:00,820 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:36:00,821 INFO L791 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 489#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 490#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 491#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 492#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 493#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 504#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 508#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 507#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 506#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 505#L44-3 assume !(main_~i~1 >= 0); 494#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 487#L30-3 [2021-10-21 19:36:00,821 INFO L793 eck$LassoCheckResult]: Loop: 487#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 502#L32-3 assume !(SelectionSort_~i~0 < ~n~0); 503#L32-4 call SelectionSort_#t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem7;havoc SelectionSort_#t~mem7;call SelectionSort_#t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem8, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem8;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 486#L30-2 SelectionSort_#t~post3 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post3;havoc SelectionSort_#t~post3; 487#L30-3 [2021-10-21 19:36:00,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:00,822 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2021-10-21 19:36:00,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:00,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271887161] [2021-10-21 19:36:00,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:00,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:00,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:00,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271887161] [2021-10-21 19:36:00,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271887161] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:00,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041668692] [2021-10-21 19:36:00,900 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-21 19:36:00,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:00,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:00,902 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:00,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-21 19:36:00,961 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-21 19:36:00,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:36:00,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-21 19:36:00,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:01,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041668692] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:01,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:36:01,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-10-21 19:36:01,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869432898] [2021-10-21 19:36:01,006 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:36:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 5 times [2021-10-21 19:36:01,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725620088] [2021-10-21 19:36:01,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:01,013 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:01,019 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:01,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:01,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:36:01,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:36:01,126 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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-21 19:36:01,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:01,171 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-10-21 19:36:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:36:01,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2021-10-21 19:36:01,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:36:01,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 45 transitions. [2021-10-21 19:36:01,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-10-21 19:36:01,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-10-21 19:36:01,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions. [2021-10-21 19:36:01,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:01,177 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-10-21 19:36:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions. [2021-10-21 19:36:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2021-10-21 19:36:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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-21 19:36:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-10-21 19:36:01,179 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-10-21 19:36:01,179 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-10-21 19:36:01,179 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-21 19:36:01,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2021-10-21 19:36:01,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:36:01,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:01,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:01,180 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-10-21 19:36:01,181 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:36:01,181 INFO L791 eck$LassoCheckResult]: Stem: 595#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 596#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 597#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 598#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 599#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 600#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 617#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 616#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 615#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 614#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 613#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 612#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 611#L44-3 assume !(main_~i~1 >= 0); 601#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 594#L30-3 [2021-10-21 19:36:01,181 INFO L793 eck$LassoCheckResult]: Loop: 594#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 609#L32-3 assume !(SelectionSort_~i~0 < ~n~0); 610#L32-4 call SelectionSort_#t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem7;havoc SelectionSort_#t~mem7;call SelectionSort_#t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem8, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem8;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 593#L30-2 SelectionSort_#t~post3 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post3;havoc SelectionSort_#t~post3; 594#L30-3 [2021-10-21 19:36:01,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2021-10-21 19:36:01,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284066383] [2021-10-21 19:36:01,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:01,195 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:01,221 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 6 times [2021-10-21 19:36:01,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161105908] [2021-10-21 19:36:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:01,228 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:01,233 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:01,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,234 INFO L82 PathProgramCache]: Analyzing trace with hash -743535747, now seen corresponding path program 1 times [2021-10-21 19:36:01,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096944649] [2021-10-21 19:36:01,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-21 19:36:01,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:01,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096944649] [2021-10-21 19:36:01,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096944649] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:01,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:01,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:36:01,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432534117] [2021-10-21 19:36:01,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:01,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:36:01,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:01,391 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 2.0) 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-21 19:36:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:01,435 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2021-10-21 19:36:01,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:36:01,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2021-10-21 19:36:01,437 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-10-21 19:36:01,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2021-10-21 19:36:01,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-10-21 19:36:01,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-10-21 19:36:01,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2021-10-21 19:36:01,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:01,438 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-10-21 19:36:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2021-10-21 19:36:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2021-10-21 19:36:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 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-21 19:36:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-10-21 19:36:01,440 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-10-21 19:36:01,440 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-10-21 19:36:01,440 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-21 19:36:01,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2021-10-21 19:36:01,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:36:01,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:01,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:01,442 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:01,442 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-21 19:36:01,442 INFO L791 eck$LassoCheckResult]: Stem: 666#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 667#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 668#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 669#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 670#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 671#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 690#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 689#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 688#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 687#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 686#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 685#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 684#L44-3 assume !(main_~i~1 >= 0); 672#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 673#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 682#L32-3 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem6 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 678#L33 [2021-10-21 19:36:01,442 INFO L793 eck$LassoCheckResult]: Loop: 678#L33 assume SelectionSort_#t~mem5 < SelectionSort_#t~mem6;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem6;SelectionSort_~rh~0 := SelectionSort_~i~0; 679#L32-2 SelectionSort_#t~post4 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post4;havoc SelectionSort_#t~post4; 681#L32-3 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem6 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 678#L33 [2021-10-21 19:36:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425501, now seen corresponding path program 1 times [2021-10-21 19:36:01,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661215631] [2021-10-21 19:36:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:01,472 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:01,489 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,490 INFO L82 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 1 times [2021-10-21 19:36:01,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605044790] [2021-10-21 19:36:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:01,494 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:01,498 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1574719937, now seen corresponding path program 1 times [2021-10-21 19:36:01,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:01,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246910170] [2021-10-21 19:36:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-21 19:36:01,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:01,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246910170] [2021-10-21 19:36:01,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246910170] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:36:01,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275616588] [2021-10-21 19:36:01,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:01,851 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:36:01,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:01,857 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:36:01,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-21 19:36:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:01,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-21 19:36:01,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:36:02,030 INFO L354 Elim1Store]: treesize reduction 83, result has 23.9 percent of original size [2021-10-21 19:36:02,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 31 [2021-10-21 19:36:02,295 INFO L354 Elim1Store]: treesize reduction 44, result has 45.7 percent of original size [2021-10-21 19:36:02,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 62 [2021-10-21 19:36:02,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:36:02,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-10-21 19:36:02,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:36:02,516 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-21 19:36:02,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2021-10-21 19:36:02,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:36:02,620 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-21 19:36:02,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2021-10-21 19:36:02,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:36:02,711 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-21 19:36:02,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2021-10-21 19:36:02,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:36:02,814 INFO L354 Elim1Store]: treesize reduction 140, result has 16.7 percent of original size [2021-10-21 19:36:02,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 52 [2021-10-21 19:38:03,053 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 30 [2021-10-21 19:38:27,265 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 32 [2021-10-21 19:38:51,437 WARN L207 SmtUtils]: Spent 12.04 s on a formula simplification that was a NOOP. DAG size: 35 [2021-10-21 19:38:51,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-21 19:38:51,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:38:51,502 INFO L354 Elim1Store]: treesize reduction 117, result has 2.5 percent of original size [2021-10-21 19:38:51,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 26 [2021-10-21 19:38:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-21 19:38:51,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275616588] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:38:51,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:38:51,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-10-21 19:38:51,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915408665] [2021-10-21 19:38:51,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:38:51,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-21 19:38:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=189, Unknown=11, NotChecked=0, Total=240 [2021-10-21 19:38:51,666 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:39:15,756 WARN L207 SmtUtils]: Spent 24.05 s on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-10-21 19:41:04,111 WARN L207 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2021-10-21 19:41:28,240 WARN L207 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2021-10-21 19:41:40,383 WARN L207 SmtUtils]: Spent 12.12 s on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2021-10-21 19:42:04,506 WARN L207 SmtUtils]: Spent 24.10 s on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2021-10-21 19:44:43,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:44:43,248 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2021-10-21 19:44:43,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:44:43,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2021-10-21 19:44:43,250 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-10-21 19:44:43,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 42 transitions. [2021-10-21 19:44:43,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-10-21 19:44:43,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-10-21 19:44:43,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2021-10-21 19:44:43,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:44:43,251 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2021-10-21 19:44:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2021-10-21 19:44:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2021-10-21 19:44:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 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-21 19:44:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-10-21 19:44:43,254 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-10-21 19:44:43,254 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-10-21 19:44:43,254 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-21 19:44:43,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2021-10-21 19:44:43,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:44:43,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:44:43,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:44:43,255 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:44:43,255 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-21 19:44:43,256 INFO L791 eck$LassoCheckResult]: Stem: 821#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 822#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 823#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 824#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 825#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 826#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 845#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 844#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 843#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 842#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 841#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 840#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 839#L44-3 assume !(main_~i~1 >= 0); 827#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 828#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 837#L32-3 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem6 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 833#L33 assume !(SelectionSort_#t~mem5 < SelectionSort_#t~mem6);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem6; 834#L32-2 [2021-10-21 19:44:43,256 INFO L793 eck$LassoCheckResult]: Loop: 834#L32-2 SelectionSort_#t~post4 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post4;havoc SelectionSort_#t~post4; 836#L32-3 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem6 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 846#L33 assume SelectionSort_#t~mem5 < SelectionSort_#t~mem6;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem6;SelectionSort_~rh~0 := SelectionSort_~i~0; 834#L32-2 [2021-10-21 19:44:43,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:44:43,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1638583016, now seen corresponding path program 1 times [2021-10-21 19:44:43,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:44:43,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025026730] [2021-10-21 19:44:43,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:44:43,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:44:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:44:43,272 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:44:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:44:43,289 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:44:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:44:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 2 times [2021-10-21 19:44:43,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:44:43,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227302605] [2021-10-21 19:44:43,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:44:43,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:44:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:44:43,295 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:44:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:44:43,300 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:44:43,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:44:43,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1571618174, now seen corresponding path program 1 times [2021-10-21 19:44:43,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:44:43,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402835111] [2021-10-21 19:44:43,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:44:43,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:44:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:44:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-21 19:44:43,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:44:43,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402835111] [2021-10-21 19:44:43,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402835111] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:44:43,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244241150] [2021-10-21 19:44:43,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:44:43,714 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:44:43,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:44:43,720 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:44:43,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-10-21 19:44:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:44:43,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-21 19:44:43,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:44:43,898 INFO L354 Elim1Store]: treesize reduction 83, result has 23.9 percent of original size [2021-10-21 19:44:43,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 31 [2021-10-21 19:44:44,124 INFO L354 Elim1Store]: treesize reduction 44, result has 45.7 percent of original size [2021-10-21 19:44:44,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 62 [2021-10-21 19:44:44,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:44:44,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-10-21 19:44:44,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:44:44,370 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-21 19:44:44,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2021-10-21 19:44:44,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:44:44,468 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-21 19:44:44,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2021-10-21 19:44:44,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:44:44,592 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-21 19:44:44,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2021-10-21 19:44:44,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:44:44,708 INFO L354 Elim1Store]: treesize reduction 140, result has 16.7 percent of original size [2021-10-21 19:44:44,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 52 [2021-10-21 19:45:20,815 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 31 [2021-10-21 19:45:33,035 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 33 [2021-10-21 19:45:45,156 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 36 [2021-10-21 19:45:57,414 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 36 [2021-10-21 19:45:57,442 INFO L354 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2021-10-21 19:45:57,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 23 [2021-10-21 19:45:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-21 19:45:57,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244241150] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:45:57,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:45:57,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2021-10-21 19:45:57,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657635254] [2021-10-21 19:45:57,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:45:57,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-21 19:45:57,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=295, Unknown=2, NotChecked=0, Total=342 [2021-10-21 19:45:57,573 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 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-21 19:46:06,761 WARN L228 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-10-21 19:46:06,762 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:241) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:260) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:174) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:950) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:530) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:237) ... 47 more [2021-10-21 19:46:06,769 INFO L168 Benchmark]: Toolchain (without parser) took 611247.01 ms. Allocated memory was 79.7 MB in the beginning and 127.9 MB in the end (delta: 48.2 MB). Free memory was 36.5 MB in the beginning and 62.0 MB in the end (delta: -25.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:46:06,769 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 79.7 MB. Free memory is still 53.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:46:06,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.62 ms. Allocated memory is still 102.8 MB. Free memory was 82.1 MB in the beginning and 73.8 MB in the end (delta: 8.3 MB). Peak memory consumption was 6.6 MB. Max. memory is 16.1 GB. [2021-10-21 19:46:06,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.53 ms. Allocated memory is still 102.8 MB. Free memory was 73.8 MB in the beginning and 72.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:46:06,770 INFO L168 Benchmark]: Boogie Preprocessor took 27.34 ms. Allocated memory is still 102.8 MB. Free memory was 72.3 MB in the beginning and 71.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:46:06,770 INFO L168 Benchmark]: RCFGBuilder took 457.66 ms. Allocated memory is still 102.8 MB. Free memory was 71.1 MB in the beginning and 73.5 MB in the end (delta: -2.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:46:06,770 INFO L168 Benchmark]: BuchiAutomizer took 610436.66 ms. Allocated memory was 102.8 MB in the beginning and 127.9 MB in the end (delta: 25.2 MB). Free memory was 73.5 MB in the beginning and 62.0 MB in the end (delta: 11.4 MB). Peak memory consumption was 39.0 MB. Max. memory is 16.1 GB. [2021-10-21 19:46:06,772 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2021-10-21 19:46:06,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 101 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 79.7 MB. Free memory is still 53.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 257.62 ms. Allocated memory is still 102.8 MB. Free memory was 82.1 MB in the beginning and 73.8 MB in the end (delta: 8.3 MB). Peak memory consumption was 6.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.53 ms. Allocated memory is still 102.8 MB. Free memory was 73.8 MB in the beginning and 72.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.34 ms. Allocated memory is still 102.8 MB. Free memory was 72.3 MB in the beginning and 71.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 457.66 ms. Allocated memory is still 102.8 MB. Free memory was 71.1 MB in the beginning and 73.5 MB in the end (delta: -2.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 610436.66 ms. Allocated memory was 102.8 MB in the beginning and 127.9 MB in the end (delta: 25.2 MB). Free memory was 73.5 MB in the beginning and 62.0 MB in the end (delta: 11.4 MB). Peak memory consumption was 39.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:241) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-21 19:46:06,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-10-21 19:46:07,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-10-21 19:46:07,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:07,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:07,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:07,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89263dc2-af03-407d-a8dc-7a68e81eea76/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 Received shutdown request...