./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stateful-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:03:34,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:03:34,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:03:34,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:03:34,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:03:34,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:03:34,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:03:34,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:03:34,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:03:34,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:03:34,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:03:34,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:03:34,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:03:34,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:03:34,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:03:34,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:03:34,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:03:34,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:03:34,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:03:34,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:03:34,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:03:34,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:03:34,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:03:34,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:03:34,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:03:34,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:03:34,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:03:34,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:03:34,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:03:34,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:03:34,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:03:34,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:03:34,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:03:34,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:03:34,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:03:34,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:03:34,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:03:34,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:03:34,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:03:34,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:03:34,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:03:34,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:03:34,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:03:34,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:03:34,727 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:03:34,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:03:34,728 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:03:34,728 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:03:34,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:03:34,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:03:34,729 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:03:34,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:03:34,730 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:03:34,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:03:34,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:03:34,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:03:34,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:03:34,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:03:34,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:03:34,731 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:03:34,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:03:34,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:03:34,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:03:34,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:03:34,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:03:34,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:03:34,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:03:34,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:03:34,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:03:34,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:03:34,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:03:34,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:03:34,733 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:03:34,733 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:03:34,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:03:34,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(reach_error())) ) 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 -> 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e [2022-02-20 19:03:34,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:03:34,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:03:34,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:03:34,917 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:03:34,917 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:03:34,918 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 [2022-02-20 19:03:34,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61b117c86/72c290d8c873439e806f6905ef3d0a0e/FLAG0b48cbcd7 [2022-02-20 19:03:35,386 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:03:35,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2022-02-20 19:03:35,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61b117c86/72c290d8c873439e806f6905ef3d0a0e/FLAG0b48cbcd7 [2022-02-20 19:03:35,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61b117c86/72c290d8c873439e806f6905ef3d0a0e [2022-02-20 19:03:35,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:03:35,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:03:35,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:03:35,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:03:35,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:03:35,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:03:35" (1/1) ... [2022-02-20 19:03:35,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1797d56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35, skipping insertion in model container [2022-02-20 19:03:35,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:03:35" (1/1) ... [2022-02-20 19:03:35,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:03:35,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:03:35,679 WARN L230 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] [2022-02-20 19:03:35,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:03:35,793 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:03:35,816 WARN L230 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] [2022-02-20 19:03:35,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:03:35,887 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:03:35,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35 WrapperNode [2022-02-20 19:03:35,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:03:35,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:03:35,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:03:35,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:03:35,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35" (1/1) ... [2022-02-20 19:03:35,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35" (1/1) ... [2022-02-20 19:03:35,955 INFO L137 Inliner]: procedures = 144, calls = 231, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 563 [2022-02-20 19:03:35,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:03:35,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:03:35,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:03:35,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:03:35,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35" (1/1) ... [2022-02-20 19:03:35,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35" (1/1) ... [2022-02-20 19:03:35,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35" (1/1) ... [2022-02-20 19:03:35,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35" (1/1) ... [2022-02-20 19:03:35,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35" (1/1) ... [2022-02-20 19:03:36,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35" (1/1) ... [2022-02-20 19:03:36,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35" (1/1) ... [2022-02-20 19:03:36,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:03:36,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:03:36,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:03:36,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:03:36,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35" (1/1) ... [2022-02-20 19:03:36,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:03:36,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:03:36,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:03:36,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:03:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 19:03:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 19:03:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:03:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 19:03:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 19:03:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2022-02-20 19:03:36,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2022-02-20 19:03:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-02-20 19:03:36,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-02-20 19:03:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-02-20 19:03:36,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-02-20 19:03:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 19:03:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-02-20 19:03:36,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-02-20 19:03:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-02-20 19:03:36,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-02-20 19:03:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 19:03:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 19:03:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-02-20 19:03:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-02-20 19:03:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:03:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-02-20 19:03:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-02-20 19:03:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:03:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:03:36,298 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:03:36,300 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:03:36,563 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: SUMMARY for call __CS_cs(); srcloc: null [2022-02-20 19:03:36,564 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-02-20 19:03:36,564 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume !(0 != ~__CS_ret~0 % 256); [2022-02-20 19:03:36,564 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-02-20 19:03:36,564 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-02-20 19:03:36,564 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != ~__CS_ret~0 % 256); [2022-02-20 19:03:36,564 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-02-20 19:03:38,059 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:03:38,074 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:03:38,074 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:03:38,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:03:38 BoogieIcfgContainer [2022-02-20 19:03:38,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:03:38,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:03:38,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:03:38,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:03:38,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:03:35" (1/3) ... [2022-02-20 19:03:38,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fccf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:03:38, skipping insertion in model container [2022-02-20 19:03:38,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:35" (2/3) ... [2022-02-20 19:03:38,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fccf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:03:38, skipping insertion in model container [2022-02-20 19:03:38,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:03:38" (3/3) ... [2022-02-20 19:03:38,086 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stateful-1.i [2022-02-20 19:03:38,093 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:03:38,093 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 19:03:38,125 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:03:38,129 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:03:38,130 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 19:03:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 121 states have (on average 1.5041322314049588) internal successors, (182), 122 states have internal predecessors, (182), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:38,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 19:03:38,153 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:03:38,154 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:03:38,154 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:03:38,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:03:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1724368089, now seen corresponding path program 1 times [2022-02-20 19:03:38,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:03:38,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783208467] [2022-02-20 19:03:38,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:03:38,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:03:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:38,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);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);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);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);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);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~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; {175#true} is VALID [2022-02-20 19:03:38,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; {177#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:03:38,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 2); {176#false} is VALID [2022-02-20 19:03:38,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {176#false} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem58#1.base, main_#t~mem58#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem59#1.base, main_#t~mem59#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem61#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem62#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem63#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem64#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem64#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem65#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {176#false} is VALID [2022-02-20 19:03:38,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {176#false} assume !(1 == main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {176#false} is VALID [2022-02-20 19:03:38,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#false} call main_#t~mem69#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {176#false} is VALID [2022-02-20 19:03:38,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#false} assume !(1 == main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {176#false} is VALID [2022-02-20 19:03:38,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {176#false} call main_#t~mem73#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {176#false} is VALID [2022-02-20 19:03:38,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {176#false} assume !(1 == main_#t~mem73#1 % 256);havoc main_#t~mem73#1; {176#false} is VALID [2022-02-20 19:03:38,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {176#false} call main_#t~mem77#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem78#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {176#false} is VALID [2022-02-20 19:03:38,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {176#false} assume !(main_#t~mem77#1 % 256 == main_#t~mem78#1 % 256);havoc main_#t~mem77#1;havoc main_#t~mem78#1;assume false; {176#false} is VALID [2022-02-20 19:03:38,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {176#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {176#false} is VALID [2022-02-20 19:03:38,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {176#false} assume !(main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256);havoc main_#t~mem79#1;havoc main_#t~mem80#1;assume false; {176#false} is VALID [2022-02-20 19:03:38,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {176#false} call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {176#false} is VALID [2022-02-20 19:03:38,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {176#false} assume !!(main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256);havoc main_#t~mem81#1;havoc main_#t~mem82#1; {176#false} is VALID [2022-02-20 19:03:38,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {176#false} call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {176#false} is VALID [2022-02-20 19:03:38,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {176#false} assume !(main_#t~mem83#1.base == main_#t~mem84#1.base && main_#t~mem83#1.offset == main_#t~mem84#1.offset);havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem84#1.base, main_#t~mem84#1.offset;assume false; {176#false} is VALID [2022-02-20 19:03:38,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {176#false} call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {176#false} is VALID [2022-02-20 19:03:38,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {176#false} assume !(main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;assume false; {176#false} is VALID [2022-02-20 19:03:38,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {176#false} call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {176#false} is VALID [2022-02-20 19:03:38,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {176#false} assume !(main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;assume false; {176#false} is VALID [2022-02-20 19:03:38,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {176#false} call main_#t~mem89#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {176#false} is VALID [2022-02-20 19:03:38,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {176#false} assume !(main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256);havoc main_#t~mem89#1;havoc main_#t~mem90#1;assume false; {176#false} is VALID [2022-02-20 19:03:38,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {176#false} call main_#t~mem91#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {176#false} is VALID [2022-02-20 19:03:38,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {176#false} assume !(main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256);havoc main_#t~mem91#1;havoc main_#t~mem92#1;assume false; {176#false} is VALID [2022-02-20 19:03:38,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {176#false} call main_#t~mem93#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem94#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {176#false} is VALID [2022-02-20 19:03:38,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {176#false} assume !(main_#t~mem93#1 == main_#t~mem94#1);havoc main_#t~mem93#1;havoc main_#t~mem94#1;assume false; {176#false} is VALID [2022-02-20 19:03:38,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {176#false} call main_#t~mem95#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {176#false} is VALID [2022-02-20 19:03:38,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {176#false} assume !(main_#t~mem95#1 == main_#t~mem96#1);havoc main_#t~mem95#1;havoc main_#t~mem96#1;assume false; {176#false} is VALID [2022-02-20 19:03:38,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {176#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {176#false} is VALID [2022-02-20 19:03:38,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {176#false} assume 0 == __VERIFIER_assert_~cond#1; {176#false} is VALID [2022-02-20 19:03:38,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {176#false} assume !false; {176#false} is VALID [2022-02-20 19:03:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:03:38,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:03:38,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783208467] [2022-02-20 19:03:38,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783208467] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:03:38,615 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:03:38,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:03:38,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655107495] [2022-02-20 19:03:38,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:03:38,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-20 19:03:38,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:03:38,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:38,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:03:38,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:03:38,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:03:38,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:03:38,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:03:38,694 INFO L87 Difference]: Start difference. First operand has 172 states, 121 states have (on average 1.5041322314049588) internal successors, (182), 122 states have internal predecessors, (182), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:42,499 INFO L93 Difference]: Finished difference Result 347 states and 569 transitions. [2022-02-20 19:03:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:03:42,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-20 19:03:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:03:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2022-02-20 19:03:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2022-02-20 19:03:42,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 569 transitions. [2022-02-20 19:03:43,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:03:43,046 INFO L225 Difference]: With dead ends: 347 [2022-02-20 19:03:43,051 INFO L226 Difference]: Without dead ends: 173 [2022-02-20 19:03:43,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:03:43,062 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 5 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:03:43,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 492 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:03:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-02-20 19:03:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2022-02-20 19:03:43,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:03:43,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 169 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:43,099 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 169 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:43,100 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 169 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:43,108 INFO L93 Difference]: Finished difference Result 173 states and 253 transitions. [2022-02-20 19:03:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 253 transitions. [2022-02-20 19:03:43,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:03:43,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:03:43,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand 173 states. [2022-02-20 19:03:43,114 INFO L87 Difference]: Start difference. First operand has 169 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand 173 states. [2022-02-20 19:03:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:43,124 INFO L93 Difference]: Finished difference Result 173 states and 253 transitions. [2022-02-20 19:03:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 253 transitions. [2022-02-20 19:03:43,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:03:43,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:03:43,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:03:43,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:03:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 248 transitions. [2022-02-20 19:03:43,143 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 248 transitions. Word has length 32 [2022-02-20 19:03:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:03:43,144 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 248 transitions. [2022-02-20 19:03:43,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 248 transitions. [2022-02-20 19:03:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 19:03:43,147 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:03:43,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:03:43,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:03:43,148 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:03:43,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:03:43,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1488698589, now seen corresponding path program 1 times [2022-02-20 19:03:43,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:03:43,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46046256] [2022-02-20 19:03:43,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:03:43,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:03:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:43,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {1212#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);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);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);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);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);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~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; {1212#true} is VALID [2022-02-20 19:03:43,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {1212#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; {1212#true} is VALID [2022-02-20 19:03:43,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {1212#true} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {1214#(= |ULTIMATE.start_main_~j~2#1| 0)} is VALID [2022-02-20 19:03:43,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {1214#(= |ULTIMATE.start_main_~j~2#1| 0)} assume !(main_~j~2#1 < 3); {1213#false} is VALID [2022-02-20 19:03:43,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {1213#false} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {1213#false} is VALID [2022-02-20 19:03:43,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {1213#false} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {1213#false} is VALID [2022-02-20 19:03:43,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {1213#false} assume !(main_~i~0#1 < 2); {1213#false} is VALID [2022-02-20 19:03:43,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {1213#false} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem58#1.base, main_#t~mem58#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem59#1.base, main_#t~mem59#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem61#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem62#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem63#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem64#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem64#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem65#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {1213#false} is VALID [2022-02-20 19:03:43,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {1213#false} assume !(1 == main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {1213#false} is VALID [2022-02-20 19:03:43,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {1213#false} call main_#t~mem69#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {1213#false} is VALID [2022-02-20 19:03:43,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {1213#false} assume !(1 == main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {1213#false} is VALID [2022-02-20 19:03:43,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {1213#false} call main_#t~mem73#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {1213#false} is VALID [2022-02-20 19:03:43,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {1213#false} assume !(1 == main_#t~mem73#1 % 256);havoc main_#t~mem73#1; {1213#false} is VALID [2022-02-20 19:03:43,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {1213#false} call main_#t~mem77#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem78#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {1213#false} is VALID [2022-02-20 19:03:43,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {1213#false} assume !!(main_#t~mem77#1 % 256 == main_#t~mem78#1 % 256);havoc main_#t~mem77#1;havoc main_#t~mem78#1; {1213#false} is VALID [2022-02-20 19:03:43,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {1213#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {1213#false} is VALID [2022-02-20 19:03:43,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {1213#false} assume !!(main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256);havoc main_#t~mem79#1;havoc main_#t~mem80#1; {1213#false} is VALID [2022-02-20 19:03:43,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#false} call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {1213#false} is VALID [2022-02-20 19:03:43,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {1213#false} assume !!(main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256);havoc main_#t~mem81#1;havoc main_#t~mem82#1; {1213#false} is VALID [2022-02-20 19:03:43,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {1213#false} call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {1213#false} is VALID [2022-02-20 19:03:43,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {1213#false} assume !!(main_#t~mem83#1.base == main_#t~mem84#1.base && main_#t~mem83#1.offset == main_#t~mem84#1.offset);havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; {1213#false} is VALID [2022-02-20 19:03:43,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {1213#false} call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {1213#false} is VALID [2022-02-20 19:03:43,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {1213#false} assume !!(main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {1213#false} is VALID [2022-02-20 19:03:43,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {1213#false} call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {1213#false} is VALID [2022-02-20 19:03:43,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {1213#false} assume !!(main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset; {1213#false} is VALID [2022-02-20 19:03:43,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {1213#false} call main_#t~mem89#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {1213#false} is VALID [2022-02-20 19:03:43,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {1213#false} assume !!(main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256);havoc main_#t~mem89#1;havoc main_#t~mem90#1; {1213#false} is VALID [2022-02-20 19:03:43,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {1213#false} call main_#t~mem91#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {1213#false} is VALID [2022-02-20 19:03:43,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {1213#false} assume !!(main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256);havoc main_#t~mem91#1;havoc main_#t~mem92#1; {1213#false} is VALID [2022-02-20 19:03:43,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {1213#false} call main_#t~mem93#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem94#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {1213#false} is VALID [2022-02-20 19:03:43,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {1213#false} assume !!(main_#t~mem93#1 == main_#t~mem94#1);havoc main_#t~mem93#1;havoc main_#t~mem94#1; {1213#false} is VALID [2022-02-20 19:03:43,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {1213#false} call main_#t~mem95#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {1213#false} is VALID [2022-02-20 19:03:43,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {1213#false} assume !!(main_#t~mem95#1 == main_#t~mem96#1);havoc main_#t~mem95#1;havoc main_#t~mem96#1; {1213#false} is VALID [2022-02-20 19:03:43,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {1213#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1213#false} is VALID [2022-02-20 19:03:43,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {1213#false} assume 0 == __VERIFIER_assert_~cond#1; {1213#false} is VALID [2022-02-20 19:03:43,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {1213#false} assume !false; {1213#false} is VALID [2022-02-20 19:03:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:03:43,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:03:43,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46046256] [2022-02-20 19:03:43,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46046256] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:03:43,302 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:03:43,302 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:03:43,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232572246] [2022-02-20 19:03:43,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:03:43,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-02-20 19:03:43,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:03:43,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:43,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:03:43,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:03:43,331 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:03:43,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:03:43,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:03:43,332 INFO L87 Difference]: Start difference. First operand 169 states and 248 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:47,665 INFO L93 Difference]: Finished difference Result 337 states and 496 transitions. [2022-02-20 19:03:47,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:03:47,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-02-20 19:03:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:03:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2022-02-20 19:03:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:47,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2022-02-20 19:03:47,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 495 transitions. [2022-02-20 19:03:48,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:03:48,036 INFO L225 Difference]: With dead ends: 337 [2022-02-20 19:03:48,036 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 19:03:48,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:03:48,038 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 1 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:03:48,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:03:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 19:03:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2022-02-20 19:03:48,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:03:48,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 170 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:48,047 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 170 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:48,048 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 170 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:48,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:48,053 INFO L93 Difference]: Finished difference Result 171 states and 250 transitions. [2022-02-20 19:03:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 250 transitions. [2022-02-20 19:03:48,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:03:48,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:03:48,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand 171 states. [2022-02-20 19:03:48,060 INFO L87 Difference]: Start difference. First operand has 170 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand 171 states. [2022-02-20 19:03:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:48,068 INFO L93 Difference]: Finished difference Result 171 states and 250 transitions. [2022-02-20 19:03:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 250 transitions. [2022-02-20 19:03:48,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:03:48,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:03:48,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:03:48,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:03:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 249 transitions. [2022-02-20 19:03:48,095 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 249 transitions. Word has length 36 [2022-02-20 19:03:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:03:48,096 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 249 transitions. [2022-02-20 19:03:48,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 249 transitions. [2022-02-20 19:03:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:03:48,097 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:03:48,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:03:48,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:03:48,098 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:03:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:03:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash 967627515, now seen corresponding path program 1 times [2022-02-20 19:03:48,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:03:48,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218008447] [2022-02-20 19:03:48,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:03:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:03:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:48,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {2235#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);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);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);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);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);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~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; {2235#true} is VALID [2022-02-20 19:03:48,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {2235#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; {2235#true} is VALID [2022-02-20 19:03:48,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {2235#true} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {2237#(= |ULTIMATE.start_main_~j~2#1| 0)} is VALID [2022-02-20 19:03:48,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {2237#(= |ULTIMATE.start_main_~j~2#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {2237#(= |ULTIMATE.start_main_~j~2#1| 0)} is VALID [2022-02-20 19:03:48,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {2237#(= |ULTIMATE.start_main_~j~2#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {2238#(<= |ULTIMATE.start_main_~j~2#1| 1)} is VALID [2022-02-20 19:03:48,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {2238#(<= |ULTIMATE.start_main_~j~2#1| 1)} assume !(main_~j~2#1 < 3); {2236#false} is VALID [2022-02-20 19:03:48,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {2236#false} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {2236#false} is VALID [2022-02-20 19:03:48,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {2236#false} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {2236#false} is VALID [2022-02-20 19:03:48,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {2236#false} assume !(main_~i~0#1 < 2); {2236#false} is VALID [2022-02-20 19:03:48,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {2236#false} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem58#1.base, main_#t~mem58#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem59#1.base, main_#t~mem59#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem61#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem62#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem63#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem64#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem64#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem65#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {2236#false} assume !(1 == main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {2236#false} is VALID [2022-02-20 19:03:48,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {2236#false} call main_#t~mem69#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {2236#false} assume !(1 == main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {2236#false} is VALID [2022-02-20 19:03:48,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {2236#false} call main_#t~mem73#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {2236#false} assume !(1 == main_#t~mem73#1 % 256);havoc main_#t~mem73#1; {2236#false} is VALID [2022-02-20 19:03:48,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {2236#false} call main_#t~mem77#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem78#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {2236#false} assume !!(main_#t~mem77#1 % 256 == main_#t~mem78#1 % 256);havoc main_#t~mem77#1;havoc main_#t~mem78#1; {2236#false} is VALID [2022-02-20 19:03:48,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {2236#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {2236#false} assume !!(main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256);havoc main_#t~mem79#1;havoc main_#t~mem80#1; {2236#false} is VALID [2022-02-20 19:03:48,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {2236#false} call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {2236#false} assume !!(main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256);havoc main_#t~mem81#1;havoc main_#t~mem82#1; {2236#false} is VALID [2022-02-20 19:03:48,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {2236#false} call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {2236#false} assume !!(main_#t~mem83#1.base == main_#t~mem84#1.base && main_#t~mem83#1.offset == main_#t~mem84#1.offset);havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; {2236#false} is VALID [2022-02-20 19:03:48,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {2236#false} call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {2236#false} assume !!(main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {2236#false} is VALID [2022-02-20 19:03:48,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {2236#false} call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {2236#false} assume !!(main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset; {2236#false} is VALID [2022-02-20 19:03:48,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {2236#false} call main_#t~mem89#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {2236#false} assume !!(main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256);havoc main_#t~mem89#1;havoc main_#t~mem90#1; {2236#false} is VALID [2022-02-20 19:03:48,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {2236#false} call main_#t~mem91#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {2236#false} assume !!(main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256);havoc main_#t~mem91#1;havoc main_#t~mem92#1; {2236#false} is VALID [2022-02-20 19:03:48,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {2236#false} call main_#t~mem93#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem94#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {2236#false} assume !!(main_#t~mem93#1 == main_#t~mem94#1);havoc main_#t~mem93#1;havoc main_#t~mem94#1; {2236#false} is VALID [2022-02-20 19:03:48,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {2236#false} call main_#t~mem95#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {2236#false} assume !!(main_#t~mem95#1 == main_#t~mem96#1);havoc main_#t~mem95#1;havoc main_#t~mem96#1; {2236#false} is VALID [2022-02-20 19:03:48,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {2236#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2236#false} is VALID [2022-02-20 19:03:48,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {2236#false} assume 0 == __VERIFIER_assert_~cond#1; {2236#false} is VALID [2022-02-20 19:03:48,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {2236#false} assume !false; {2236#false} is VALID [2022-02-20 19:03:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:03:48,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:03:48,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218008447] [2022-02-20 19:03:48,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218008447] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:03:48,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215606770] [2022-02-20 19:03:48,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:03:48,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:03:48,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:03:48,216 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) [2022-02-20 19:03:48,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:03:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:48,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 19:03:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:48,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:03:48,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {2235#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);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);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);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);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);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~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; {2235#true} is VALID [2022-02-20 19:03:48,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {2235#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; {2235#true} is VALID [2022-02-20 19:03:48,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {2235#true} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {2248#(<= |ULTIMATE.start_main_~j~2#1| 0)} is VALID [2022-02-20 19:03:48,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {2248#(<= |ULTIMATE.start_main_~j~2#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {2248#(<= |ULTIMATE.start_main_~j~2#1| 0)} is VALID [2022-02-20 19:03:48,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {2248#(<= |ULTIMATE.start_main_~j~2#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {2238#(<= |ULTIMATE.start_main_~j~2#1| 1)} is VALID [2022-02-20 19:03:48,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {2238#(<= |ULTIMATE.start_main_~j~2#1| 1)} assume !(main_~j~2#1 < 3); {2236#false} is VALID [2022-02-20 19:03:48,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {2236#false} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {2236#false} is VALID [2022-02-20 19:03:48,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {2236#false} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {2236#false} is VALID [2022-02-20 19:03:48,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {2236#false} assume !(main_~i~0#1 < 2); {2236#false} is VALID [2022-02-20 19:03:48,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {2236#false} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem58#1.base, main_#t~mem58#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem59#1.base, main_#t~mem59#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem61#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem62#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem63#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem64#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem64#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem65#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {2236#false} assume !(1 == main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {2236#false} is VALID [2022-02-20 19:03:48,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {2236#false} call main_#t~mem69#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {2236#false} assume !(1 == main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {2236#false} is VALID [2022-02-20 19:03:48,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {2236#false} call main_#t~mem73#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {2236#false} assume !(1 == main_#t~mem73#1 % 256);havoc main_#t~mem73#1; {2236#false} is VALID [2022-02-20 19:03:48,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {2236#false} call main_#t~mem77#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem78#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {2236#false} assume !!(main_#t~mem77#1 % 256 == main_#t~mem78#1 % 256);havoc main_#t~mem77#1;havoc main_#t~mem78#1; {2236#false} is VALID [2022-02-20 19:03:48,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {2236#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {2236#false} assume !!(main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256);havoc main_#t~mem79#1;havoc main_#t~mem80#1; {2236#false} is VALID [2022-02-20 19:03:48,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {2236#false} call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {2236#false} assume !!(main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256);havoc main_#t~mem81#1;havoc main_#t~mem82#1; {2236#false} is VALID [2022-02-20 19:03:48,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {2236#false} call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {2236#false} assume !!(main_#t~mem83#1.base == main_#t~mem84#1.base && main_#t~mem83#1.offset == main_#t~mem84#1.offset);havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; {2236#false} is VALID [2022-02-20 19:03:48,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {2236#false} call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {2236#false} assume !!(main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {2236#false} is VALID [2022-02-20 19:03:48,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {2236#false} call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {2236#false} assume !!(main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset; {2236#false} is VALID [2022-02-20 19:03:48,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {2236#false} call main_#t~mem89#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {2236#false} assume !!(main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256);havoc main_#t~mem89#1;havoc main_#t~mem90#1; {2236#false} is VALID [2022-02-20 19:03:48,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {2236#false} call main_#t~mem91#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {2236#false} assume !!(main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256);havoc main_#t~mem91#1;havoc main_#t~mem92#1; {2236#false} is VALID [2022-02-20 19:03:48,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {2236#false} call main_#t~mem93#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem94#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {2236#false} assume !!(main_#t~mem93#1 == main_#t~mem94#1);havoc main_#t~mem93#1;havoc main_#t~mem94#1; {2236#false} is VALID [2022-02-20 19:03:48,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {2236#false} call main_#t~mem95#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {2236#false} assume !!(main_#t~mem95#1 == main_#t~mem96#1);havoc main_#t~mem95#1;havoc main_#t~mem96#1; {2236#false} is VALID [2022-02-20 19:03:48,839 INFO L290 TraceCheckUtils]: 35: Hoare triple {2236#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2236#false} is VALID [2022-02-20 19:03:48,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {2236#false} assume 0 == __VERIFIER_assert_~cond#1; {2236#false} is VALID [2022-02-20 19:03:48,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {2236#false} assume !false; {2236#false} is VALID [2022-02-20 19:03:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:03:48,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:03:48,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {2236#false} assume !false; {2236#false} is VALID [2022-02-20 19:03:48,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {2236#false} assume 0 == __VERIFIER_assert_~cond#1; {2236#false} is VALID [2022-02-20 19:03:48,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {2236#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2236#false} is VALID [2022-02-20 19:03:48,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {2236#false} assume !!(main_#t~mem95#1 == main_#t~mem96#1);havoc main_#t~mem95#1;havoc main_#t~mem96#1; {2236#false} is VALID [2022-02-20 19:03:48,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {2236#false} call main_#t~mem95#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {2236#false} assume !!(main_#t~mem93#1 == main_#t~mem94#1);havoc main_#t~mem93#1;havoc main_#t~mem94#1; {2236#false} is VALID [2022-02-20 19:03:48,968 INFO L290 TraceCheckUtils]: 31: Hoare triple {2236#false} call main_#t~mem93#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem94#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {2236#false} assume !!(main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256);havoc main_#t~mem91#1;havoc main_#t~mem92#1; {2236#false} is VALID [2022-02-20 19:03:48,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {2236#false} call main_#t~mem91#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {2236#false} assume !!(main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256);havoc main_#t~mem89#1;havoc main_#t~mem90#1; {2236#false} is VALID [2022-02-20 19:03:48,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {2236#false} call main_#t~mem89#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {2236#false} assume !!(main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset; {2236#false} is VALID [2022-02-20 19:03:48,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {2236#false} call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {2236#false} assume !!(main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {2236#false} is VALID [2022-02-20 19:03:48,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {2236#false} call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {2236#false} assume !!(main_#t~mem83#1.base == main_#t~mem84#1.base && main_#t~mem83#1.offset == main_#t~mem84#1.offset);havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; {2236#false} is VALID [2022-02-20 19:03:48,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {2236#false} call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {2236#false} is VALID [2022-02-20 19:03:48,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {2236#false} assume !!(main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256);havoc main_#t~mem81#1;havoc main_#t~mem82#1; {2236#false} is VALID [2022-02-20 19:03:48,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {2236#false} call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {2236#false} assume !!(main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256);havoc main_#t~mem79#1;havoc main_#t~mem80#1; {2236#false} is VALID [2022-02-20 19:03:48,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {2236#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {2236#false} assume !!(main_#t~mem77#1 % 256 == main_#t~mem78#1 % 256);havoc main_#t~mem77#1;havoc main_#t~mem78#1; {2236#false} is VALID [2022-02-20 19:03:48,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {2236#false} call main_#t~mem77#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem78#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {2236#false} assume !(1 == main_#t~mem73#1 % 256);havoc main_#t~mem73#1; {2236#false} is VALID [2022-02-20 19:03:48,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {2236#false} call main_#t~mem73#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {2236#false} assume !(1 == main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {2236#false} is VALID [2022-02-20 19:03:48,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {2236#false} call main_#t~mem69#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {2236#false} assume !(1 == main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {2236#false} is VALID [2022-02-20 19:03:48,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {2236#false} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem58#1.base, main_#t~mem58#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem59#1.base, main_#t~mem59#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem61#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem62#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem63#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem64#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem64#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem65#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {2236#false} is VALID [2022-02-20 19:03:48,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {2236#false} assume !(main_~i~0#1 < 2); {2236#false} is VALID [2022-02-20 19:03:48,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {2236#false} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {2236#false} is VALID [2022-02-20 19:03:48,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {2236#false} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {2236#false} is VALID [2022-02-20 19:03:48,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {2450#(< |ULTIMATE.start_main_~j~2#1| 3)} assume !(main_~j~2#1 < 3); {2236#false} is VALID [2022-02-20 19:03:48,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {2238#(<= |ULTIMATE.start_main_~j~2#1| 1)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {2450#(< |ULTIMATE.start_main_~j~2#1| 3)} is VALID [2022-02-20 19:03:48,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {2238#(<= |ULTIMATE.start_main_~j~2#1| 1)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {2238#(<= |ULTIMATE.start_main_~j~2#1| 1)} is VALID [2022-02-20 19:03:48,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {2235#true} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {2238#(<= |ULTIMATE.start_main_~j~2#1| 1)} is VALID [2022-02-20 19:03:48,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {2235#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; {2235#true} is VALID [2022-02-20 19:03:48,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {2235#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);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);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);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);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);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~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; {2235#true} is VALID [2022-02-20 19:03:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:03:48,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215606770] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:03:48,985 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:03:48,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-02-20 19:03:48,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86720984] [2022-02-20 19:03:48,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:03:48,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 19:03:48,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:03:48,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:49,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:03:49,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:03:49,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:03:49,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:03:49,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:03:49,030 INFO L87 Difference]: Start difference. First operand 170 states and 249 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:57,686 INFO L93 Difference]: Finished difference Result 341 states and 501 transitions. [2022-02-20 19:03:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:03:57,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-02-20 19:03:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:03:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2022-02-20 19:03:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2022-02-20 19:03:57,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 499 transitions. [2022-02-20 19:03:58,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 499 edges. 499 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:03:58,045 INFO L225 Difference]: With dead ends: 341 [2022-02-20 19:03:58,046 INFO L226 Difference]: Without dead ends: 174 [2022-02-20 19:03:58,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:03:58,047 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 3 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:03:58,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 971 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:03:58,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-20 19:03:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-02-20 19:03:58,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:03:58,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 174 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 124 states have internal predecessors, (169), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:58,071 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 174 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 124 states have internal predecessors, (169), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:58,072 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 174 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 124 states have internal predecessors, (169), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:58,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:58,082 INFO L93 Difference]: Finished difference Result 174 states and 253 transitions. [2022-02-20 19:03:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 253 transitions. [2022-02-20 19:03:58,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:03:58,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:03:58,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 124 states have internal predecessors, (169), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand 174 states. [2022-02-20 19:03:58,084 INFO L87 Difference]: Start difference. First operand has 174 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 124 states have internal predecessors, (169), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand 174 states. [2022-02-20 19:03:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:58,089 INFO L93 Difference]: Finished difference Result 174 states and 253 transitions. [2022-02-20 19:03:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 253 transitions. [2022-02-20 19:03:58,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:03:58,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:03:58,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:03:58,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:03:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 124 states have internal predecessors, (169), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:03:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 253 transitions. [2022-02-20 19:03:58,097 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 253 transitions. Word has length 38 [2022-02-20 19:03:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:03:58,097 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 253 transitions. [2022-02-20 19:03:58,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 253 transitions. [2022-02-20 19:03:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:03:58,098 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:03:58,098 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:03:58,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:03:58,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:03:58,310 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:03:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:03:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash -624054089, now seen corresponding path program 2 times [2022-02-20 19:03:58,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:03:58,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769349872] [2022-02-20 19:03:58,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:03:58,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:03:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:58,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {3502#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);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);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);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);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);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~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; {3502#true} is VALID [2022-02-20 19:03:58,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {3502#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:03:58,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:03:58,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:03:58,535 INFO L290 TraceCheckUtils]: 4: Hoare triple {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:03:58,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:03:58,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:03:58,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:03:58,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:03:58,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~2#1 < 3); {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:03:58,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:03:58,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {3504#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {3505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 19:03:58,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {3505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 2); {3503#false} is VALID [2022-02-20 19:03:58,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {3503#false} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem58#1.base, main_#t~mem58#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem59#1.base, main_#t~mem59#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem61#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem62#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem63#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem64#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem64#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem65#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {3503#false} is VALID [2022-02-20 19:03:58,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {3503#false} assume !(1 == main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {3503#false} is VALID [2022-02-20 19:03:58,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {3503#false} call main_#t~mem69#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {3503#false} is VALID [2022-02-20 19:03:58,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {3503#false} assume !(1 == main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {3503#false} is VALID [2022-02-20 19:03:58,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {3503#false} call main_#t~mem73#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {3503#false} is VALID [2022-02-20 19:03:58,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {3503#false} assume !(1 == main_#t~mem73#1 % 256);havoc main_#t~mem73#1; {3503#false} is VALID [2022-02-20 19:03:58,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {3503#false} call main_#t~mem77#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem78#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3503#false} is VALID [2022-02-20 19:03:58,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {3503#false} assume !!(main_#t~mem77#1 % 256 == main_#t~mem78#1 % 256);havoc main_#t~mem77#1;havoc main_#t~mem78#1; {3503#false} is VALID [2022-02-20 19:03:58,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {3503#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3503#false} is VALID [2022-02-20 19:03:58,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {3503#false} assume !!(main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256);havoc main_#t~mem79#1;havoc main_#t~mem80#1; {3503#false} is VALID [2022-02-20 19:03:58,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {3503#false} call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3503#false} is VALID [2022-02-20 19:03:58,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {3503#false} assume !!(main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256);havoc main_#t~mem81#1;havoc main_#t~mem82#1; {3503#false} is VALID [2022-02-20 19:03:58,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {3503#false} call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3503#false} is VALID [2022-02-20 19:03:58,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {3503#false} assume !!(main_#t~mem83#1.base == main_#t~mem84#1.base && main_#t~mem83#1.offset == main_#t~mem84#1.offset);havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; {3503#false} is VALID [2022-02-20 19:03:58,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {3503#false} call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3503#false} is VALID [2022-02-20 19:03:58,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {3503#false} assume !!(main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {3503#false} is VALID [2022-02-20 19:03:58,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {3503#false} call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3503#false} is VALID [2022-02-20 19:03:58,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {3503#false} assume !!(main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset; {3503#false} is VALID [2022-02-20 19:03:58,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {3503#false} call main_#t~mem89#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {3503#false} is VALID [2022-02-20 19:03:58,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {3503#false} assume !!(main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256);havoc main_#t~mem89#1;havoc main_#t~mem90#1; {3503#false} is VALID [2022-02-20 19:03:58,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {3503#false} call main_#t~mem91#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {3503#false} is VALID [2022-02-20 19:03:58,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {3503#false} assume !!(main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256);havoc main_#t~mem91#1;havoc main_#t~mem92#1; {3503#false} is VALID [2022-02-20 19:03:58,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {3503#false} call main_#t~mem93#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem94#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {3503#false} is VALID [2022-02-20 19:03:58,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {3503#false} assume !!(main_#t~mem93#1 == main_#t~mem94#1);havoc main_#t~mem93#1;havoc main_#t~mem94#1; {3503#false} is VALID [2022-02-20 19:03:58,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {3503#false} call main_#t~mem95#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {3503#false} is VALID [2022-02-20 19:03:58,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {3503#false} assume !!(main_#t~mem95#1 == main_#t~mem96#1);havoc main_#t~mem95#1;havoc main_#t~mem96#1; {3503#false} is VALID [2022-02-20 19:03:58,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {3503#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3503#false} is VALID [2022-02-20 19:03:58,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {3503#false} assume 0 == __VERIFIER_assert_~cond#1; {3503#false} is VALID [2022-02-20 19:03:58,546 INFO L290 TraceCheckUtils]: 41: Hoare triple {3503#false} assume !false; {3503#false} is VALID [2022-02-20 19:03:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 19:03:58,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:03:58,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769349872] [2022-02-20 19:03:58,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769349872] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:03:58,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55068769] [2022-02-20 19:03:58,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 19:03:58,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:03:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:03:58,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:03:58,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 19:03:59,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 19:03:59,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:03:59,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 1584 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:03:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:59,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:03:59,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {3502#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);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);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);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);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);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~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {3509#(= ~__CS_error~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {3509#(= ~__CS_error~0 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {3509#(= ~__CS_error~0 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {3509#(= ~__CS_error~0 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {3509#(= ~__CS_error~0 0)} assume !(main_~j~2#1 < 3); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {3509#(= ~__CS_error~0 0)} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {3509#(= ~__CS_error~0 0)} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {3509#(= ~__CS_error~0 0)} assume !(main_~i~0#1 < 2); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem58#1.base, main_#t~mem58#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem59#1.base, main_#t~mem59#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem61#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem62#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem63#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem64#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem64#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem65#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {3509#(= ~__CS_error~0 0)} assume !(1 == main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem69#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {3509#(= ~__CS_error~0 0)} assume !(1 == main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem73#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {3509#(= ~__CS_error~0 0)} assume !(1 == main_#t~mem73#1 % 256);havoc main_#t~mem73#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem77#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem78#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_#t~mem77#1 % 256 == main_#t~mem78#1 % 256);havoc main_#t~mem77#1;havoc main_#t~mem78#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256);havoc main_#t~mem79#1;havoc main_#t~mem80#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256);havoc main_#t~mem81#1;havoc main_#t~mem82#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_#t~mem83#1.base == main_#t~mem84#1.base && main_#t~mem83#1.offset == main_#t~mem84#1.offset);havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem89#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256);havoc main_#t~mem89#1;havoc main_#t~mem90#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem91#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256);havoc main_#t~mem91#1;havoc main_#t~mem92#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem93#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem94#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_#t~mem93#1 == main_#t~mem94#1);havoc main_#t~mem93#1;havoc main_#t~mem94#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {3509#(= ~__CS_error~0 0)} call main_#t~mem95#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,609 INFO L290 TraceCheckUtils]: 38: Hoare triple {3509#(= ~__CS_error~0 0)} assume !!(main_#t~mem95#1 == main_#t~mem96#1);havoc main_#t~mem95#1;havoc main_#t~mem96#1; {3509#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:03:59,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {3509#(= ~__CS_error~0 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3627#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:03:59,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {3627#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {3503#false} is VALID [2022-02-20 19:03:59,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {3503#false} assume !false; {3503#false} is VALID [2022-02-20 19:03:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 19:03:59,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:03:59,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55068769] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:03:59,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 19:03:59,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-02-20 19:03:59,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722571717] [2022-02-20 19:03:59,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:03:59,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 19:03:59,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:03:59,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:03:59,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:03:59,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:03:59,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:03:59,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:03:59,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:03:59,643 INFO L87 Difference]: Start difference. First operand 174 states and 253 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:04:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:02,912 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2022-02-20 19:04:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:04:02,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 19:04:02,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:04:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:04:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-02-20 19:04:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:04:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-02-20 19:04:02,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-02-20 19:04:03,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:03,328 INFO L225 Difference]: With dead ends: 332 [2022-02-20 19:04:03,328 INFO L226 Difference]: Without dead ends: 306 [2022-02-20 19:04:03,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:04:03,333 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 206 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:04:03,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 934 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:04:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-02-20 19:04:03,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2022-02-20 19:04:03,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:04:03,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand has 305 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) [2022-02-20 19:04:03,362 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand has 305 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) [2022-02-20 19:04:03,363 INFO L87 Difference]: Start difference. First operand 306 states. Second operand has 305 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) [2022-02-20 19:04:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:03,373 INFO L93 Difference]: Finished difference Result 306 states and 467 transitions. [2022-02-20 19:04:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 467 transitions. [2022-02-20 19:04:03,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:03,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:03,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) Second operand 306 states. [2022-02-20 19:04:03,376 INFO L87 Difference]: Start difference. First operand has 305 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) Second operand 306 states. [2022-02-20 19:04:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:03,385 INFO L93 Difference]: Finished difference Result 306 states and 467 transitions. [2022-02-20 19:04:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 467 transitions. [2022-02-20 19:04:03,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:03,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:03,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:04:03,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:04:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) [2022-02-20 19:04:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 466 transitions. [2022-02-20 19:04:03,396 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 466 transitions. Word has length 42 [2022-02-20 19:04:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:04:03,396 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 466 transitions. [2022-02-20 19:04:03,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:04:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 466 transitions. [2022-02-20 19:04:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-02-20 19:04:03,398 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:04:03,398 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:04:03,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 19:04:03,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 19:04:03,620 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:04:03,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:04:03,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1759881955, now seen corresponding path program 1 times [2022-02-20 19:04:03,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:04:03,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155817782] [2022-02-20 19:04:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:04:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 19:04:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 19:04:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:03,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:03,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:03,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:03,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:03,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,860 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5105#true} {5105#true} #486#return; {5105#true} is VALID [2022-02-20 19:04:03,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:04:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {5202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {5105#true} is VALID [2022-02-20 19:04:03,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {5105#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {5105#true} is VALID [2022-02-20 19:04:03,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5105#true} {5105#true} #488#return; {5105#true} is VALID [2022-02-20 19:04:03,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:04:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:03,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:03,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:03,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:03,881 INFO L290 TraceCheckUtils]: 4: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:03,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,882 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5105#true} {5105#true} #490#return; {5105#true} is VALID [2022-02-20 19:04:03,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:04:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:03,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:03,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:03,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:03,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:03,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,889 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5105#true} {5105#true} #492#return; {5105#true} is VALID [2022-02-20 19:04:03,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 19:04:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {5203#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {5105#true} is VALID [2022-02-20 19:04:03,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {5105#true} assume #t~mem10 % 256 != 1 + ~__CS_thread_index~0 % 256;havoc #t~mem10;~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;#res := 1; {5105#true} is VALID [2022-02-20 19:04:03,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5105#true} {5105#true} #494#return; {5105#true} is VALID [2022-02-20 19:04:03,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:04:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:03,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:03,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:03,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:03,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:03,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,915 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5105#true} {5105#true} #496#return; {5105#true} is VALID [2022-02-20 19:04:03,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {5164#(and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|))} #~75#1.base, #~75#1.offset := #in~75#1.base, #in~75#1.offset; {5105#true} is VALID [2022-02-20 19:04:03,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {5105#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {5105#true} is VALID [2022-02-20 19:04:03,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {5105#true} assume #in~#fp#1.base == #funAddr~thread2.base && #in~#fp#1.offset == #funAddr~thread2.offset;assume { :begin_inline_thread2 } true;thread2_#in~arg#1.base, thread2_#in~arg#1.offset := #~75#1.base, #~75#1.offset;havoc thread2_#res#1.base, thread2_#res#1.offset;havoc thread2_#t~ret30#1, thread2_#t~mem31#1, thread2_#t~ret32#1, thread2_#t~ret33#1, thread2_#t~mem34#1, thread2_#t~ret35#1, thread2_~arg#1.base, thread2_~arg#1.offset;thread2_~arg#1.base, thread2_~arg#1.offset := thread2_#in~arg#1.base, thread2_#in~arg#1.offset; {5105#true} is VALID [2022-02-20 19:04:03,916 INFO L272 TraceCheckUtils]: 3: Hoare triple {5105#true} call __CS_cs(); {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:03,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:03,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:03,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:03,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:03,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:03,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,917 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5105#true} {5105#true} #486#return; {5105#true} is VALID [2022-02-20 19:04:03,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {5105#true} assume !(0 != ~__CS_ret~0 % 256); {5105#true} is VALID [2022-02-20 19:04:03,918 INFO L272 TraceCheckUtils]: 12: Hoare triple {5105#true} call thread2_#t~ret30#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {5202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:03,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {5202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {5105#true} is VALID [2022-02-20 19:04:03,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {5105#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {5105#true} is VALID [2022-02-20 19:04:03,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,918 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5105#true} {5105#true} #488#return; {5105#true} is VALID [2022-02-20 19:04:03,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {5105#true} assume -2147483648 <= thread2_#t~ret30#1 && thread2_#t~ret30#1 <= 2147483647;havoc thread2_#t~ret30#1; {5105#true} is VALID [2022-02-20 19:04:03,919 INFO L272 TraceCheckUtils]: 18: Hoare triple {5105#true} call __CS_cs(); {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:03,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:03,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:03,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:03,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:03,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:03,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,920 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5105#true} {5105#true} #490#return; {5105#true} is VALID [2022-02-20 19:04:03,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {5105#true} assume !(0 != ~__CS_ret~0 % 256);call thread2_#t~mem31#1 := read~int(~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);call write~int(5 + thread2_#t~mem31#1, ~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);havoc thread2_#t~mem31#1; {5105#true} is VALID [2022-02-20 19:04:03,920 INFO L272 TraceCheckUtils]: 27: Hoare triple {5105#true} call __CS_cs(); {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:03,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:03,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:03,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:03,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:03,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:03,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,921 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5105#true} {5105#true} #492#return; {5105#true} is VALID [2022-02-20 19:04:03,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {5105#true} assume !(0 != ~__CS_ret~0 % 256); {5105#true} is VALID [2022-02-20 19:04:03,922 INFO L272 TraceCheckUtils]: 36: Hoare triple {5105#true} call thread2_#t~ret32#1 := __CS_pthread_mutex_unlock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {5203#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:03,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {5203#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {5105#true} is VALID [2022-02-20 19:04:03,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {5105#true} assume #t~mem10 % 256 != 1 + ~__CS_thread_index~0 % 256;havoc #t~mem10;~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;#res := 1; {5105#true} is VALID [2022-02-20 19:04:03,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,923 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5105#true} {5105#true} #494#return; {5105#true} is VALID [2022-02-20 19:04:03,923 INFO L290 TraceCheckUtils]: 41: Hoare triple {5105#true} assume -2147483648 <= thread2_#t~ret32#1 && thread2_#t~ret32#1 <= 2147483647;havoc thread2_#t~ret32#1; {5105#true} is VALID [2022-02-20 19:04:03,923 INFO L272 TraceCheckUtils]: 42: Hoare triple {5105#true} call __CS_cs(); {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:03,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:03,923 INFO L290 TraceCheckUtils]: 44: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:03,923 INFO L290 TraceCheckUtils]: 45: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:03,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:03,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:03,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,924 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5105#true} {5105#true} #496#return; {5105#true} is VALID [2022-02-20 19:04:03,924 INFO L290 TraceCheckUtils]: 50: Hoare triple {5105#true} assume 0 != ~__CS_ret~0 % 256;thread2_#res#1.base, thread2_#res#1.offset := 0, 0; {5105#true} is VALID [2022-02-20 19:04:03,924 INFO L290 TraceCheckUtils]: 51: Hoare triple {5105#true} #t~ret106#1.base, #t~ret106#1.offset := thread2_#res#1.base, thread2_#res#1.offset;assume { :end_inline_thread2 } true;#t~funptrres104#1.base, #t~funptrres104#1.offset := #t~ret106#1.base, #t~ret106#1.offset; {5105#true} is VALID [2022-02-20 19:04:03,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {5105#true} #res#1.base, #res#1.offset := #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~ret105#1.base, #t~ret105#1.offset;havoc #t~ret106#1.base, #t~ret106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset; {5105#true} is VALID [2022-02-20 19:04:03,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,925 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5105#true} {5106#false} #534#return; {5106#false} is VALID [2022-02-20 19:04:03,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {5105#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);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);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);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);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);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~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; {5105#true} is VALID [2022-02-20 19:04:03,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {5105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~2#1 < 3); {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {5107#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {5108#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 19:04:03,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {5108#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 2); {5106#false} is VALID [2022-02-20 19:04:03,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {5106#false} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem58#1.base, main_#t~mem58#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem59#1.base, main_#t~mem59#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem61#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem62#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem63#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem64#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem64#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem65#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {5106#false} is VALID [2022-02-20 19:04:03,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {5106#false} assume !(1 == main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {5106#false} is VALID [2022-02-20 19:04:03,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {5106#false} call main_#t~mem69#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {5106#false} is VALID [2022-02-20 19:04:03,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {5106#false} assume !(1 == main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {5106#false} is VALID [2022-02-20 19:04:03,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {5106#false} call main_#t~mem73#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {5106#false} is VALID [2022-02-20 19:04:03,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {5106#false} assume 1 == main_#t~mem73#1 % 256;havoc main_#t~mem73#1;call main_#t~mem74#1 := read~int(~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_round~0 := main_#t~mem74#1;havoc main_#t~mem74#1;~__CS_ret~0 := 0; {5106#false} is VALID [2022-02-20 19:04:03,932 INFO L272 TraceCheckUtils]: 19: Hoare triple {5106#false} call main_#t~ret76#1.base, main_#t~ret76#1.offset := ##fun~$Pointer$~TO~$Pointer$(0, 0, ~__CS_thread~0.base[2], ~__CS_thread~0.offset[2]); {5164#(and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|))} is VALID [2022-02-20 19:04:03,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {5164#(and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|))} #~75#1.base, #~75#1.offset := #in~75#1.base, #in~75#1.offset; {5105#true} is VALID [2022-02-20 19:04:03,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {5105#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {5105#true} is VALID [2022-02-20 19:04:03,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {5105#true} assume #in~#fp#1.base == #funAddr~thread2.base && #in~#fp#1.offset == #funAddr~thread2.offset;assume { :begin_inline_thread2 } true;thread2_#in~arg#1.base, thread2_#in~arg#1.offset := #~75#1.base, #~75#1.offset;havoc thread2_#res#1.base, thread2_#res#1.offset;havoc thread2_#t~ret30#1, thread2_#t~mem31#1, thread2_#t~ret32#1, thread2_#t~ret33#1, thread2_#t~mem34#1, thread2_#t~ret35#1, thread2_~arg#1.base, thread2_~arg#1.offset;thread2_~arg#1.base, thread2_~arg#1.offset := thread2_#in~arg#1.base, thread2_#in~arg#1.offset; {5105#true} is VALID [2022-02-20 19:04:03,933 INFO L272 TraceCheckUtils]: 23: Hoare triple {5105#true} call __CS_cs(); {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:03,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:03,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:03,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:03,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:03,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:03,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,935 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5105#true} {5105#true} #486#return; {5105#true} is VALID [2022-02-20 19:04:03,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {5105#true} assume !(0 != ~__CS_ret~0 % 256); {5105#true} is VALID [2022-02-20 19:04:03,936 INFO L272 TraceCheckUtils]: 32: Hoare triple {5105#true} call thread2_#t~ret30#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {5202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:03,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {5202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {5105#true} is VALID [2022-02-20 19:04:03,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {5105#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {5105#true} is VALID [2022-02-20 19:04:03,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,937 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5105#true} {5105#true} #488#return; {5105#true} is VALID [2022-02-20 19:04:03,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {5105#true} assume -2147483648 <= thread2_#t~ret30#1 && thread2_#t~ret30#1 <= 2147483647;havoc thread2_#t~ret30#1; {5105#true} is VALID [2022-02-20 19:04:03,937 INFO L272 TraceCheckUtils]: 38: Hoare triple {5105#true} call __CS_cs(); {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:03,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:03,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:03,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:03,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:03,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:03,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,938 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5105#true} {5105#true} #490#return; {5105#true} is VALID [2022-02-20 19:04:03,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {5105#true} assume !(0 != ~__CS_ret~0 % 256);call thread2_#t~mem31#1 := read~int(~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);call write~int(5 + thread2_#t~mem31#1, ~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);havoc thread2_#t~mem31#1; {5105#true} is VALID [2022-02-20 19:04:03,938 INFO L272 TraceCheckUtils]: 47: Hoare triple {5105#true} call __CS_cs(); {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:03,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:03,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:03,939 INFO L290 TraceCheckUtils]: 50: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:03,939 INFO L290 TraceCheckUtils]: 51: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:03,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:03,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,940 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5105#true} {5105#true} #492#return; {5105#true} is VALID [2022-02-20 19:04:03,940 INFO L290 TraceCheckUtils]: 55: Hoare triple {5105#true} assume !(0 != ~__CS_ret~0 % 256); {5105#true} is VALID [2022-02-20 19:04:03,941 INFO L272 TraceCheckUtils]: 56: Hoare triple {5105#true} call thread2_#t~ret32#1 := __CS_pthread_mutex_unlock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {5203#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:03,941 INFO L290 TraceCheckUtils]: 57: Hoare triple {5203#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {5105#true} is VALID [2022-02-20 19:04:03,941 INFO L290 TraceCheckUtils]: 58: Hoare triple {5105#true} assume #t~mem10 % 256 != 1 + ~__CS_thread_index~0 % 256;havoc #t~mem10;~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;#res := 1; {5105#true} is VALID [2022-02-20 19:04:03,941 INFO L290 TraceCheckUtils]: 59: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,941 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5105#true} {5105#true} #494#return; {5105#true} is VALID [2022-02-20 19:04:03,941 INFO L290 TraceCheckUtils]: 61: Hoare triple {5105#true} assume -2147483648 <= thread2_#t~ret32#1 && thread2_#t~ret32#1 <= 2147483647;havoc thread2_#t~ret32#1; {5105#true} is VALID [2022-02-20 19:04:03,941 INFO L272 TraceCheckUtils]: 62: Hoare triple {5105#true} call __CS_cs(); {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:03,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {5201#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:03,942 INFO L290 TraceCheckUtils]: 64: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:03,942 INFO L290 TraceCheckUtils]: 65: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:03,942 INFO L290 TraceCheckUtils]: 66: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:03,942 INFO L290 TraceCheckUtils]: 67: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:03,942 INFO L290 TraceCheckUtils]: 68: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,942 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {5105#true} {5105#true} #496#return; {5105#true} is VALID [2022-02-20 19:04:03,942 INFO L290 TraceCheckUtils]: 70: Hoare triple {5105#true} assume 0 != ~__CS_ret~0 % 256;thread2_#res#1.base, thread2_#res#1.offset := 0, 0; {5105#true} is VALID [2022-02-20 19:04:03,942 INFO L290 TraceCheckUtils]: 71: Hoare triple {5105#true} #t~ret106#1.base, #t~ret106#1.offset := thread2_#res#1.base, thread2_#res#1.offset;assume { :end_inline_thread2 } true;#t~funptrres104#1.base, #t~funptrres104#1.offset := #t~ret106#1.base, #t~ret106#1.offset; {5105#true} is VALID [2022-02-20 19:04:03,943 INFO L290 TraceCheckUtils]: 72: Hoare triple {5105#true} #res#1.base, #res#1.offset := #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~ret105#1.base, #t~ret105#1.offset;havoc #t~ret106#1.base, #t~ret106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset; {5105#true} is VALID [2022-02-20 19:04:03,943 INFO L290 TraceCheckUtils]: 73: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:03,943 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {5105#true} {5106#false} #534#return; {5106#false} is VALID [2022-02-20 19:04:03,943 INFO L290 TraceCheckUtils]: 75: Hoare triple {5106#false} havoc main_#t~ret76#1.base, main_#t~ret76#1.offset; {5106#false} is VALID [2022-02-20 19:04:03,943 INFO L290 TraceCheckUtils]: 76: Hoare triple {5106#false} assume ~__CS_ret~0 % 256 != ~__CS_ret_PREEMPTED~0 % 256;call write~int(~__THREAD_FINISHED~0, ~#__CS_thread_status~0.base, 2 + (~#__CS_thread_status~0.offset + 3 * (~__CS_round~0 % 256)), 1); {5106#false} is VALID [2022-02-20 19:04:03,943 INFO L290 TraceCheckUtils]: 77: Hoare triple {5106#false} call main_#t~mem77#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem78#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:03,943 INFO L290 TraceCheckUtils]: 78: Hoare triple {5106#false} assume !!(main_#t~mem77#1 % 256 == main_#t~mem78#1 % 256);havoc main_#t~mem77#1;havoc main_#t~mem78#1; {5106#false} is VALID [2022-02-20 19:04:03,943 INFO L290 TraceCheckUtils]: 79: Hoare triple {5106#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:03,943 INFO L290 TraceCheckUtils]: 80: Hoare triple {5106#false} assume !!(main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256);havoc main_#t~mem79#1;havoc main_#t~mem80#1; {5106#false} is VALID [2022-02-20 19:04:03,944 INFO L290 TraceCheckUtils]: 81: Hoare triple {5106#false} call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:03,944 INFO L290 TraceCheckUtils]: 82: Hoare triple {5106#false} assume !!(main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256);havoc main_#t~mem81#1;havoc main_#t~mem82#1; {5106#false} is VALID [2022-02-20 19:04:03,944 INFO L290 TraceCheckUtils]: 83: Hoare triple {5106#false} call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:03,944 INFO L290 TraceCheckUtils]: 84: Hoare triple {5106#false} assume !!(main_#t~mem83#1.base == main_#t~mem84#1.base && main_#t~mem83#1.offset == main_#t~mem84#1.offset);havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; {5106#false} is VALID [2022-02-20 19:04:03,944 INFO L290 TraceCheckUtils]: 85: Hoare triple {5106#false} call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:03,944 INFO L290 TraceCheckUtils]: 86: Hoare triple {5106#false} assume !!(main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {5106#false} is VALID [2022-02-20 19:04:03,944 INFO L290 TraceCheckUtils]: 87: Hoare triple {5106#false} call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:03,944 INFO L290 TraceCheckUtils]: 88: Hoare triple {5106#false} assume !!(main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset; {5106#false} is VALID [2022-02-20 19:04:03,944 INFO L290 TraceCheckUtils]: 89: Hoare triple {5106#false} call main_#t~mem89#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:03,945 INFO L290 TraceCheckUtils]: 90: Hoare triple {5106#false} assume !!(main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256);havoc main_#t~mem89#1;havoc main_#t~mem90#1; {5106#false} is VALID [2022-02-20 19:04:03,945 INFO L290 TraceCheckUtils]: 91: Hoare triple {5106#false} call main_#t~mem91#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:03,945 INFO L290 TraceCheckUtils]: 92: Hoare triple {5106#false} assume !!(main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256);havoc main_#t~mem91#1;havoc main_#t~mem92#1; {5106#false} is VALID [2022-02-20 19:04:03,945 INFO L290 TraceCheckUtils]: 93: Hoare triple {5106#false} call main_#t~mem93#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem94#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:03,945 INFO L290 TraceCheckUtils]: 94: Hoare triple {5106#false} assume !!(main_#t~mem93#1 == main_#t~mem94#1);havoc main_#t~mem93#1;havoc main_#t~mem94#1; {5106#false} is VALID [2022-02-20 19:04:03,945 INFO L290 TraceCheckUtils]: 95: Hoare triple {5106#false} call main_#t~mem95#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:03,945 INFO L290 TraceCheckUtils]: 96: Hoare triple {5106#false} assume !!(main_#t~mem95#1 == main_#t~mem96#1);havoc main_#t~mem95#1;havoc main_#t~mem96#1; {5106#false} is VALID [2022-02-20 19:04:03,945 INFO L290 TraceCheckUtils]: 97: Hoare triple {5106#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5106#false} is VALID [2022-02-20 19:04:03,945 INFO L290 TraceCheckUtils]: 98: Hoare triple {5106#false} assume 0 == __VERIFIER_assert_~cond#1; {5106#false} is VALID [2022-02-20 19:04:03,946 INFO L290 TraceCheckUtils]: 99: Hoare triple {5106#false} assume !false; {5106#false} is VALID [2022-02-20 19:04:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-02-20 19:04:03,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:04:03,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155817782] [2022-02-20 19:04:03,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155817782] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:04:03,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089980084] [2022-02-20 19:04:03,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:03,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:04:03,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:04:03,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:04:03,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 19:04:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:04,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 2039 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 19:04:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:04,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:04:04,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {5105#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);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);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);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);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);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~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; {5105#true} is VALID [2022-02-20 19:04:04,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {5105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:04,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:04,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:04,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:04,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:04,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:04,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:04,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:04,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~2#1 < 3); {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:04,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:04,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {5108#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 19:04:04,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {5108#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 2); {5106#false} is VALID [2022-02-20 19:04:04,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {5106#false} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem58#1.base, main_#t~mem58#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem59#1.base, main_#t~mem59#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem61#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem62#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem63#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem64#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem64#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem65#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {5106#false} is VALID [2022-02-20 19:04:04,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {5106#false} assume !(1 == main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {5106#false} is VALID [2022-02-20 19:04:04,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {5106#false} call main_#t~mem69#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {5106#false} is VALID [2022-02-20 19:04:04,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {5106#false} assume !(1 == main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {5106#false} is VALID [2022-02-20 19:04:04,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {5106#false} call main_#t~mem73#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {5106#false} is VALID [2022-02-20 19:04:04,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {5106#false} assume 1 == main_#t~mem73#1 % 256;havoc main_#t~mem73#1;call main_#t~mem74#1 := read~int(~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_round~0 := main_#t~mem74#1;havoc main_#t~mem74#1;~__CS_ret~0 := 0; {5106#false} is VALID [2022-02-20 19:04:04,913 INFO L272 TraceCheckUtils]: 19: Hoare triple {5106#false} call main_#t~ret76#1.base, main_#t~ret76#1.offset := ##fun~$Pointer$~TO~$Pointer$(0, 0, ~__CS_thread~0.base[2], ~__CS_thread~0.offset[2]); {5106#false} is VALID [2022-02-20 19:04:04,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {5106#false} #~75#1.base, #~75#1.offset := #in~75#1.base, #in~75#1.offset; {5106#false} is VALID [2022-02-20 19:04:04,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {5106#false} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {5106#false} is VALID [2022-02-20 19:04:04,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {5106#false} assume #in~#fp#1.base == #funAddr~thread2.base && #in~#fp#1.offset == #funAddr~thread2.offset;assume { :begin_inline_thread2 } true;thread2_#in~arg#1.base, thread2_#in~arg#1.offset := #~75#1.base, #~75#1.offset;havoc thread2_#res#1.base, thread2_#res#1.offset;havoc thread2_#t~ret30#1, thread2_#t~mem31#1, thread2_#t~ret32#1, thread2_#t~ret33#1, thread2_#t~mem34#1, thread2_#t~ret35#1, thread2_~arg#1.base, thread2_~arg#1.offset;thread2_~arg#1.base, thread2_~arg#1.offset := thread2_#in~arg#1.base, thread2_#in~arg#1.offset; {5106#false} is VALID [2022-02-20 19:04:04,913 INFO L272 TraceCheckUtils]: 23: Hoare triple {5106#false} call __CS_cs(); {5106#false} is VALID [2022-02-20 19:04:04,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {5106#false} ~k~0 := #t~nondet3;havoc #t~nondet3; {5106#false} is VALID [2022-02-20 19:04:04,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {5106#false} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5106#false} is VALID [2022-02-20 19:04:04,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {5106#false} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5106#false} is VALID [2022-02-20 19:04:04,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {5106#false} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5106#false} is VALID [2022-02-20 19:04:04,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {5106#false} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5106#false} is VALID [2022-02-20 19:04:04,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {5106#false} assume true; {5106#false} is VALID [2022-02-20 19:04:04,914 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5106#false} {5106#false} #486#return; {5106#false} is VALID [2022-02-20 19:04:04,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {5106#false} assume !(0 != ~__CS_ret~0 % 256); {5106#false} is VALID [2022-02-20 19:04:04,914 INFO L272 TraceCheckUtils]: 32: Hoare triple {5106#false} call thread2_#t~ret30#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {5106#false} is VALID [2022-02-20 19:04:04,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {5106#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {5106#false} is VALID [2022-02-20 19:04:04,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {5106#false} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {5106#false} is VALID [2022-02-20 19:04:04,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {5106#false} assume true; {5106#false} is VALID [2022-02-20 19:04:04,915 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5106#false} {5106#false} #488#return; {5106#false} is VALID [2022-02-20 19:04:04,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {5106#false} assume -2147483648 <= thread2_#t~ret30#1 && thread2_#t~ret30#1 <= 2147483647;havoc thread2_#t~ret30#1; {5106#false} is VALID [2022-02-20 19:04:04,915 INFO L272 TraceCheckUtils]: 38: Hoare triple {5106#false} call __CS_cs(); {5106#false} is VALID [2022-02-20 19:04:04,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {5106#false} ~k~0 := #t~nondet3;havoc #t~nondet3; {5106#false} is VALID [2022-02-20 19:04:04,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {5106#false} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5106#false} is VALID [2022-02-20 19:04:04,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {5106#false} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5106#false} is VALID [2022-02-20 19:04:04,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {5106#false} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5106#false} is VALID [2022-02-20 19:04:04,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {5106#false} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5106#false} is VALID [2022-02-20 19:04:04,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {5106#false} assume true; {5106#false} is VALID [2022-02-20 19:04:04,918 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5106#false} {5106#false} #490#return; {5106#false} is VALID [2022-02-20 19:04:04,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {5106#false} assume !(0 != ~__CS_ret~0 % 256);call thread2_#t~mem31#1 := read~int(~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);call write~int(5 + thread2_#t~mem31#1, ~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);havoc thread2_#t~mem31#1; {5106#false} is VALID [2022-02-20 19:04:04,918 INFO L272 TraceCheckUtils]: 47: Hoare triple {5106#false} call __CS_cs(); {5106#false} is VALID [2022-02-20 19:04:04,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {5106#false} ~k~0 := #t~nondet3;havoc #t~nondet3; {5106#false} is VALID [2022-02-20 19:04:04,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {5106#false} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5106#false} is VALID [2022-02-20 19:04:04,920 INFO L290 TraceCheckUtils]: 50: Hoare triple {5106#false} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5106#false} is VALID [2022-02-20 19:04:04,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {5106#false} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5106#false} is VALID [2022-02-20 19:04:04,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {5106#false} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5106#false} is VALID [2022-02-20 19:04:04,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {5106#false} assume true; {5106#false} is VALID [2022-02-20 19:04:04,935 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5106#false} {5106#false} #492#return; {5106#false} is VALID [2022-02-20 19:04:04,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {5106#false} assume !(0 != ~__CS_ret~0 % 256); {5106#false} is VALID [2022-02-20 19:04:04,935 INFO L272 TraceCheckUtils]: 56: Hoare triple {5106#false} call thread2_#t~ret32#1 := __CS_pthread_mutex_unlock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {5106#false} is VALID [2022-02-20 19:04:04,935 INFO L290 TraceCheckUtils]: 57: Hoare triple {5106#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {5106#false} assume #t~mem10 % 256 != 1 + ~__CS_thread_index~0 % 256;havoc #t~mem10;~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;#res := 1; {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {5106#false} assume true; {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5106#false} {5106#false} #494#return; {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {5106#false} assume -2147483648 <= thread2_#t~ret32#1 && thread2_#t~ret32#1 <= 2147483647;havoc thread2_#t~ret32#1; {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L272 TraceCheckUtils]: 62: Hoare triple {5106#false} call __CS_cs(); {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {5106#false} ~k~0 := #t~nondet3;havoc #t~nondet3; {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L290 TraceCheckUtils]: 64: Hoare triple {5106#false} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L290 TraceCheckUtils]: 65: Hoare triple {5106#false} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L290 TraceCheckUtils]: 66: Hoare triple {5106#false} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L290 TraceCheckUtils]: 67: Hoare triple {5106#false} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L290 TraceCheckUtils]: 68: Hoare triple {5106#false} assume true; {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {5106#false} {5106#false} #496#return; {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L290 TraceCheckUtils]: 70: Hoare triple {5106#false} assume 0 != ~__CS_ret~0 % 256;thread2_#res#1.base, thread2_#res#1.offset := 0, 0; {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L290 TraceCheckUtils]: 71: Hoare triple {5106#false} #t~ret106#1.base, #t~ret106#1.offset := thread2_#res#1.base, thread2_#res#1.offset;assume { :end_inline_thread2 } true;#t~funptrres104#1.base, #t~funptrres104#1.offset := #t~ret106#1.base, #t~ret106#1.offset; {5106#false} is VALID [2022-02-20 19:04:04,936 INFO L290 TraceCheckUtils]: 72: Hoare triple {5106#false} #res#1.base, #res#1.offset := #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~ret105#1.base, #t~ret105#1.offset;havoc #t~ret106#1.base, #t~ret106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset; {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 73: Hoare triple {5106#false} assume true; {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {5106#false} {5106#false} #534#return; {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 75: Hoare triple {5106#false} havoc main_#t~ret76#1.base, main_#t~ret76#1.offset; {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 76: Hoare triple {5106#false} assume ~__CS_ret~0 % 256 != ~__CS_ret_PREEMPTED~0 % 256;call write~int(~__THREAD_FINISHED~0, ~#__CS_thread_status~0.base, 2 + (~#__CS_thread_status~0.offset + 3 * (~__CS_round~0 % 256)), 1); {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 77: Hoare triple {5106#false} call main_#t~mem77#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem78#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 78: Hoare triple {5106#false} assume !!(main_#t~mem77#1 % 256 == main_#t~mem78#1 % 256);havoc main_#t~mem77#1;havoc main_#t~mem78#1; {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 79: Hoare triple {5106#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 80: Hoare triple {5106#false} assume !!(main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256);havoc main_#t~mem79#1;havoc main_#t~mem80#1; {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 81: Hoare triple {5106#false} call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 82: Hoare triple {5106#false} assume !!(main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256);havoc main_#t~mem81#1;havoc main_#t~mem82#1; {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 83: Hoare triple {5106#false} call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 84: Hoare triple {5106#false} assume !!(main_#t~mem83#1.base == main_#t~mem84#1.base && main_#t~mem83#1.offset == main_#t~mem84#1.offset);havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 85: Hoare triple {5106#false} call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 86: Hoare triple {5106#false} assume !!(main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 87: Hoare triple {5106#false} call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 88: Hoare triple {5106#false} assume !!(main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset; {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 89: Hoare triple {5106#false} call main_#t~mem89#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 90: Hoare triple {5106#false} assume !!(main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256);havoc main_#t~mem89#1;havoc main_#t~mem90#1; {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 91: Hoare triple {5106#false} call main_#t~mem91#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:04,937 INFO L290 TraceCheckUtils]: 92: Hoare triple {5106#false} assume !!(main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256);havoc main_#t~mem91#1;havoc main_#t~mem92#1; {5106#false} is VALID [2022-02-20 19:04:04,938 INFO L290 TraceCheckUtils]: 93: Hoare triple {5106#false} call main_#t~mem93#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem94#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:04,938 INFO L290 TraceCheckUtils]: 94: Hoare triple {5106#false} assume !!(main_#t~mem93#1 == main_#t~mem94#1);havoc main_#t~mem93#1;havoc main_#t~mem94#1; {5106#false} is VALID [2022-02-20 19:04:04,938 INFO L290 TraceCheckUtils]: 95: Hoare triple {5106#false} call main_#t~mem95#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:04,938 INFO L290 TraceCheckUtils]: 96: Hoare triple {5106#false} assume !!(main_#t~mem95#1 == main_#t~mem96#1);havoc main_#t~mem95#1;havoc main_#t~mem96#1; {5106#false} is VALID [2022-02-20 19:04:04,938 INFO L290 TraceCheckUtils]: 97: Hoare triple {5106#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5106#false} is VALID [2022-02-20 19:04:04,938 INFO L290 TraceCheckUtils]: 98: Hoare triple {5106#false} assume 0 == __VERIFIER_assert_~cond#1; {5106#false} is VALID [2022-02-20 19:04:04,938 INFO L290 TraceCheckUtils]: 99: Hoare triple {5106#false} assume !false; {5106#false} is VALID [2022-02-20 19:04:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-02-20 19:04:04,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:04:05,257 INFO L290 TraceCheckUtils]: 99: Hoare triple {5106#false} assume !false; {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 98: Hoare triple {5106#false} assume 0 == __VERIFIER_assert_~cond#1; {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 97: Hoare triple {5106#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 96: Hoare triple {5106#false} assume !!(main_#t~mem95#1 == main_#t~mem96#1);havoc main_#t~mem95#1;havoc main_#t~mem96#1; {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 95: Hoare triple {5106#false} call main_#t~mem95#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 94: Hoare triple {5106#false} assume !!(main_#t~mem93#1 == main_#t~mem94#1);havoc main_#t~mem93#1;havoc main_#t~mem94#1; {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 93: Hoare triple {5106#false} call main_#t~mem93#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem94#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 92: Hoare triple {5106#false} assume !!(main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256);havoc main_#t~mem91#1;havoc main_#t~mem92#1; {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 91: Hoare triple {5106#false} call main_#t~mem91#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 90: Hoare triple {5106#false} assume !!(main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256);havoc main_#t~mem89#1;havoc main_#t~mem90#1; {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 89: Hoare triple {5106#false} call main_#t~mem89#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 88: Hoare triple {5106#false} assume !!(main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset; {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 87: Hoare triple {5106#false} call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 86: Hoare triple {5106#false} assume !!(main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 85: Hoare triple {5106#false} call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 84: Hoare triple {5106#false} assume !!(main_#t~mem83#1.base == main_#t~mem84#1.base && main_#t~mem83#1.offset == main_#t~mem84#1.offset);havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 83: Hoare triple {5106#false} call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5106#false} is VALID [2022-02-20 19:04:05,258 INFO L290 TraceCheckUtils]: 82: Hoare triple {5106#false} assume !!(main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256);havoc main_#t~mem81#1;havoc main_#t~mem82#1; {5106#false} is VALID [2022-02-20 19:04:05,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {5106#false} call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:05,259 INFO L290 TraceCheckUtils]: 80: Hoare triple {5106#false} assume !!(main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256);havoc main_#t~mem79#1;havoc main_#t~mem80#1; {5106#false} is VALID [2022-02-20 19:04:05,259 INFO L290 TraceCheckUtils]: 79: Hoare triple {5106#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:05,259 INFO L290 TraceCheckUtils]: 78: Hoare triple {5106#false} assume !!(main_#t~mem77#1 % 256 == main_#t~mem78#1 % 256);havoc main_#t~mem77#1;havoc main_#t~mem78#1; {5106#false} is VALID [2022-02-20 19:04:05,259 INFO L290 TraceCheckUtils]: 77: Hoare triple {5106#false} call main_#t~mem77#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem78#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5106#false} is VALID [2022-02-20 19:04:05,259 INFO L290 TraceCheckUtils]: 76: Hoare triple {5106#false} assume ~__CS_ret~0 % 256 != ~__CS_ret_PREEMPTED~0 % 256;call write~int(~__THREAD_FINISHED~0, ~#__CS_thread_status~0.base, 2 + (~#__CS_thread_status~0.offset + 3 * (~__CS_round~0 % 256)), 1); {5106#false} is VALID [2022-02-20 19:04:05,260 INFO L290 TraceCheckUtils]: 75: Hoare triple {5106#false} havoc main_#t~ret76#1.base, main_#t~ret76#1.offset; {5106#false} is VALID [2022-02-20 19:04:05,260 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {5105#true} {5106#false} #534#return; {5106#false} is VALID [2022-02-20 19:04:05,260 INFO L290 TraceCheckUtils]: 73: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:05,260 INFO L290 TraceCheckUtils]: 72: Hoare triple {5105#true} #res#1.base, #res#1.offset := #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~ret105#1.base, #t~ret105#1.offset;havoc #t~ret106#1.base, #t~ret106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset; {5105#true} is VALID [2022-02-20 19:04:05,260 INFO L290 TraceCheckUtils]: 71: Hoare triple {5105#true} #t~ret106#1.base, #t~ret106#1.offset := thread2_#res#1.base, thread2_#res#1.offset;assume { :end_inline_thread2 } true;#t~funptrres104#1.base, #t~funptrres104#1.offset := #t~ret106#1.base, #t~ret106#1.offset; {5105#true} is VALID [2022-02-20 19:04:05,260 INFO L290 TraceCheckUtils]: 70: Hoare triple {5105#true} assume 0 != ~__CS_ret~0 % 256;thread2_#res#1.base, thread2_#res#1.offset := 0, 0; {5105#true} is VALID [2022-02-20 19:04:05,260 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {5105#true} {5105#true} #496#return; {5105#true} is VALID [2022-02-20 19:04:05,260 INFO L290 TraceCheckUtils]: 68: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:05,260 INFO L290 TraceCheckUtils]: 67: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:05,261 INFO L290 TraceCheckUtils]: 66: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:05,261 INFO L290 TraceCheckUtils]: 65: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:05,261 INFO L290 TraceCheckUtils]: 64: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:05,261 INFO L290 TraceCheckUtils]: 63: Hoare triple {5105#true} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:05,261 INFO L272 TraceCheckUtils]: 62: Hoare triple {5105#true} call __CS_cs(); {5105#true} is VALID [2022-02-20 19:04:05,261 INFO L290 TraceCheckUtils]: 61: Hoare triple {5105#true} assume -2147483648 <= thread2_#t~ret32#1 && thread2_#t~ret32#1 <= 2147483647;havoc thread2_#t~ret32#1; {5105#true} is VALID [2022-02-20 19:04:05,261 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5105#true} {5105#true} #494#return; {5105#true} is VALID [2022-02-20 19:04:05,261 INFO L290 TraceCheckUtils]: 59: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:05,261 INFO L290 TraceCheckUtils]: 58: Hoare triple {5105#true} assume #t~mem10 % 256 != 1 + ~__CS_thread_index~0 % 256;havoc #t~mem10;~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;#res := 1; {5105#true} is VALID [2022-02-20 19:04:05,262 INFO L290 TraceCheckUtils]: 57: Hoare triple {5105#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {5105#true} is VALID [2022-02-20 19:04:05,262 INFO L272 TraceCheckUtils]: 56: Hoare triple {5105#true} call thread2_#t~ret32#1 := __CS_pthread_mutex_unlock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {5105#true} is VALID [2022-02-20 19:04:05,262 INFO L290 TraceCheckUtils]: 55: Hoare triple {5105#true} assume !(0 != ~__CS_ret~0 % 256); {5105#true} is VALID [2022-02-20 19:04:05,262 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5105#true} {5105#true} #492#return; {5105#true} is VALID [2022-02-20 19:04:05,262 INFO L290 TraceCheckUtils]: 53: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:05,262 INFO L290 TraceCheckUtils]: 52: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:05,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:05,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:05,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:05,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {5105#true} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:05,263 INFO L272 TraceCheckUtils]: 47: Hoare triple {5105#true} call __CS_cs(); {5105#true} is VALID [2022-02-20 19:04:05,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {5105#true} assume !(0 != ~__CS_ret~0 % 256);call thread2_#t~mem31#1 := read~int(~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);call write~int(5 + thread2_#t~mem31#1, ~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);havoc thread2_#t~mem31#1; {5105#true} is VALID [2022-02-20 19:04:05,263 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5105#true} {5105#true} #490#return; {5105#true} is VALID [2022-02-20 19:04:05,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:05,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:05,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:05,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:05,263 INFO L290 TraceCheckUtils]: 40: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:05,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {5105#true} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:05,264 INFO L272 TraceCheckUtils]: 38: Hoare triple {5105#true} call __CS_cs(); {5105#true} is VALID [2022-02-20 19:04:05,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {5105#true} assume -2147483648 <= thread2_#t~ret30#1 && thread2_#t~ret30#1 <= 2147483647;havoc thread2_#t~ret30#1; {5105#true} is VALID [2022-02-20 19:04:05,264 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5105#true} {5105#true} #488#return; {5105#true} is VALID [2022-02-20 19:04:05,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:05,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {5105#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {5105#true} is VALID [2022-02-20 19:04:05,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {5105#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {5105#true} is VALID [2022-02-20 19:04:05,264 INFO L272 TraceCheckUtils]: 32: Hoare triple {5105#true} call thread2_#t~ret30#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {5105#true} is VALID [2022-02-20 19:04:05,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {5105#true} assume !(0 != ~__CS_ret~0 % 256); {5105#true} is VALID [2022-02-20 19:04:05,264 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5105#true} {5105#true} #486#return; {5105#true} is VALID [2022-02-20 19:04:05,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {5105#true} assume true; {5105#true} is VALID [2022-02-20 19:04:05,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {5105#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {5105#true} is VALID [2022-02-20 19:04:05,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {5105#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {5105#true} is VALID [2022-02-20 19:04:05,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {5105#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5105#true} is VALID [2022-02-20 19:04:05,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {5105#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {5105#true} is VALID [2022-02-20 19:04:05,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {5105#true} ~k~0 := #t~nondet3;havoc #t~nondet3; {5105#true} is VALID [2022-02-20 19:04:05,265 INFO L272 TraceCheckUtils]: 23: Hoare triple {5105#true} call __CS_cs(); {5105#true} is VALID [2022-02-20 19:04:05,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {5105#true} assume #in~#fp#1.base == #funAddr~thread2.base && #in~#fp#1.offset == #funAddr~thread2.offset;assume { :begin_inline_thread2 } true;thread2_#in~arg#1.base, thread2_#in~arg#1.offset := #~75#1.base, #~75#1.offset;havoc thread2_#res#1.base, thread2_#res#1.offset;havoc thread2_#t~ret30#1, thread2_#t~mem31#1, thread2_#t~ret32#1, thread2_#t~ret33#1, thread2_#t~mem34#1, thread2_#t~ret35#1, thread2_~arg#1.base, thread2_~arg#1.offset;thread2_~arg#1.base, thread2_~arg#1.offset := thread2_#in~arg#1.base, thread2_#in~arg#1.offset; {5105#true} is VALID [2022-02-20 19:04:05,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {5105#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {5105#true} is VALID [2022-02-20 19:04:05,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {5105#true} #~75#1.base, #~75#1.offset := #in~75#1.base, #in~75#1.offset; {5105#true} is VALID [2022-02-20 19:04:05,266 INFO L272 TraceCheckUtils]: 19: Hoare triple {5106#false} call main_#t~ret76#1.base, main_#t~ret76#1.offset := ##fun~$Pointer$~TO~$Pointer$(0, 0, ~__CS_thread~0.base[2], ~__CS_thread~0.offset[2]); {5105#true} is VALID [2022-02-20 19:04:05,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {5106#false} assume 1 == main_#t~mem73#1 % 256;havoc main_#t~mem73#1;call main_#t~mem74#1 := read~int(~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_round~0 := main_#t~mem74#1;havoc main_#t~mem74#1;~__CS_ret~0 := 0; {5106#false} is VALID [2022-02-20 19:04:05,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {5106#false} call main_#t~mem73#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {5106#false} is VALID [2022-02-20 19:04:05,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {5106#false} assume !(1 == main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {5106#false} is VALID [2022-02-20 19:04:05,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {5106#false} call main_#t~mem69#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {5106#false} is VALID [2022-02-20 19:04:05,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {5106#false} assume !(1 == main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {5106#false} is VALID [2022-02-20 19:04:05,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {5106#false} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem58#1.base, main_#t~mem58#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem59#1.base, main_#t~mem59#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem61#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem62#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem63#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem64#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem64#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem65#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {5106#false} is VALID [2022-02-20 19:04:05,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {5108#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 2); {5106#false} is VALID [2022-02-20 19:04:05,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {5108#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 19:04:05,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:05,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~2#1 < 3); {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:05,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:05,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:05,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:05,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:05,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:05,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:05,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:05,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {5105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; {5210#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:05,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {5105#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);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);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);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);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);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~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; {5105#true} is VALID [2022-02-20 19:04:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-02-20 19:04:05,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089980084] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:04:05,272 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:04:05,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-02-20 19:04:05,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963023056] [2022-02-20 19:04:05,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:04:05,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 100 [2022-02-20 19:04:05,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:04:05,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-20 19:04:05,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:05,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:04:05,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:04:05,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:04:05,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:04:05,372 INFO L87 Difference]: Start difference. First operand 305 states and 466 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-20 19:04:11,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 19:04:13,604 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 19:04:15,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 19:04:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:23,618 INFO L93 Difference]: Finished difference Result 617 states and 950 transitions. [2022-02-20 19:04:23,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 19:04:23,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 100 [2022-02-20 19:04:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:04:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-20 19:04:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 506 transitions. [2022-02-20 19:04:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-20 19:04:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 506 transitions. [2022-02-20 19:04:23,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 506 transitions. [2022-02-20 19:04:24,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 506 edges. 506 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:24,026 INFO L225 Difference]: With dead ends: 617 [2022-02-20 19:04:24,027 INFO L226 Difference]: Without dead ends: 325 [2022-02-20 19:04:24,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:04:24,031 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 36 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:04:24,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1167 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 613 Invalid, 3 Unknown, 0 Unchecked, 6.8s Time] [2022-02-20 19:04:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-02-20 19:04:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 319. [2022-02-20 19:04:24,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:04:24,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand has 319 states, 219 states have (on average 1.3926940639269407) internal successors, (305), 221 states have internal predecessors, (305), 83 states have call successors, (83), 14 states have call predecessors, (83), 16 states have return successors, (97), 83 states have call predecessors, (97), 83 states have call successors, (97) [2022-02-20 19:04:24,065 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand has 319 states, 219 states have (on average 1.3926940639269407) internal successors, (305), 221 states have internal predecessors, (305), 83 states have call successors, (83), 14 states have call predecessors, (83), 16 states have return successors, (97), 83 states have call predecessors, (97), 83 states have call successors, (97) [2022-02-20 19:04:24,066 INFO L87 Difference]: Start difference. First operand 325 states. Second operand has 319 states, 219 states have (on average 1.3926940639269407) internal successors, (305), 221 states have internal predecessors, (305), 83 states have call successors, (83), 14 states have call predecessors, (83), 16 states have return successors, (97), 83 states have call predecessors, (97), 83 states have call successors, (97) [2022-02-20 19:04:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:24,079 INFO L93 Difference]: Finished difference Result 325 states and 498 transitions. [2022-02-20 19:04:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 498 transitions. [2022-02-20 19:04:24,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:24,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:24,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 219 states have (on average 1.3926940639269407) internal successors, (305), 221 states have internal predecessors, (305), 83 states have call successors, (83), 14 states have call predecessors, (83), 16 states have return successors, (97), 83 states have call predecessors, (97), 83 states have call successors, (97) Second operand 325 states. [2022-02-20 19:04:24,082 INFO L87 Difference]: Start difference. First operand has 319 states, 219 states have (on average 1.3926940639269407) internal successors, (305), 221 states have internal predecessors, (305), 83 states have call successors, (83), 14 states have call predecessors, (83), 16 states have return successors, (97), 83 states have call predecessors, (97), 83 states have call successors, (97) Second operand 325 states. [2022-02-20 19:04:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:24,092 INFO L93 Difference]: Finished difference Result 325 states and 498 transitions. [2022-02-20 19:04:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 498 transitions. [2022-02-20 19:04:24,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:24,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:24,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:04:24,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:04:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 219 states have (on average 1.3926940639269407) internal successors, (305), 221 states have internal predecessors, (305), 83 states have call successors, (83), 14 states have call predecessors, (83), 16 states have return successors, (97), 83 states have call predecessors, (97), 83 states have call successors, (97) [2022-02-20 19:04:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 485 transitions. [2022-02-20 19:04:24,104 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 485 transitions. Word has length 100 [2022-02-20 19:04:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:04:24,105 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 485 transitions. [2022-02-20 19:04:24,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-02-20 19:04:24,105 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 485 transitions. [2022-02-20 19:04:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-20 19:04:24,108 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:04:24,108 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:04:24,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 19:04:24,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:04:24,323 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:04:24,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:04:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash -420954683, now seen corresponding path program 2 times [2022-02-20 19:04:24,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:04:24,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926956971] [2022-02-20 19:04:24,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:24,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:04:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:24,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-20 19:04:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:24,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 19:04:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:24,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {7723#true} is VALID [2022-02-20 19:04:24,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {7723#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {7723#true} is VALID [2022-02-20 19:04:24,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7723#true} is VALID [2022-02-20 19:04:24,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {7723#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {7723#true} is VALID [2022-02-20 19:04:24,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {7723#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {7723#true} is VALID [2022-02-20 19:04:24,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,758 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #486#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:04:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:24,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {7820#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {7723#true} is VALID [2022-02-20 19:04:24,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {7723#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {7723#true} is VALID [2022-02-20 19:04:24,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #488#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:04:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:24,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {7723#true} is VALID [2022-02-20 19:04:24,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {7723#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {7723#true} is VALID [2022-02-20 19:04:24,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7723#true} is VALID [2022-02-20 19:04:24,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {7723#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {7723#true} is VALID [2022-02-20 19:04:24,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {7723#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {7723#true} is VALID [2022-02-20 19:04:24,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,780 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #490#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:04:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:24,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {7723#true} is VALID [2022-02-20 19:04:24,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {7723#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {7723#true} is VALID [2022-02-20 19:04:24,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7723#true} is VALID [2022-02-20 19:04:24,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {7723#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {7723#true} is VALID [2022-02-20 19:04:24,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {7723#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {7723#true} is VALID [2022-02-20 19:04:24,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,787 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #492#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 19:04:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:24,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {7821#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {7723#true} is VALID [2022-02-20 19:04:24,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {7723#true} assume #t~mem10 % 256 != 1 + ~__CS_thread_index~0 % 256;havoc #t~mem10;~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;#res := 1; {7723#true} is VALID [2022-02-20 19:04:24,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #494#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:04:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:24,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {7723#true} is VALID [2022-02-20 19:04:24,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {7723#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {7723#true} is VALID [2022-02-20 19:04:24,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7723#true} is VALID [2022-02-20 19:04:24,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {7723#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {7723#true} is VALID [2022-02-20 19:04:24,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {7723#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {7723#true} is VALID [2022-02-20 19:04:24,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,808 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #496#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {7781#(and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|))} #~75#1.base, #~75#1.offset := #in~75#1.base, #in~75#1.offset; {7723#true} is VALID [2022-02-20 19:04:24,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {7723#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {7723#true} is VALID [2022-02-20 19:04:24,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {7723#true} assume #in~#fp#1.base == #funAddr~thread2.base && #in~#fp#1.offset == #funAddr~thread2.offset;assume { :begin_inline_thread2 } true;thread2_#in~arg#1.base, thread2_#in~arg#1.offset := #~75#1.base, #~75#1.offset;havoc thread2_#res#1.base, thread2_#res#1.offset;havoc thread2_#t~ret30#1, thread2_#t~mem31#1, thread2_#t~ret32#1, thread2_#t~ret33#1, thread2_#t~mem34#1, thread2_#t~ret35#1, thread2_~arg#1.base, thread2_~arg#1.offset;thread2_~arg#1.base, thread2_~arg#1.offset := thread2_#in~arg#1.base, thread2_#in~arg#1.offset; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,809 INFO L272 TraceCheckUtils]: 3: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:24,810 INFO L290 TraceCheckUtils]: 4: Hoare triple {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {7723#true} is VALID [2022-02-20 19:04:24,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {7723#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {7723#true} is VALID [2022-02-20 19:04:24,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {7723#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7723#true} is VALID [2022-02-20 19:04:24,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {7723#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {7723#true} is VALID [2022-02-20 19:04:24,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {7723#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {7723#true} is VALID [2022-02-20 19:04:24,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #486#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume !(0 != ~__CS_ret~0 % 256); {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,811 INFO L272 TraceCheckUtils]: 12: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call thread2_#t~ret30#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {7820#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:24,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {7820#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {7723#true} is VALID [2022-02-20 19:04:24,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {7723#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {7723#true} is VALID [2022-02-20 19:04:24,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,812 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #488#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume -2147483648 <= thread2_#t~ret30#1 && thread2_#t~ret30#1 <= 2147483647;havoc thread2_#t~ret30#1; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,813 INFO L272 TraceCheckUtils]: 18: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:24,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {7723#true} is VALID [2022-02-20 19:04:24,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {7723#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {7723#true} is VALID [2022-02-20 19:04:24,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {7723#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7723#true} is VALID [2022-02-20 19:04:24,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {7723#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {7723#true} is VALID [2022-02-20 19:04:24,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {7723#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {7723#true} is VALID [2022-02-20 19:04:24,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,814 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #490#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume !(0 != ~__CS_ret~0 % 256);call thread2_#t~mem31#1 := read~int(~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);call write~int(5 + thread2_#t~mem31#1, ~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);havoc thread2_#t~mem31#1; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,815 INFO L272 TraceCheckUtils]: 27: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:24,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {7723#true} is VALID [2022-02-20 19:04:24,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {7723#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {7723#true} is VALID [2022-02-20 19:04:24,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {7723#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7723#true} is VALID [2022-02-20 19:04:24,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {7723#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {7723#true} is VALID [2022-02-20 19:04:24,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {7723#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {7723#true} is VALID [2022-02-20 19:04:24,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,816 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #492#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume !(0 != ~__CS_ret~0 % 256); {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,817 INFO L272 TraceCheckUtils]: 36: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call thread2_#t~ret32#1 := __CS_pthread_mutex_unlock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {7821#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:24,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {7821#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {7723#true} is VALID [2022-02-20 19:04:24,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {7723#true} assume #t~mem10 % 256 != 1 + ~__CS_thread_index~0 % 256;havoc #t~mem10;~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;#res := 1; {7723#true} is VALID [2022-02-20 19:04:24,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,817 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #494#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume -2147483648 <= thread2_#t~ret32#1 && thread2_#t~ret32#1 <= 2147483647;havoc thread2_#t~ret32#1; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,840 INFO L272 TraceCheckUtils]: 42: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:24,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {7723#true} is VALID [2022-02-20 19:04:24,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {7723#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {7723#true} is VALID [2022-02-20 19:04:24,841 INFO L290 TraceCheckUtils]: 45: Hoare triple {7723#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7723#true} is VALID [2022-02-20 19:04:24,841 INFO L290 TraceCheckUtils]: 46: Hoare triple {7723#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {7723#true} is VALID [2022-02-20 19:04:24,841 INFO L290 TraceCheckUtils]: 47: Hoare triple {7723#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {7723#true} is VALID [2022-02-20 19:04:24,841 INFO L290 TraceCheckUtils]: 48: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,841 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #496#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,842 INFO L290 TraceCheckUtils]: 50: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume 0 != ~__CS_ret~0 % 256;thread2_#res#1.base, thread2_#res#1.offset := 0, 0; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,842 INFO L290 TraceCheckUtils]: 51: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #t~ret106#1.base, #t~ret106#1.offset := thread2_#res#1.base, thread2_#res#1.offset;assume { :end_inline_thread2 } true;#t~funptrres104#1.base, #t~funptrres104#1.offset := #t~ret106#1.base, #t~ret106#1.offset; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,842 INFO L290 TraceCheckUtils]: 52: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #res#1.base, #res#1.offset := #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~ret105#1.base, #t~ret105#1.offset;havoc #t~ret106#1.base, #t~ret106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,842 INFO L290 TraceCheckUtils]: 53: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume true; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,843 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} {7725#(= (select ~__CS_thread~0.offset 2) 0)} #534#return; {7724#false} is VALID [2022-02-20 19:04:24,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {7723#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);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);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);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);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);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~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !(main_~j~2#1 < 3); {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !(main_~j~2#1 < 3); {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !(main_~i~0#1 < 2); {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem58#1.base, main_#t~mem58#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem59#1.base, main_#t~mem59#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem61#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem62#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem63#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem64#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem64#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem65#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !(1 == main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} call main_#t~mem69#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume !(1 == main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} call main_#t~mem73#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} assume 1 == main_#t~mem73#1 % 256;havoc main_#t~mem73#1;call main_#t~mem74#1 := read~int(~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_round~0 := main_#t~mem74#1;havoc main_#t~mem74#1;~__CS_ret~0 := 0; {7725#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:24,858 INFO L272 TraceCheckUtils]: 29: Hoare triple {7725#(= (select ~__CS_thread~0.offset 2) 0)} call main_#t~ret76#1.base, main_#t~ret76#1.offset := ##fun~$Pointer$~TO~$Pointer$(0, 0, ~__CS_thread~0.base[2], ~__CS_thread~0.offset[2]); {7781#(and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|))} is VALID [2022-02-20 19:04:24,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {7781#(and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|))} #~75#1.base, #~75#1.offset := #in~75#1.base, #in~75#1.offset; {7723#true} is VALID [2022-02-20 19:04:24,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {7723#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {7723#true} is VALID [2022-02-20 19:04:24,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {7723#true} assume #in~#fp#1.base == #funAddr~thread2.base && #in~#fp#1.offset == #funAddr~thread2.offset;assume { :begin_inline_thread2 } true;thread2_#in~arg#1.base, thread2_#in~arg#1.offset := #~75#1.base, #~75#1.offset;havoc thread2_#res#1.base, thread2_#res#1.offset;havoc thread2_#t~ret30#1, thread2_#t~mem31#1, thread2_#t~ret32#1, thread2_#t~ret33#1, thread2_#t~mem34#1, thread2_#t~ret35#1, thread2_~arg#1.base, thread2_~arg#1.offset;thread2_~arg#1.base, thread2_~arg#1.offset := thread2_#in~arg#1.base, thread2_#in~arg#1.offset; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,859 INFO L272 TraceCheckUtils]: 33: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:24,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {7723#true} is VALID [2022-02-20 19:04:24,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {7723#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {7723#true} is VALID [2022-02-20 19:04:24,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {7723#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7723#true} is VALID [2022-02-20 19:04:24,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {7723#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {7723#true} is VALID [2022-02-20 19:04:24,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {7723#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {7723#true} is VALID [2022-02-20 19:04:24,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,860 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #486#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume !(0 != ~__CS_ret~0 % 256); {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,861 INFO L272 TraceCheckUtils]: 42: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call thread2_#t~ret30#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {7820#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:24,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {7820#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {7723#true} is VALID [2022-02-20 19:04:24,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {7723#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {7723#true} is VALID [2022-02-20 19:04:24,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,862 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #488#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,862 INFO L290 TraceCheckUtils]: 47: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume -2147483648 <= thread2_#t~ret30#1 && thread2_#t~ret30#1 <= 2147483647;havoc thread2_#t~ret30#1; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,862 INFO L272 TraceCheckUtils]: 48: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:24,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {7723#true} is VALID [2022-02-20 19:04:24,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {7723#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {7723#true} is VALID [2022-02-20 19:04:24,863 INFO L290 TraceCheckUtils]: 51: Hoare triple {7723#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7723#true} is VALID [2022-02-20 19:04:24,863 INFO L290 TraceCheckUtils]: 52: Hoare triple {7723#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {7723#true} is VALID [2022-02-20 19:04:24,863 INFO L290 TraceCheckUtils]: 53: Hoare triple {7723#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {7723#true} is VALID [2022-02-20 19:04:24,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,863 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #490#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,864 INFO L290 TraceCheckUtils]: 56: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume !(0 != ~__CS_ret~0 % 256);call thread2_#t~mem31#1 := read~int(~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);call write~int(5 + thread2_#t~mem31#1, ~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);havoc thread2_#t~mem31#1; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,864 INFO L272 TraceCheckUtils]: 57: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:24,864 INFO L290 TraceCheckUtils]: 58: Hoare triple {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {7723#true} is VALID [2022-02-20 19:04:24,864 INFO L290 TraceCheckUtils]: 59: Hoare triple {7723#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {7723#true} is VALID [2022-02-20 19:04:24,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {7723#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7723#true} is VALID [2022-02-20 19:04:24,864 INFO L290 TraceCheckUtils]: 61: Hoare triple {7723#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {7723#true} is VALID [2022-02-20 19:04:24,864 INFO L290 TraceCheckUtils]: 62: Hoare triple {7723#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {7723#true} is VALID [2022-02-20 19:04:24,865 INFO L290 TraceCheckUtils]: 63: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,865 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #492#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,865 INFO L290 TraceCheckUtils]: 65: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume !(0 != ~__CS_ret~0 % 256); {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,866 INFO L272 TraceCheckUtils]: 66: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call thread2_#t~ret32#1 := __CS_pthread_mutex_unlock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {7821#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:24,866 INFO L290 TraceCheckUtils]: 67: Hoare triple {7821#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {7723#true} is VALID [2022-02-20 19:04:24,866 INFO L290 TraceCheckUtils]: 68: Hoare triple {7723#true} assume #t~mem10 % 256 != 1 + ~__CS_thread_index~0 % 256;havoc #t~mem10;~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;#res := 1; {7723#true} is VALID [2022-02-20 19:04:24,866 INFO L290 TraceCheckUtils]: 69: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,867 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #494#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,867 INFO L290 TraceCheckUtils]: 71: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume -2147483648 <= thread2_#t~ret32#1 && thread2_#t~ret32#1 <= 2147483647;havoc thread2_#t~ret32#1; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,873 INFO L272 TraceCheckUtils]: 72: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:24,873 INFO L290 TraceCheckUtils]: 73: Hoare triple {7819#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {7723#true} is VALID [2022-02-20 19:04:24,874 INFO L290 TraceCheckUtils]: 74: Hoare triple {7723#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {7723#true} is VALID [2022-02-20 19:04:24,874 INFO L290 TraceCheckUtils]: 75: Hoare triple {7723#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7723#true} is VALID [2022-02-20 19:04:24,874 INFO L290 TraceCheckUtils]: 76: Hoare triple {7723#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {7723#true} is VALID [2022-02-20 19:04:24,874 INFO L290 TraceCheckUtils]: 77: Hoare triple {7723#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {7723#true} is VALID [2022-02-20 19:04:24,874 INFO L290 TraceCheckUtils]: 78: Hoare triple {7723#true} assume true; {7723#true} is VALID [2022-02-20 19:04:24,874 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {7723#true} {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #496#return; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,875 INFO L290 TraceCheckUtils]: 80: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume 0 != ~__CS_ret~0 % 256;thread2_#res#1.base, thread2_#res#1.offset := 0, 0; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,876 INFO L290 TraceCheckUtils]: 81: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #t~ret106#1.base, #t~ret106#1.offset := thread2_#res#1.base, thread2_#res#1.offset;assume { :end_inline_thread2 } true;#t~funptrres104#1.base, #t~funptrres104#1.offset := #t~ret106#1.base, #t~ret106#1.offset; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,876 INFO L290 TraceCheckUtils]: 82: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #res#1.base, #res#1.offset := #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~ret105#1.base, #t~ret105#1.offset;havoc #t~ret106#1.base, #t~ret106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,876 INFO L290 TraceCheckUtils]: 83: Hoare triple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume true; {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:24,877 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7782#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} {7725#(= (select ~__CS_thread~0.offset 2) 0)} #534#return; {7724#false} is VALID [2022-02-20 19:04:24,877 INFO L290 TraceCheckUtils]: 85: Hoare triple {7724#false} havoc main_#t~ret76#1.base, main_#t~ret76#1.offset; {7724#false} is VALID [2022-02-20 19:04:24,877 INFO L290 TraceCheckUtils]: 86: Hoare triple {7724#false} assume ~__CS_ret~0 % 256 != ~__CS_ret_PREEMPTED~0 % 256;call write~int(~__THREAD_FINISHED~0, ~#__CS_thread_status~0.base, 2 + (~#__CS_thread_status~0.offset + 3 * (~__CS_round~0 % 256)), 1); {7724#false} is VALID [2022-02-20 19:04:24,878 INFO L290 TraceCheckUtils]: 87: Hoare triple {7724#false} call main_#t~mem77#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem78#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {7724#false} is VALID [2022-02-20 19:04:24,878 INFO L290 TraceCheckUtils]: 88: Hoare triple {7724#false} assume !!(main_#t~mem77#1 % 256 == main_#t~mem78#1 % 256);havoc main_#t~mem77#1;havoc main_#t~mem78#1; {7724#false} is VALID [2022-02-20 19:04:24,878 INFO L290 TraceCheckUtils]: 89: Hoare triple {7724#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {7724#false} is VALID [2022-02-20 19:04:24,878 INFO L290 TraceCheckUtils]: 90: Hoare triple {7724#false} assume !!(main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256);havoc main_#t~mem79#1;havoc main_#t~mem80#1; {7724#false} is VALID [2022-02-20 19:04:24,878 INFO L290 TraceCheckUtils]: 91: Hoare triple {7724#false} call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {7724#false} is VALID [2022-02-20 19:04:24,878 INFO L290 TraceCheckUtils]: 92: Hoare triple {7724#false} assume !!(main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256);havoc main_#t~mem81#1;havoc main_#t~mem82#1; {7724#false} is VALID [2022-02-20 19:04:24,878 INFO L290 TraceCheckUtils]: 93: Hoare triple {7724#false} call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {7724#false} is VALID [2022-02-20 19:04:24,878 INFO L290 TraceCheckUtils]: 94: Hoare triple {7724#false} assume !!(main_#t~mem83#1.base == main_#t~mem84#1.base && main_#t~mem83#1.offset == main_#t~mem84#1.offset);havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; {7724#false} is VALID [2022-02-20 19:04:24,878 INFO L290 TraceCheckUtils]: 95: Hoare triple {7724#false} call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {7724#false} is VALID [2022-02-20 19:04:24,878 INFO L290 TraceCheckUtils]: 96: Hoare triple {7724#false} assume !!(main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {7724#false} is VALID [2022-02-20 19:04:24,879 INFO L290 TraceCheckUtils]: 97: Hoare triple {7724#false} call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {7724#false} is VALID [2022-02-20 19:04:24,879 INFO L290 TraceCheckUtils]: 98: Hoare triple {7724#false} assume !!(main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset; {7724#false} is VALID [2022-02-20 19:04:24,879 INFO L290 TraceCheckUtils]: 99: Hoare triple {7724#false} call main_#t~mem89#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {7724#false} is VALID [2022-02-20 19:04:24,879 INFO L290 TraceCheckUtils]: 100: Hoare triple {7724#false} assume !!(main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256);havoc main_#t~mem89#1;havoc main_#t~mem90#1; {7724#false} is VALID [2022-02-20 19:04:24,879 INFO L290 TraceCheckUtils]: 101: Hoare triple {7724#false} call main_#t~mem91#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {7724#false} is VALID [2022-02-20 19:04:24,879 INFO L290 TraceCheckUtils]: 102: Hoare triple {7724#false} assume !!(main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256);havoc main_#t~mem91#1;havoc main_#t~mem92#1; {7724#false} is VALID [2022-02-20 19:04:24,879 INFO L290 TraceCheckUtils]: 103: Hoare triple {7724#false} call main_#t~mem93#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem94#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {7724#false} is VALID [2022-02-20 19:04:24,879 INFO L290 TraceCheckUtils]: 104: Hoare triple {7724#false} assume !!(main_#t~mem93#1 == main_#t~mem94#1);havoc main_#t~mem93#1;havoc main_#t~mem94#1; {7724#false} is VALID [2022-02-20 19:04:24,879 INFO L290 TraceCheckUtils]: 105: Hoare triple {7724#false} call main_#t~mem95#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {7724#false} is VALID [2022-02-20 19:04:24,879 INFO L290 TraceCheckUtils]: 106: Hoare triple {7724#false} assume !!(main_#t~mem95#1 == main_#t~mem96#1);havoc main_#t~mem95#1;havoc main_#t~mem96#1; {7724#false} is VALID [2022-02-20 19:04:24,880 INFO L290 TraceCheckUtils]: 107: Hoare triple {7724#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {7724#false} is VALID [2022-02-20 19:04:24,880 INFO L290 TraceCheckUtils]: 108: Hoare triple {7724#false} assume 0 == __VERIFIER_assert_~cond#1; {7724#false} is VALID [2022-02-20 19:04:24,880 INFO L290 TraceCheckUtils]: 109: Hoare triple {7724#false} assume !false; {7724#false} is VALID [2022-02-20 19:04:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-02-20 19:04:24,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:04:24,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926956971] [2022-02-20 19:04:24,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926956971] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:04:24,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:04:24,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:04:24,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144108926] [2022-02-20 19:04:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:04:24,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 110 [2022-02-20 19:04:24,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:04:24,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:04:24,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:24,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:04:24,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:04:24,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:04:24,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:04:24,939 INFO L87 Difference]: Start difference. First operand 319 states and 485 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:04:27,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 19:04:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:29,721 INFO L93 Difference]: Finished difference Result 662 states and 1021 transitions. [2022-02-20 19:04:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:04:29,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 110 [2022-02-20 19:04:29,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:04:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:04:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 546 transitions. [2022-02-20 19:04:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:04:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 546 transitions. [2022-02-20 19:04:29,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 546 transitions. [2022-02-20 19:04:30,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 546 edges. 546 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:30,245 INFO L225 Difference]: With dead ends: 662 [2022-02-20 19:04:30,246 INFO L226 Difference]: Without dead ends: 636 [2022-02-20 19:04:30,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:04:30,247 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 340 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 234 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:04:30,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 941 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 665 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-02-20 19:04:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-02-20 19:04:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 595. [2022-02-20 19:04:30,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:04:30,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 636 states. Second operand has 595 states, 394 states have (on average 1.4238578680203047) internal successors, (561), 401 states have internal predecessors, (561), 165 states have call successors, (165), 28 states have call predecessors, (165), 35 states have return successors, (209), 165 states have call predecessors, (209), 165 states have call successors, (209) [2022-02-20 19:04:30,282 INFO L74 IsIncluded]: Start isIncluded. First operand 636 states. Second operand has 595 states, 394 states have (on average 1.4238578680203047) internal successors, (561), 401 states have internal predecessors, (561), 165 states have call successors, (165), 28 states have call predecessors, (165), 35 states have return successors, (209), 165 states have call predecessors, (209), 165 states have call successors, (209) [2022-02-20 19:04:30,283 INFO L87 Difference]: Start difference. First operand 636 states. Second operand has 595 states, 394 states have (on average 1.4238578680203047) internal successors, (561), 401 states have internal predecessors, (561), 165 states have call successors, (165), 28 states have call predecessors, (165), 35 states have return successors, (209), 165 states have call predecessors, (209), 165 states have call successors, (209) [2022-02-20 19:04:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:30,307 INFO L93 Difference]: Finished difference Result 636 states and 991 transitions. [2022-02-20 19:04:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 991 transitions. [2022-02-20 19:04:30,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:30,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:30,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 394 states have (on average 1.4238578680203047) internal successors, (561), 401 states have internal predecessors, (561), 165 states have call successors, (165), 28 states have call predecessors, (165), 35 states have return successors, (209), 165 states have call predecessors, (209), 165 states have call successors, (209) Second operand 636 states. [2022-02-20 19:04:30,313 INFO L87 Difference]: Start difference. First operand has 595 states, 394 states have (on average 1.4238578680203047) internal successors, (561), 401 states have internal predecessors, (561), 165 states have call successors, (165), 28 states have call predecessors, (165), 35 states have return successors, (209), 165 states have call predecessors, (209), 165 states have call successors, (209) Second operand 636 states. [2022-02-20 19:04:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:30,334 INFO L93 Difference]: Finished difference Result 636 states and 991 transitions. [2022-02-20 19:04:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 991 transitions. [2022-02-20 19:04:30,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:30,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:30,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:04:30,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:04:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 394 states have (on average 1.4238578680203047) internal successors, (561), 401 states have internal predecessors, (561), 165 states have call successors, (165), 28 states have call predecessors, (165), 35 states have return successors, (209), 165 states have call predecessors, (209), 165 states have call successors, (209) [2022-02-20 19:04:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 935 transitions. [2022-02-20 19:04:30,362 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 935 transitions. Word has length 110 [2022-02-20 19:04:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:04:30,362 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 935 transitions. [2022-02-20 19:04:30,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:04:30,363 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 935 transitions. [2022-02-20 19:04:30,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-20 19:04:30,364 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:04:30,364 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:04:30,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:04:30,365 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:04:30,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:04:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash -593993191, now seen corresponding path program 1 times [2022-02-20 19:04:30,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:04:30,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595508310] [2022-02-20 19:04:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:30,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:04:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:43,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-20 19:04:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 19:04:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:43,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10808#true} is VALID [2022-02-20 19:04:43,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {10808#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {10808#true} is VALID [2022-02-20 19:04:43,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {10808#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10808#true} is VALID [2022-02-20 19:04:43,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {10808#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10907#(and (<= ~__CS_ret_PREEMPTED~0 (+ |__CS_cs_#t~ite5| (* (div ~__CS_ret_PREEMPTED~0 256) 256))) (<= (+ |__CS_cs_#t~ite5| (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0))} is VALID [2022-02-20 19:04:43,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {10907#(and (<= ~__CS_ret_PREEMPTED~0 (+ |__CS_cs_#t~ite5| (* (div ~__CS_ret_PREEMPTED~0 256) 256))) (<= (+ |__CS_cs_#t~ite5| (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0))} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10908#(and (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256))))} is VALID [2022-02-20 19:04:43,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {10908#(and (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256))))} assume true; {10908#(and (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256))))} is VALID [2022-02-20 19:04:43,770 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10908#(and (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256))))} {10808#true} #508#return; {10874#(and (or (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0) (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0)) (or (not (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0)) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))))} is VALID [2022-02-20 19:04:43,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:04:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:43,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {10909#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {10808#true} is VALID [2022-02-20 19:04:43,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {10808#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {10808#true} is VALID [2022-02-20 19:04:43,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10808#true} {10875#(and (or (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0) (<= (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256)) ~__CS_ret_PREEMPTED~0)) (or (<= ~__CS_ret_PREEMPTED~0 (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256))) (not (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0))))} #510#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:04:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:43,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10808#true} is VALID [2022-02-20 19:04:43,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {10808#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {10808#true} is VALID [2022-02-20 19:04:43,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {10808#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10808#true} is VALID [2022-02-20 19:04:43,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {10808#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10808#true} is VALID [2022-02-20 19:04:43,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {10808#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10808#true} is VALID [2022-02-20 19:04:43,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,808 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10808#true} {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #512#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:04:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:43,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10808#true} is VALID [2022-02-20 19:04:43,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {10808#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {10808#true} is VALID [2022-02-20 19:04:43,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {10808#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10808#true} is VALID [2022-02-20 19:04:43,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {10808#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10808#true} is VALID [2022-02-20 19:04:43,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {10808#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10808#true} is VALID [2022-02-20 19:04:43,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,815 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10808#true} {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #514#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 19:04:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:43,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {10910#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {10808#true} is VALID [2022-02-20 19:04:43,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {10808#true} assume #t~mem10 % 256 != 1 + ~__CS_thread_index~0 % 256;havoc #t~mem10;~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;#res := 1; {10808#true} is VALID [2022-02-20 19:04:43,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10808#true} {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #516#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:04:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:43,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10808#true} is VALID [2022-02-20 19:04:43,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {10808#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {10808#true} is VALID [2022-02-20 19:04:43,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {10808#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10808#true} is VALID [2022-02-20 19:04:43,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {10808#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10808#true} is VALID [2022-02-20 19:04:43,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {10808#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10808#true} is VALID [2022-02-20 19:04:43,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,838 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10808#true} {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #518#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {10866#(and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|))} #~75#1.base, #~75#1.offset := #in~75#1.base, #in~75#1.offset; {10808#true} is VALID [2022-02-20 19:04:43,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {10808#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {10808#true} is VALID [2022-02-20 19:04:43,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {10808#true} assume !(#in~#fp#1.base == #funAddr~thread2.base && #in~#fp#1.offset == #funAddr~thread2.offset);assume { :begin_inline_thread1 } true;thread1_#in~arg#1.base, thread1_#in~arg#1.offset := #~75#1.base, #~75#1.offset;havoc thread1_#res#1.base, thread1_#res#1.offset;havoc thread1_#t~ret22#1, thread1_#t~mem23#1, thread1_#t~post24#1, thread1_#t~ret25#1, thread1_#t~ret26#1, thread1_#t~mem27#1, thread1_#t~post28#1, thread1_#t~ret29#1, thread1_~arg#1.base, thread1_~arg#1.offset;thread1_~arg#1.base, thread1_~arg#1.offset := thread1_#in~arg#1.base, thread1_#in~arg#1.offset; {10808#true} is VALID [2022-02-20 19:04:43,839 INFO L272 TraceCheckUtils]: 3: Hoare triple {10808#true} call __CS_cs(); {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:43,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10808#true} is VALID [2022-02-20 19:04:43,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {10808#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {10808#true} is VALID [2022-02-20 19:04:43,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {10808#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10808#true} is VALID [2022-02-20 19:04:43,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {10808#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10907#(and (<= ~__CS_ret_PREEMPTED~0 (+ |__CS_cs_#t~ite5| (* (div ~__CS_ret_PREEMPTED~0 256) 256))) (<= (+ |__CS_cs_#t~ite5| (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0))} is VALID [2022-02-20 19:04:43,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {10907#(and (<= ~__CS_ret_PREEMPTED~0 (+ |__CS_cs_#t~ite5| (* (div ~__CS_ret_PREEMPTED~0 256) 256))) (<= (+ |__CS_cs_#t~ite5| (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0))} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10908#(and (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256))))} is VALID [2022-02-20 19:04:43,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {10908#(and (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256))))} assume true; {10908#(and (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256))))} is VALID [2022-02-20 19:04:43,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10908#(and (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256))))} {10808#true} #508#return; {10874#(and (or (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0) (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0)) (or (not (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0)) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))))} is VALID [2022-02-20 19:04:43,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {10874#(and (or (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0) (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0)) (or (not (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0)) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))))} assume !(0 != ~__CS_ret~0 % 256); {10875#(and (or (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0) (<= (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256)) ~__CS_ret_PREEMPTED~0)) (or (<= ~__CS_ret_PREEMPTED~0 (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256))) (not (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0))))} is VALID [2022-02-20 19:04:43,842 INFO L272 TraceCheckUtils]: 12: Hoare triple {10875#(and (or (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0) (<= (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256)) ~__CS_ret_PREEMPTED~0)) (or (<= ~__CS_ret_PREEMPTED~0 (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256))) (not (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0))))} call thread1_#t~ret22#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {10909#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:43,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {10909#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {10808#true} is VALID [2022-02-20 19:04:43,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {10808#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {10808#true} is VALID [2022-02-20 19:04:43,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,843 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10808#true} {10875#(and (or (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0) (<= (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256)) ~__CS_ret_PREEMPTED~0)) (or (<= ~__CS_ret_PREEMPTED~0 (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256))) (not (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0))))} #510#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume -2147483648 <= thread1_#t~ret22#1 && thread1_#t~ret22#1 <= 2147483647;havoc thread1_#t~ret22#1; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,844 INFO L272 TraceCheckUtils]: 18: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call __CS_cs(); {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:43,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10808#true} is VALID [2022-02-20 19:04:43,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {10808#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {10808#true} is VALID [2022-02-20 19:04:43,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {10808#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10808#true} is VALID [2022-02-20 19:04:43,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {10808#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10808#true} is VALID [2022-02-20 19:04:43,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {10808#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10808#true} is VALID [2022-02-20 19:04:43,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,845 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10808#true} {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #512#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume !(0 != ~__CS_ret~0 % 256);call thread1_#t~mem23#1 := read~int(~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);thread1_#t~post24#1 := thread1_#t~mem23#1;call write~int(1 + thread1_#t~post24#1, ~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);havoc thread1_#t~mem23#1;havoc thread1_#t~post24#1; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,846 INFO L272 TraceCheckUtils]: 27: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call __CS_cs(); {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:43,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10808#true} is VALID [2022-02-20 19:04:43,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {10808#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {10808#true} is VALID [2022-02-20 19:04:43,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {10808#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10808#true} is VALID [2022-02-20 19:04:43,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {10808#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10808#true} is VALID [2022-02-20 19:04:43,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {10808#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10808#true} is VALID [2022-02-20 19:04:43,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,847 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10808#true} {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #514#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume !(0 != ~__CS_ret~0 % 256); {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,848 INFO L272 TraceCheckUtils]: 36: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call thread1_#t~ret25#1 := __CS_pthread_mutex_unlock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {10910#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:43,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {10910#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {10808#true} is VALID [2022-02-20 19:04:43,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {10808#true} assume #t~mem10 % 256 != 1 + ~__CS_thread_index~0 % 256;havoc #t~mem10;~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;#res := 1; {10808#true} is VALID [2022-02-20 19:04:43,848 INFO L290 TraceCheckUtils]: 39: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,848 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10808#true} {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #516#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume -2147483648 <= thread1_#t~ret25#1 && thread1_#t~ret25#1 <= 2147483647;havoc thread1_#t~ret25#1; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,860 INFO L272 TraceCheckUtils]: 42: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call __CS_cs(); {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:43,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10808#true} is VALID [2022-02-20 19:04:43,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {10808#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {10808#true} is VALID [2022-02-20 19:04:43,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {10808#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10808#true} is VALID [2022-02-20 19:04:43,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {10808#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10808#true} is VALID [2022-02-20 19:04:43,861 INFO L290 TraceCheckUtils]: 47: Hoare triple {10808#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10808#true} is VALID [2022-02-20 19:04:43,861 INFO L290 TraceCheckUtils]: 48: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,862 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10808#true} {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #518#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume 0 != ~__CS_ret~0 % 256;thread1_#res#1.base, thread1_#res#1.offset := 0, 0; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,862 INFO L290 TraceCheckUtils]: 51: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #t~ret105#1.base, #t~ret105#1.offset := thread1_#res#1.base, thread1_#res#1.offset;assume { :end_inline_thread1 } true;#t~funptrres104#1.base, #t~funptrres104#1.offset := #t~ret105#1.base, #t~ret105#1.offset; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,863 INFO L290 TraceCheckUtils]: 52: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #res#1.base, #res#1.offset := #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~ret105#1.base, #t~ret105#1.offset;havoc #t~ret106#1.base, #t~ret106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,863 INFO L290 TraceCheckUtils]: 53: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume true; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,864 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} #534#return; {10809#false} is VALID [2022-02-20 19:04:43,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {10808#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__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;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 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);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);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];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);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;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);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);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);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);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);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);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);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);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);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~nondet97#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet102#1];havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1;havoc ULTIMATE.init_#t~nondet102#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet49#1, main_#t~nondet50#1, main_#t~pre48#1, main_~j~2#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~pre47#1, main_~i~0#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~ret68#1.base, main_#t~ret68#1.offset, main_#t~mem69#1, main_#t~mem70#1, main_#t~ret72#1.base, main_#t~ret72#1.offset, main_#t~mem73#1, main_#t~mem74#1, main_#t~ret76#1.base, main_#t~ret76#1.offset, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !(main_~j~2#1 < 3); {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet49#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet50#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet50#1 % 4294967296 % 4294967296 else main_#t~nondet50#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet50#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~pre48#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre48#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !(main_~j~2#1 < 3); {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} call write~int(main_#t~nondet51#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet52#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;assume -2147483648 <= main_#t~nondet54#1 && main_#t~nondet54#1 <= 2147483647;call write~int(main_#t~nondet54#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet54#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~pre47#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre47#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !(main_~i~0#1 < 2); {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem58#1.base, main_#t~mem58#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem59#1.base, main_#t~mem59#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem61#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem62#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem63#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem64#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem64#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem65#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !(1 == main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} call main_#t~mem69#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !(1 == main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} call main_#t~mem73#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume 1 == main_#t~mem73#1 % 256;havoc main_#t~mem73#1;call main_#t~mem74#1 := read~int(~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_round~0 := main_#t~mem74#1;havoc main_#t~mem74#1;~__CS_ret~0 := 0; {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:43,873 INFO L272 TraceCheckUtils]: 29: Hoare triple {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} call main_#t~ret76#1.base, main_#t~ret76#1.offset := ##fun~$Pointer$~TO~$Pointer$(0, 0, ~__CS_thread~0.base[2], ~__CS_thread~0.offset[2]); {10866#(and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|))} is VALID [2022-02-20 19:04:43,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {10866#(and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|))} #~75#1.base, #~75#1.offset := #in~75#1.base, #in~75#1.offset; {10808#true} is VALID [2022-02-20 19:04:43,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {10808#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {10808#true} is VALID [2022-02-20 19:04:43,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {10808#true} assume !(#in~#fp#1.base == #funAddr~thread2.base && #in~#fp#1.offset == #funAddr~thread2.offset);assume { :begin_inline_thread1 } true;thread1_#in~arg#1.base, thread1_#in~arg#1.offset := #~75#1.base, #~75#1.offset;havoc thread1_#res#1.base, thread1_#res#1.offset;havoc thread1_#t~ret22#1, thread1_#t~mem23#1, thread1_#t~post24#1, thread1_#t~ret25#1, thread1_#t~ret26#1, thread1_#t~mem27#1, thread1_#t~post28#1, thread1_#t~ret29#1, thread1_~arg#1.base, thread1_~arg#1.offset;thread1_~arg#1.base, thread1_~arg#1.offset := thread1_#in~arg#1.base, thread1_#in~arg#1.offset; {10808#true} is VALID [2022-02-20 19:04:43,874 INFO L272 TraceCheckUtils]: 33: Hoare triple {10808#true} call __CS_cs(); {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:43,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10808#true} is VALID [2022-02-20 19:04:43,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {10808#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {10808#true} is VALID [2022-02-20 19:04:43,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {10808#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10808#true} is VALID [2022-02-20 19:04:43,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {10808#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10907#(and (<= ~__CS_ret_PREEMPTED~0 (+ |__CS_cs_#t~ite5| (* (div ~__CS_ret_PREEMPTED~0 256) 256))) (<= (+ |__CS_cs_#t~ite5| (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0))} is VALID [2022-02-20 19:04:43,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {10907#(and (<= ~__CS_ret_PREEMPTED~0 (+ |__CS_cs_#t~ite5| (* (div ~__CS_ret_PREEMPTED~0 256) 256))) (<= (+ |__CS_cs_#t~ite5| (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0))} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10908#(and (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256))))} is VALID [2022-02-20 19:04:43,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {10908#(and (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256))))} assume true; {10908#(and (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256))))} is VALID [2022-02-20 19:04:43,876 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10908#(and (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256))))} {10808#true} #508#return; {10874#(and (or (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0) (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0)) (or (not (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0)) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))))} is VALID [2022-02-20 19:04:43,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {10874#(and (or (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0) (<= (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)) ~__CS_ret_PREEMPTED~0)) (or (not (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0)) (<= ~__CS_ret_PREEMPTED~0 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))))} assume !(0 != ~__CS_ret~0 % 256); {10875#(and (or (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0) (<= (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256)) ~__CS_ret_PREEMPTED~0)) (or (<= ~__CS_ret_PREEMPTED~0 (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256))) (not (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0))))} is VALID [2022-02-20 19:04:43,878 INFO L272 TraceCheckUtils]: 42: Hoare triple {10875#(and (or (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0) (<= (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256)) ~__CS_ret_PREEMPTED~0)) (or (<= ~__CS_ret_PREEMPTED~0 (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256))) (not (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0))))} call thread1_#t~ret22#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {10909#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:43,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {10909#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {10808#true} is VALID [2022-02-20 19:04:43,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {10808#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {10808#true} is VALID [2022-02-20 19:04:43,878 INFO L290 TraceCheckUtils]: 45: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,879 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10808#true} {10875#(and (or (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0) (<= (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256)) ~__CS_ret_PREEMPTED~0)) (or (<= ~__CS_ret_PREEMPTED~0 (+ (* (div ~__CS_ret_PREEMPTED~0 256) 256) (* (div ~__CS_ret~0 256) 256))) (not (<= (+ (div ~__CS_ret_PREEMPTED~0 256) (div ~__CS_ret~0 256)) 0))))} #510#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,879 INFO L290 TraceCheckUtils]: 47: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume -2147483648 <= thread1_#t~ret22#1 && thread1_#t~ret22#1 <= 2147483647;havoc thread1_#t~ret22#1; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,880 INFO L272 TraceCheckUtils]: 48: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call __CS_cs(); {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:43,880 INFO L290 TraceCheckUtils]: 49: Hoare triple {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10808#true} is VALID [2022-02-20 19:04:43,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {10808#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {10808#true} is VALID [2022-02-20 19:04:43,880 INFO L290 TraceCheckUtils]: 51: Hoare triple {10808#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10808#true} is VALID [2022-02-20 19:04:43,880 INFO L290 TraceCheckUtils]: 52: Hoare triple {10808#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10808#true} is VALID [2022-02-20 19:04:43,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {10808#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10808#true} is VALID [2022-02-20 19:04:43,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,881 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10808#true} {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #512#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,881 INFO L290 TraceCheckUtils]: 56: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume !(0 != ~__CS_ret~0 % 256);call thread1_#t~mem23#1 := read~int(~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);thread1_#t~post24#1 := thread1_#t~mem23#1;call write~int(1 + thread1_#t~post24#1, ~#data1~0.base, ~#data1~0.offset + 4 * (~__CS_round~0 % 256), 4);havoc thread1_#t~mem23#1;havoc thread1_#t~post24#1; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,881 INFO L272 TraceCheckUtils]: 57: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call __CS_cs(); {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:43,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10808#true} is VALID [2022-02-20 19:04:43,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {10808#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {10808#true} is VALID [2022-02-20 19:04:43,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {10808#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10808#true} is VALID [2022-02-20 19:04:43,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {10808#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10808#true} is VALID [2022-02-20 19:04:43,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {10808#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10808#true} is VALID [2022-02-20 19:04:43,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,882 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10808#true} {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #514#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume !(0 != ~__CS_ret~0 % 256); {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,883 INFO L272 TraceCheckUtils]: 66: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call thread1_#t~ret25#1 := __CS_pthread_mutex_unlock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {10910#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:43,883 INFO L290 TraceCheckUtils]: 67: Hoare triple {10910#(and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {10808#true} is VALID [2022-02-20 19:04:43,883 INFO L290 TraceCheckUtils]: 68: Hoare triple {10808#true} assume #t~mem10 % 256 != 1 + ~__CS_thread_index~0 % 256;havoc #t~mem10;~__CS_error~0 := 1;~__CS_ret~0 := ~__CS_ret_ERROR~0;#res := 1; {10808#true} is VALID [2022-02-20 19:04:43,884 INFO L290 TraceCheckUtils]: 69: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,884 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10808#true} {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #516#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,884 INFO L290 TraceCheckUtils]: 71: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume -2147483648 <= thread1_#t~ret25#1 && thread1_#t~ret25#1 <= 2147483647;havoc thread1_#t~ret25#1; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,885 INFO L272 TraceCheckUtils]: 72: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call __CS_cs(); {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:43,885 INFO L290 TraceCheckUtils]: 73: Hoare triple {10906#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10808#true} is VALID [2022-02-20 19:04:43,885 INFO L290 TraceCheckUtils]: 74: Hoare triple {10808#true} assume !!(~__CS_round~0 % 256 + ~k~0 % 256 < 2); {10808#true} is VALID [2022-02-20 19:04:43,885 INFO L290 TraceCheckUtils]: 75: Hoare triple {10808#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10808#true} is VALID [2022-02-20 19:04:43,885 INFO L290 TraceCheckUtils]: 76: Hoare triple {10808#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10808#true} is VALID [2022-02-20 19:04:43,885 INFO L290 TraceCheckUtils]: 77: Hoare triple {10808#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10808#true} is VALID [2022-02-20 19:04:43,885 INFO L290 TraceCheckUtils]: 78: Hoare triple {10808#true} assume true; {10808#true} is VALID [2022-02-20 19:04:43,886 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {10808#true} {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #518#return; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,886 INFO L290 TraceCheckUtils]: 80: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume 0 != ~__CS_ret~0 % 256;thread1_#res#1.base, thread1_#res#1.offset := 0, 0; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,886 INFO L290 TraceCheckUtils]: 81: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #t~ret105#1.base, #t~ret105#1.offset := thread1_#res#1.base, thread1_#res#1.offset;assume { :end_inline_thread1 } true;#t~funptrres104#1.base, #t~funptrres104#1.offset := #t~ret105#1.base, #t~ret105#1.offset; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,887 INFO L290 TraceCheckUtils]: 82: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #res#1.base, #res#1.offset := #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~funptrres104#1.base, #t~funptrres104#1.offset;havoc #t~ret105#1.base, #t~ret105#1.offset;havoc #t~ret106#1.base, #t~ret106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,887 INFO L290 TraceCheckUtils]: 83: Hoare triple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume true; {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:43,888 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {10880#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} {10810#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} #534#return; {10809#false} is VALID [2022-02-20 19:04:43,888 INFO L290 TraceCheckUtils]: 85: Hoare triple {10809#false} havoc main_#t~ret76#1.base, main_#t~ret76#1.offset; {10809#false} is VALID [2022-02-20 19:04:43,888 INFO L290 TraceCheckUtils]: 86: Hoare triple {10809#false} assume ~__CS_ret~0 % 256 != ~__CS_ret_PREEMPTED~0 % 256;call write~int(~__THREAD_FINISHED~0, ~#__CS_thread_status~0.base, 2 + (~#__CS_thread_status~0.offset + 3 * (~__CS_round~0 % 256)), 1); {10809#false} is VALID [2022-02-20 19:04:43,888 INFO L290 TraceCheckUtils]: 87: Hoare triple {10809#false} call main_#t~mem77#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem78#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {10809#false} is VALID [2022-02-20 19:04:43,888 INFO L290 TraceCheckUtils]: 88: Hoare triple {10809#false} assume !!(main_#t~mem77#1 % 256 == main_#t~mem78#1 % 256);havoc main_#t~mem77#1;havoc main_#t~mem78#1; {10809#false} is VALID [2022-02-20 19:04:43,888 INFO L290 TraceCheckUtils]: 89: Hoare triple {10809#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {10809#false} is VALID [2022-02-20 19:04:43,888 INFO L290 TraceCheckUtils]: 90: Hoare triple {10809#false} assume !!(main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256);havoc main_#t~mem79#1;havoc main_#t~mem80#1; {10809#false} is VALID [2022-02-20 19:04:43,888 INFO L290 TraceCheckUtils]: 91: Hoare triple {10809#false} call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {10809#false} is VALID [2022-02-20 19:04:43,888 INFO L290 TraceCheckUtils]: 92: Hoare triple {10809#false} assume !!(main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256);havoc main_#t~mem81#1;havoc main_#t~mem82#1; {10809#false} is VALID [2022-02-20 19:04:43,889 INFO L290 TraceCheckUtils]: 93: Hoare triple {10809#false} call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {10809#false} is VALID [2022-02-20 19:04:43,889 INFO L290 TraceCheckUtils]: 94: Hoare triple {10809#false} assume !!(main_#t~mem83#1.base == main_#t~mem84#1.base && main_#t~mem83#1.offset == main_#t~mem84#1.offset);havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; {10809#false} is VALID [2022-02-20 19:04:43,889 INFO L290 TraceCheckUtils]: 95: Hoare triple {10809#false} call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {10809#false} is VALID [2022-02-20 19:04:43,889 INFO L290 TraceCheckUtils]: 96: Hoare triple {10809#false} assume !!(main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {10809#false} is VALID [2022-02-20 19:04:43,889 INFO L290 TraceCheckUtils]: 97: Hoare triple {10809#false} call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {10809#false} is VALID [2022-02-20 19:04:43,889 INFO L290 TraceCheckUtils]: 98: Hoare triple {10809#false} assume !!(main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset; {10809#false} is VALID [2022-02-20 19:04:43,889 INFO L290 TraceCheckUtils]: 99: Hoare triple {10809#false} call main_#t~mem89#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {10809#false} is VALID [2022-02-20 19:04:43,889 INFO L290 TraceCheckUtils]: 100: Hoare triple {10809#false} assume !!(main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256);havoc main_#t~mem89#1;havoc main_#t~mem90#1; {10809#false} is VALID [2022-02-20 19:04:43,889 INFO L290 TraceCheckUtils]: 101: Hoare triple {10809#false} call main_#t~mem91#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {10809#false} is VALID [2022-02-20 19:04:43,889 INFO L290 TraceCheckUtils]: 102: Hoare triple {10809#false} assume !!(main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256);havoc main_#t~mem91#1;havoc main_#t~mem92#1; {10809#false} is VALID [2022-02-20 19:04:43,890 INFO L290 TraceCheckUtils]: 103: Hoare triple {10809#false} call main_#t~mem93#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem94#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {10809#false} is VALID [2022-02-20 19:04:43,890 INFO L290 TraceCheckUtils]: 104: Hoare triple {10809#false} assume !!(main_#t~mem93#1 == main_#t~mem94#1);havoc main_#t~mem93#1;havoc main_#t~mem94#1; {10809#false} is VALID [2022-02-20 19:04:43,890 INFO L290 TraceCheckUtils]: 105: Hoare triple {10809#false} call main_#t~mem95#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {10809#false} is VALID [2022-02-20 19:04:43,890 INFO L290 TraceCheckUtils]: 106: Hoare triple {10809#false} assume !!(main_#t~mem95#1 == main_#t~mem96#1);havoc main_#t~mem95#1;havoc main_#t~mem96#1; {10809#false} is VALID [2022-02-20 19:04:43,890 INFO L290 TraceCheckUtils]: 107: Hoare triple {10809#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {10809#false} is VALID [2022-02-20 19:04:43,890 INFO L290 TraceCheckUtils]: 108: Hoare triple {10809#false} assume 0 == __VERIFIER_assert_~cond#1; {10809#false} is VALID [2022-02-20 19:04:43,890 INFO L290 TraceCheckUtils]: 109: Hoare triple {10809#false} assume !false; {10809#false} is VALID [2022-02-20 19:04:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-02-20 19:04:43,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:04:43,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595508310] [2022-02-20 19:04:43,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595508310] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:04:43,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683530186] [2022-02-20 19:04:43,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:43,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:04:43,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:04:43,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:04:43,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process