./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-pthread/cs_stateful-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 0da80933e3d711248e6ba213a8030ef9a1ae2602 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 05:17:18,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 05:17:18,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 05:17:18,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 05:17:18,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 05:17:18,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 05:17:18,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 05:17:18,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 05:17:18,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 05:17:18,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 05:17:18,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 05:17:18,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 05:17:18,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 05:17:18,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 05:17:18,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 05:17:18,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 05:17:18,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 05:17:18,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 05:17:18,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 05:17:18,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 05:17:18,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 05:17:18,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 05:17:18,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 05:17:18,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 05:17:18,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 05:17:18,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 05:17:18,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 05:17:18,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 05:17:18,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 05:17:18,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 05:17:18,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 05:17:18,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 05:17:18,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 05:17:18,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 05:17:18,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 05:17:18,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 05:17:18,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 05:17:18,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 05:17:18,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 05:17:18,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 05:17:18,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 05:17:18,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 05:17:18,873 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 05:17:18,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 05:17:18,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 05:17:18,874 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 05:17:18,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 05:17:18,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 05:17:18,875 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 05:17:18,875 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 05:17:18,875 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 05:17:18,875 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 05:17:18,875 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 05:17:18,875 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 05:17:18,876 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 05:17:18,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 05:17:18,876 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 05:17:18,876 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 05:17:18,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 05:17:18,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 05:17:18,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 05:17:18,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 05:17:18,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 05:17:18,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 05:17:18,877 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 05:17:18,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 05:17:18,877 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 05:17:18,877 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 05:17:18,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 05:17:18,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 05:17:18,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 05:17:18,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 05:17:18,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 05:17:18,878 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 05:17:18,879 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 05:17:18,879 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 0da80933e3d711248e6ba213a8030ef9a1ae2602 [2021-08-31 05:17:19,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 05:17:19,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 05:17:19,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 05:17:19,157 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 05:17:19,159 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 05:17:19,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2021-08-31 05:17:19,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a29d9adce/1446766538624f4caeee4cdcad3e6bd3/FLAG49745732e [2021-08-31 05:17:19,612 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 05:17:19,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2021-08-31 05:17:19,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a29d9adce/1446766538624f4caeee4cdcad3e6bd3/FLAG49745732e [2021-08-31 05:17:19,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a29d9adce/1446766538624f4caeee4cdcad3e6bd3 [2021-08-31 05:17:19,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 05:17:19,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 05:17:19,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 05:17:19,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 05:17:19,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 05:17:19,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:17:19" (1/1) ... [2021-08-31 05:17:19,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e86340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:19, skipping insertion in model container [2021-08-31 05:17:19,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:17:19" (1/1) ... [2021-08-31 05:17:19,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 05:17:19,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 05:17:19,916 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i[23400,23413] [2021-08-31 05:17:19,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:17:19,981 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 05:17:20,016 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i[23400,23413] [2021-08-31 05:17:20,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:17:20,086 INFO L208 MainTranslator]: Completed translation [2021-08-31 05:17:20,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:20 WrapperNode [2021-08-31 05:17:20,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 05:17:20,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 05:17:20,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 05:17:20,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 05:17:20,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:20" (1/1) ... [2021-08-31 05:17:20,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:20" (1/1) ... [2021-08-31 05:17:20,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 05:17:20,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 05:17:20,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 05:17:20,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 05:17:20,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:20" (1/1) ... [2021-08-31 05:17:20,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:20" (1/1) ... [2021-08-31 05:17:20,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:20" (1/1) ... [2021-08-31 05:17:20,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:20" (1/1) ... [2021-08-31 05:17:20,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:20" (1/1) ... [2021-08-31 05:17:20,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:20" (1/1) ... [2021-08-31 05:17:20,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:20" (1/1) ... [2021-08-31 05:17:20,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 05:17:20,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 05:17:20,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 05:17:20,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 05:17:20,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:20" (1/1) ... [2021-08-31 05:17:20,322 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:17:20,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:17:20,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:17:20,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-31 05:17:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-31 05:17:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-31 05:17:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-31 05:17:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 05:17:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-31 05:17:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-31 05:17:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-31 05:17:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 05:17:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 05:17:20,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 05:17:20,561 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-31 05:17:20,562 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-31 05:17:20,572 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-31 05:17:20,573 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-31 05:17:20,598 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-31 05:17:20,599 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-31 05:17:21,068 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##706: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-31 05:17:21,068 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##707: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-31 05:17:21,069 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##713: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-31 05:17:21,069 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##714: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-31 05:17:21,069 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-10: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-08-31 05:17:21,069 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-10: assume !(0 != ~__CS_ret~0 % 256); [2021-08-31 05:17:21,069 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-08-31 05:17:21,069 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5; [2021-08-31 05:17:21,069 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-08-31 05:17:21,070 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume !(0 != ~__CS_ret~0 % 256); [2021-08-31 05:17:21,070 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-38: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-08-31 05:17:21,070 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-38: assume !(0 != ~__CS_ret~0 % 256); [2021-08-31 05:17:21,070 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-39: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-08-31 05:17:21,071 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-39: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5; [2021-08-31 05:17:21,071 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-40: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-08-31 05:17:21,071 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-40: assume !(0 != ~__CS_ret~0 % 256); [2021-08-31 05:17:21,071 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-66: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-08-31 05:17:21,071 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-66: assume !(0 != ~__CS_ret~0 % 256); [2021-08-31 05:17:21,071 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-67: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-08-31 05:17:21,071 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-67: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5; [2021-08-31 05:17:21,072 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-68: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-08-31 05:17:21,072 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-68: assume !(0 != ~__CS_ret~0 % 256); [2021-08-31 05:17:21,072 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-31 05:17:21,073 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-08-31 05:17:21,073 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-32: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-31 05:17:21,073 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-30: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-31 05:17:21,076 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-30: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-31 05:17:21,077 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-32: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-31 05:17:21,077 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-31 05:17:21,077 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-31 05:17:21,077 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-35: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-31 05:17:21,077 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-31 05:17:21,077 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-31 05:17:21,077 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-38: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-31 05:17:21,078 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-31 05:17:21,078 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-08-31 05:17:21,078 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-110: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-31 05:17:21,078 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##419: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-31 05:17:21,078 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##418: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-31 05:17:21,079 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-31 05:17:21,079 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##425: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-31 05:17:21,079 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-114: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-31 05:17:21,079 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-114: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-31 05:17:21,080 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-116: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-31 05:17:21,080 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-117: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-31 05:17:21,080 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-117: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-31 05:17:21,080 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-119: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-31 05:17:21,080 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-120: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-31 05:17:21,081 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-120: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-31 05:17:21,081 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-122: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-31 05:17:21,081 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-31 05:17:21,081 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-08-31 05:17:21,081 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-188: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-31 05:17:21,081 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-198: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-31 05:17:21,081 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-198: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-31 05:17:21,082 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-200: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-31 05:17:21,082 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-201: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-31 05:17:21,082 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-201: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-31 05:17:21,082 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-203: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-31 05:17:21,082 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-204: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-08-31 05:17:21,083 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-204: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-08-31 05:17:21,083 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-206: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6;havoc __CS_cs_#t~ite7; [2021-08-31 05:17:21,083 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-31 05:17:21,083 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-31 05:17:21,083 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-08-31 05:17:21,084 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2021-08-31 05:17:21,096 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 05:17:21,097 INFO L299 CfgBuilder]: Removed 288 assume(true) statements. [2021-08-31 05:17:21,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:17:21 BoogieIcfgContainer [2021-08-31 05:17:21,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 05:17:21,101 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 05:17:21,101 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 05:17:21,103 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 05:17:21,103 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:17:21,104 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 05:17:19" (1/3) ... [2021-08-31 05:17:21,104 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e0d175b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:17:21, skipping insertion in model container [2021-08-31 05:17:21,104 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:17:21,104 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:17:20" (2/3) ... [2021-08-31 05:17:21,105 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e0d175b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:17:21, skipping insertion in model container [2021-08-31 05:17:21,105 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:17:21,105 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:17:21" (3/3) ... [2021-08-31 05:17:21,106 INFO L389 chiAutomizerObserver]: Analyzing ICFG cs_stateful-1.i [2021-08-31 05:17:21,143 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 05:17:21,143 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 05:17:21,143 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 05:17:21,144 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 05:17:21,144 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 05:17:21,144 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 05:17:21,144 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 05:17:21,144 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 05:17:21,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 571 states, 570 states have (on average 1.5578947368421052) internal successors, (888), 570 states have internal predecessors, (888), 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-08-31 05:17:21,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-31 05:17:21,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:17:21,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:17:21,232 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:17:21,232 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-31 05:17:21,233 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 05:17:21,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 571 states, 570 states have (on average 1.5578947368421052) internal successors, (888), 570 states have internal predecessors, (888), 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-08-31 05:17:21,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-31 05:17:21,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:17:21,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:17:21,240 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:17:21,241 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-31 05:17:21,245 INFO L791 eck$LassoCheckResult]: Stem: 552#ULTIMATE.startENTRYtrue havoc ULTIMATE.init_#t~nondet99, ULTIMATE.init_#t~nondet100, ULTIMATE.init_#t~nondet101, ULTIMATE.init_#t~nondet102, ULTIMATE.init_#t~nondet103, ULTIMATE.init_#t~nondet104;#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(16);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];call ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call ~#ma~0.base, ~#ma~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call ~#mb~0.base, ~#mb~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call ~#data1~0.base, ~#data1~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call ~#data2~0.base, ~#data2~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet99];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104];havoc ULTIMATE.init_#t~nondet99;havoc ULTIMATE.init_#t~nondet100;havoc ULTIMATE.init_#t~nondet101;havoc ULTIMATE.init_#t~nondet102;havoc ULTIMATE.init_#t~nondet103;havoc ULTIMATE.init_#t~nondet104; 480#L-1true havoc main_#res;havoc main_#t~nondet51, main_#t~nondet52, main_#t~pre50, main_~j~2, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~pre49, main_~i~0, main_#t~mem57, main_#t~mem58, main_#t~mem59, main_#t~mem60.base, main_#t~mem60.offset, main_#t~mem61.base, main_#t~mem61.offset, main_#t~mem62.base, main_#t~mem62.offset, main_#t~mem63, main_#t~mem64, main_#t~mem65, main_#t~mem66, main_#t~mem67, main_#t~mem68, main_#t~ret70.base, main_#t~ret70.offset, main_#t~mem71, main_#t~mem72, main_#t~ret74.base, main_#t~ret74.offset, main_#t~mem75, main_#t~mem76, main_#t~ret78.base, main_#t~ret78.offset, main_#t~mem79, main_#t~mem80, main_#t~mem81, main_#t~mem82, main_#t~mem83, main_#t~mem84, main_#t~mem85.base, main_#t~mem85.offset, main_#t~mem86.base, main_#t~mem86.offset, main_#t~mem87.base, main_#t~mem87.offset, main_#t~mem88.base, main_#t~mem88.offset, main_#t~mem89.base, main_#t~mem89.offset, main_#t~mem90.base, main_#t~mem90.offset, main_#t~mem91, main_#t~mem92, main_#t~mem93, main_#t~mem94, main_#t~mem95, main_#t~mem96, main_#t~mem97, main_#t~mem98, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset, main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset;call main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset := #Ultimate.allocOnStack(8);main_~i~0 := 0; 198#L758-3true [2021-08-31 05:17:21,246 INFO L793 eck$LassoCheckResult]: Loop: 198#L758-3true assume !!(main_~i~0 < 2);main_~j~2 := 0; 191#L759-3true assume !(main_~j~2 < 3); 401#L759-4true call write~int(main_#t~nondet53, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset + main_~i~0, 1);havoc main_#t~nondet53;call write~int(main_#t~nondet54, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset + main_~i~0, 1);havoc main_#t~nondet54;call write~int(main_#t~nondet55, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet55;call write~int(main_#t~nondet56, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet56; 9#L758-2true main_#t~pre49 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre49; 198#L758-3true [2021-08-31 05:17:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:17:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 05:17:21,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:17:21,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207988112] [2021-08-31 05:17:21,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:17:21,260 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:17:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:17:21,409 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:17:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:17:21,488 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:17:21,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:17:21,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1237577, now seen corresponding path program 1 times [2021-08-31 05:17:21,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:17:21,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066012561] [2021-08-31 05:17:21,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:17:21,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:17:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:17:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:17:21,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:17:21,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066012561] [2021-08-31 05:17:21,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066012561] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:17:21,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:17:21,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 05:17:21,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131862931] [2021-08-31 05:17:21,571 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 05:17:21,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:17:21,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 05:17:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 05:17:21,598 INFO L87 Difference]: Start difference. First operand has 571 states, 570 states have (on average 1.5578947368421052) internal successors, (888), 570 states have internal predecessors, (888), 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), 2 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-08-31 05:17:23,112 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-08-31 05:17:35,129 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-08-31 05:17:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:17:36,524 INFO L93 Difference]: Finished difference Result 573 states and 796 transitions. [2021-08-31 05:17:36,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 05:17:36,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 573 states and 796 transitions. [2021-08-31 05:17:36,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-08-31 05:17:36,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 573 states to 9 states and 10 transitions. [2021-08-31 05:17:36,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-08-31 05:17:36,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-08-31 05:17:36,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2021-08-31 05:17:36,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:17:36,541 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-08-31 05:17:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2021-08-31 05:17:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2021-08-31 05:17:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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-08-31 05:17:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-08-31 05:17:36,563 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-08-31 05:17:36,563 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-08-31 05:17:36,563 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 05:17:36,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2021-08-31 05:17:36,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-31 05:17:36,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:17:36,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:17:36,564 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:17:36,564 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-08-31 05:17:36,564 INFO L791 eck$LassoCheckResult]: Stem: 1156#ULTIMATE.startENTRY havoc ULTIMATE.init_#t~nondet99, ULTIMATE.init_#t~nondet100, ULTIMATE.init_#t~nondet101, ULTIMATE.init_#t~nondet102, ULTIMATE.init_#t~nondet103, ULTIMATE.init_#t~nondet104;#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(16);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];call ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call ~#ma~0.base, ~#ma~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call ~#mb~0.base, ~#mb~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call ~#data1~0.base, ~#data1~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call ~#data2~0.base, ~#data2~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet99];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104];havoc ULTIMATE.init_#t~nondet99;havoc ULTIMATE.init_#t~nondet100;havoc ULTIMATE.init_#t~nondet101;havoc ULTIMATE.init_#t~nondet102;havoc ULTIMATE.init_#t~nondet103;havoc ULTIMATE.init_#t~nondet104; 1157#L-1 havoc main_#res;havoc main_#t~nondet51, main_#t~nondet52, main_#t~pre50, main_~j~2, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~pre49, main_~i~0, main_#t~mem57, main_#t~mem58, main_#t~mem59, main_#t~mem60.base, main_#t~mem60.offset, main_#t~mem61.base, main_#t~mem61.offset, main_#t~mem62.base, main_#t~mem62.offset, main_#t~mem63, main_#t~mem64, main_#t~mem65, main_#t~mem66, main_#t~mem67, main_#t~mem68, main_#t~ret70.base, main_#t~ret70.offset, main_#t~mem71, main_#t~mem72, main_#t~ret74.base, main_#t~ret74.offset, main_#t~mem75, main_#t~mem76, main_#t~ret78.base, main_#t~ret78.offset, main_#t~mem79, main_#t~mem80, main_#t~mem81, main_#t~mem82, main_#t~mem83, main_#t~mem84, main_#t~mem85.base, main_#t~mem85.offset, main_#t~mem86.base, main_#t~mem86.offset, main_#t~mem87.base, main_#t~mem87.offset, main_#t~mem88.base, main_#t~mem88.offset, main_#t~mem89.base, main_#t~mem89.offset, main_#t~mem90.base, main_#t~mem90.offset, main_#t~mem91, main_#t~mem92, main_#t~mem93, main_#t~mem94, main_#t~mem95, main_#t~mem96, main_#t~mem97, main_#t~mem98, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset, main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset;call main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset := #Ultimate.allocOnStack(8);main_~i~0 := 0; 1159#L758-3 [2021-08-31 05:17:36,564 INFO L793 eck$LassoCheckResult]: Loop: 1159#L758-3 assume !!(main_~i~0 < 2);main_~j~2 := 0; 1153#L759-3 assume !!(main_~j~2 < 3);call write~int(main_#t~nondet51, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet51;call write~$Pointer$(0, (if main_#t~nondet52 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet52 % 4294967296 % 4294967296 else main_#t~nondet52 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet52; 1154#L759-2 main_#t~pre50 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre50; 1155#L759-3 assume !(main_~j~2 < 3); 1160#L759-4 call write~int(main_#t~nondet53, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset + main_~i~0, 1);havoc main_#t~nondet53;call write~int(main_#t~nondet54, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset + main_~i~0, 1);havoc main_#t~nondet54;call write~int(main_#t~nondet55, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet55;call write~int(main_#t~nondet56, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet56; 1158#L758-2 main_#t~pre49 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre49; 1159#L758-3 [2021-08-31 05:17:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:17:36,564 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-31 05:17:36,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:17:36,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720530109] [2021-08-31 05:17:36,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:17:36,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:17:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:17:36,585 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:17:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:17:36,607 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:17:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:17:36,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1191030535, now seen corresponding path program 1 times [2021-08-31 05:17:36,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:17:36,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462321699] [2021-08-31 05:17:36,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:17:36,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:17:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:17:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:17:36,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:17:36,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462321699] [2021-08-31 05:17:36,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462321699] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:17:36,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985472977] [2021-08-31 05:17:36,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:17:36,643 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:17:36,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:17:36,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:17:36,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-31 05:17:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:17:36,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 05:17:36,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:17:36,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:17:36,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:17:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:17:36,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985472977] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:17:36,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:17:36,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-08-31 05:17:36,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326469626] [2021-08-31 05:17:36,807 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 05:17:36,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:17:36,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 05:17:36,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-31 05:17:36,808 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 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-08-31 05:17:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:17:36,864 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2021-08-31 05:17:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 05:17:36,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2021-08-31 05:17:36,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2021-08-31 05:17:36,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2021-08-31 05:17:36,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-08-31 05:17:36,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-08-31 05:17:36,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2021-08-31 05:17:36,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:17:36,866 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-08-31 05:17:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2021-08-31 05:17:36,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-08-31 05:17:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:17:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-08-31 05:17:36,867 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-08-31 05:17:36,867 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-08-31 05:17:36,867 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 05:17:36,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2021-08-31 05:17:36,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2021-08-31 05:17:36,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:17:36,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:17:36,868 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:17:36,868 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 1, 1, 1, 1] [2021-08-31 05:17:36,868 INFO L791 eck$LassoCheckResult]: Stem: 1214#ULTIMATE.startENTRY havoc ULTIMATE.init_#t~nondet99, ULTIMATE.init_#t~nondet100, ULTIMATE.init_#t~nondet101, ULTIMATE.init_#t~nondet102, ULTIMATE.init_#t~nondet103, ULTIMATE.init_#t~nondet104;#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(16);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];call ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call ~#ma~0.base, ~#ma~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call ~#mb~0.base, ~#mb~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call ~#data1~0.base, ~#data1~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call ~#data2~0.base, ~#data2~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet99];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104];havoc ULTIMATE.init_#t~nondet99;havoc ULTIMATE.init_#t~nondet100;havoc ULTIMATE.init_#t~nondet101;havoc ULTIMATE.init_#t~nondet102;havoc ULTIMATE.init_#t~nondet103;havoc ULTIMATE.init_#t~nondet104; 1215#L-1 havoc main_#res;havoc main_#t~nondet51, main_#t~nondet52, main_#t~pre50, main_~j~2, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~pre49, main_~i~0, main_#t~mem57, main_#t~mem58, main_#t~mem59, main_#t~mem60.base, main_#t~mem60.offset, main_#t~mem61.base, main_#t~mem61.offset, main_#t~mem62.base, main_#t~mem62.offset, main_#t~mem63, main_#t~mem64, main_#t~mem65, main_#t~mem66, main_#t~mem67, main_#t~mem68, main_#t~ret70.base, main_#t~ret70.offset, main_#t~mem71, main_#t~mem72, main_#t~ret74.base, main_#t~ret74.offset, main_#t~mem75, main_#t~mem76, main_#t~ret78.base, main_#t~ret78.offset, main_#t~mem79, main_#t~mem80, main_#t~mem81, main_#t~mem82, main_#t~mem83, main_#t~mem84, main_#t~mem85.base, main_#t~mem85.offset, main_#t~mem86.base, main_#t~mem86.offset, main_#t~mem87.base, main_#t~mem87.offset, main_#t~mem88.base, main_#t~mem88.offset, main_#t~mem89.base, main_#t~mem89.offset, main_#t~mem90.base, main_#t~mem90.offset, main_#t~mem91, main_#t~mem92, main_#t~mem93, main_#t~mem94, main_#t~mem95, main_#t~mem96, main_#t~mem97, main_#t~mem98, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset, main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset;call main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset := #Ultimate.allocOnStack(8);main_~i~0 := 0; 1217#L758-3 [2021-08-31 05:17:36,868 INFO L793 eck$LassoCheckResult]: Loop: 1217#L758-3 assume !!(main_~i~0 < 2);main_~j~2 := 0; 1211#L759-3 assume !!(main_~j~2 < 3);call write~int(main_#t~nondet51, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet51;call write~$Pointer$(0, (if main_#t~nondet52 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet52 % 4294967296 % 4294967296 else main_#t~nondet52 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet52; 1212#L759-2 main_#t~pre50 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre50; 1213#L759-3 assume !!(main_~j~2 < 3);call write~int(main_#t~nondet51, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet51;call write~$Pointer$(0, (if main_#t~nondet52 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet52 % 4294967296 % 4294967296 else main_#t~nondet52 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet52; 1222#L759-2 main_#t~pre50 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre50; 1221#L759-3 assume !!(main_~j~2 < 3);call write~int(main_#t~nondet51, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet51;call write~$Pointer$(0, (if main_#t~nondet52 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet52 % 4294967296 % 4294967296 else main_#t~nondet52 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet52; 1220#L759-2 main_#t~pre50 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre50; 1219#L759-3 assume !(main_~j~2 < 3); 1218#L759-4 call write~int(main_#t~nondet53, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset + main_~i~0, 1);havoc main_#t~nondet53;call write~int(main_#t~nondet54, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset + main_~i~0, 1);havoc main_#t~nondet54;call write~int(main_#t~nondet55, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet55;call write~int(main_#t~nondet56, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet56; 1216#L758-2 main_#t~pre49 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre49; 1217#L758-3 [2021-08-31 05:17:36,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:17:36,870 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-31 05:17:36,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:17:36,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644555108] [2021-08-31 05:17:36,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:17:36,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:17:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:17:36,907 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:17:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:17:36,937 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:17:36,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:17:36,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2055044605, now seen corresponding path program 2 times [2021-08-31 05:17:36,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:17:36,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928411580] [2021-08-31 05:17:36,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:17:36,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:17:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:17:36,960 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:17:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:17:36,977 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:17:36,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:17:36,983 INFO L82 PathProgramCache]: Analyzing trace with hash 149568325, now seen corresponding path program 1 times [2021-08-31 05:17:36,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:17:36,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20472597] [2021-08-31 05:17:36,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:17:36,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:17:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:17:37,058 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:17:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:17:37,125 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:47,597 WARN L210 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 320 DAG size of output: 298 [2021-08-31 05:18:49,645 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:313) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:80) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:75) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition(TransFormulaUtils.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition(TransFormulaUtils.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.SequentialComposition.getInterproceduralTransFormula(SequentialComposition.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.SequentialComposition.getInterproceduralTransFormula(SequentialComposition.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.computeTF(LassoCheck.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.computeLoopTF(LassoCheck.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:847) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 05:18:49,648 INFO L158 Benchmark]: Toolchain (without parser) took 90006.78ms. Allocated memory was 54.5MB in the beginning and 132.1MB in the end (delta: 77.6MB). Free memory was 30.7MB in the beginning and 62.4MB in the end (delta: -31.7MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. [2021-08-31 05:18:49,649 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 37.6MB in the beginning and 37.6MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 05:18:49,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.42ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.5MB in the beginning and 36.8MB in the end (delta: -6.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2021-08-31 05:18:49,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.08ms. Allocated memory is still 67.1MB. Free memory was 36.8MB in the beginning and 38.2MB in the end (delta: -1.4MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2021-08-31 05:18:49,650 INFO L158 Benchmark]: Boogie Preprocessor took 121.30ms. Allocated memory is still 67.1MB. Free memory was 38.2MB in the beginning and 40.0MB in the end (delta: -1.8MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2021-08-31 05:18:49,651 INFO L158 Benchmark]: RCFGBuilder took 784.08ms. Allocated memory was 67.1MB in the beginning and 102.8MB in the end (delta: 35.7MB). Free memory was 39.8MB in the beginning and 55.7MB in the end (delta: -15.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2021-08-31 05:18:49,651 INFO L158 Benchmark]: BuchiAutomizer took 88547.31ms. Allocated memory was 102.8MB in the beginning and 132.1MB in the end (delta: 29.4MB). Free memory was 55.7MB in the beginning and 62.4MB in the end (delta: -6.7MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2021-08-31 05:18:49,653 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 37.6MB in the beginning and 37.6MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.42ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.5MB in the beginning and 36.8MB in the end (delta: -6.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.08ms. Allocated memory is still 67.1MB. Free memory was 36.8MB in the beginning and 38.2MB in the end (delta: -1.4MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.30ms. Allocated memory is still 67.1MB. Free memory was 38.2MB in the beginning and 40.0MB in the end (delta: -1.8MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * RCFGBuilder took 784.08ms. Allocated memory was 67.1MB in the beginning and 102.8MB in the end (delta: 35.7MB). Free memory was 39.8MB in the beginning and 55.7MB in the end (delta: -15.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 88547.31ms. Allocated memory was 102.8MB in the beginning and 132.1MB in the end (delta: 29.4MB). Free memory was 55.7MB in the beginning and 62.4MB in the end (delta: -6.7MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:313) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 05:18:49,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:49,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...