./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-2.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-2.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 c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:03:36,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:03:36,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:03:36,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:03:36,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:03:36,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:03:36,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:03:36,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:03:36,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:03:36,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:03:36,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:03:36,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:03:36,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:03:36,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:03:36,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:03:36,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:03:36,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:03:36,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:03:36,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:03:36,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:03:36,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:03:36,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:03:36,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:03:36,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:03:36,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:03:36,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:03:36,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:03:36,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:03:36,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:03:36,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:03:36,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:03:36,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:03:36,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:03:36,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:03:36,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:03:36,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:03:36,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:03:36,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:03:36,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:03:36,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:03:36,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:03:36,306 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:36,330 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:03:36,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:03:36,330 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:03:36,330 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:03:36,331 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:03:36,331 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:03:36,331 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:03:36,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:03:36,332 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:03:36,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:03:36,332 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:03:36,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:03:36,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:03:36,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:03:36,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:03:36,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:03:36,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:03:36,333 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:03:36,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:03:36,333 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:03:36,334 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:03:36,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:03:36,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:03:36,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:03:36,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:03:36,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:03:36,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:03:36,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:03:36,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:03:36,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:03:36,335 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:03:36,335 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:03:36,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:03:36,336 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 -> c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc [2022-02-20 19:03:36,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:03:36,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:03:36,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:03:36,605 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:03:36,606 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:03:36,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2022-02-20 19:03:36,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c9b285f/c2f6e1715c394dcf87e1eb7a87126898/FLAG6be156dfb [2022-02-20 19:03:37,182 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:03:37,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2022-02-20 19:03:37,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c9b285f/c2f6e1715c394dcf87e1eb7a87126898/FLAG6be156dfb [2022-02-20 19:03:37,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c9b285f/c2f6e1715c394dcf87e1eb7a87126898 [2022-02-20 19:03:37,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:03:37,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:03:37,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:03:37,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:03:37,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:03:37,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:03:37" (1/1) ... [2022-02-20 19:03:37,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d31f404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:37, skipping insertion in model container [2022-02-20 19:03:37,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:03:37" (1/1) ... [2022-02-20 19:03:37,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:03:37,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:03:38,019 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-2.i[23607,23620] [2022-02-20 19:03:38,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:03:38,147 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:03:38,182 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-2.i[23607,23620] [2022-02-20 19:03:38,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:03:38,258 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:03:38,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:38 WrapperNode [2022-02-20 19:03:38,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:03:38,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:03:38,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:03:38,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:03:38,264 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:38" (1/1) ... [2022-02-20 19:03:38,292 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:38" (1/1) ... [2022-02-20 19:03:38,342 INFO L137 Inliner]: procedures = 145, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 539 [2022-02-20 19:03:38,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:03:38,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:03:38,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:03:38,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:03:38,352 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:38" (1/1) ... [2022-02-20 19:03:38,352 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:38" (1/1) ... [2022-02-20 19:03:38,367 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:38" (1/1) ... [2022-02-20 19:03:38,370 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:38" (1/1) ... [2022-02-20 19:03:38,395 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:38" (1/1) ... [2022-02-20 19:03:38,399 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:38" (1/1) ... [2022-02-20 19:03:38,401 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:38" (1/1) ... [2022-02-20 19:03:38,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:03:38,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:03:38,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:03:38,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:03:38,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:38" (1/1) ... [2022-02-20 19:03:38,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:03:38,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:03:38,443 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:38,470 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:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 19:03:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 19:03:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 19:03:38,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 19:03:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:03:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 19:03:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 19:03:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2022-02-20 19:03:38,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2022-02-20 19:03:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-02-20 19:03:38,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-02-20 19:03:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-02-20 19:03:38,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-02-20 19:03:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 19:03:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-02-20 19:03:38,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-02-20 19:03:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-02-20 19:03:38,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-02-20 19:03:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 19:03:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 19:03:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-02-20 19:03:38,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-02-20 19:03:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:03:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-02-20 19:03:38,500 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-02-20 19:03:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:03:38,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:03:38,620 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:03:38,621 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:03:39,011 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2022-02-20 19:03:39,012 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-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:39,019 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != ~__CS_ret~0 % 256); [2022-02-20 19:03:39,019 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-02-20 19:03:39,019 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:39,019 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != ~__CS_ret~0 % 256); [2022-02-20 19:03:39,020 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:41,313 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:03:41,319 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:03:41,319 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:03:41,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:03:41 BoogieIcfgContainer [2022-02-20 19:03:41,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:03:41,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:03:41,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:03:41,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:03:41,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:03:37" (1/3) ... [2022-02-20 19:03:41,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dad0f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:03:41, skipping insertion in model container [2022-02-20 19:03:41,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:03:38" (2/3) ... [2022-02-20 19:03:41,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dad0f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:03:41, skipping insertion in model container [2022-02-20 19:03:41,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:03:41" (3/3) ... [2022-02-20 19:03:41,329 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2022-02-20 19:03:41,334 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:03:41,338 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 19:03:41,385 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:03:41,395 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:41,395 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 19:03:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 112 states have internal predecessors, (161), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:03:41,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:03:41,446 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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:03:41,446 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:03:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:03:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash 246520095, now seen corresponding path program 1 times [2022-02-20 19:03:41,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:03:41,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344589531] [2022-02-20 19:03:41,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:03:41,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:03:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:41,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:03:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:41,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#false} {179#false} #484#return; {179#false} is VALID [2022-02-20 19:03:41,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 19:03:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:41,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#false} {179#false} #486#return; {179#false} is VALID [2022-02-20 19:03:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 19:03:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:41,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#false} {179#false} #488#return; {179#false} is VALID [2022-02-20 19:03:41,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 19:03:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:41,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#false} {179#false} #490#return; {179#false} is VALID [2022-02-20 19:03:41,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 19:03:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:41,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#false} {179#false} #492#return; {179#false} is VALID [2022-02-20 19:03:41,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:03:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:41,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#false} {179#false} #494#return; {179#false} is VALID [2022-02-20 19:03:41,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 19:03:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:41,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#false} {179#false} #496#return; {179#false} is VALID [2022-02-20 19:03:41,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 19:03:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:41,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#false} {179#false} #498#return; {179#false} is VALID [2022-02-20 19:03:41,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-20 19:03:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:41,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#false} {179#false} #500#return; {179#false} is VALID [2022-02-20 19:03:41,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-02-20 19:03:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:41,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#false} {179#false} #502#return; {179#false} is VALID [2022-02-20 19:03:41,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {178#true} is VALID [2022-02-20 19:03:41,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {178#true} is VALID [2022-02-20 19:03:41,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {178#true} assume !true; {179#false} is VALID [2022-02-20 19:03:41,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {179#false} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {179#false} is VALID [2022-02-20 19:03:41,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {179#false} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {179#false} is VALID [2022-02-20 19:03:41,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#false} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {179#false} is VALID [2022-02-20 19:03:41,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {179#false} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {179#false} is VALID [2022-02-20 19:03:41,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#false} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {179#false} is VALID [2022-02-20 19:03:41,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {179#false} assume !(1 == main_#t~mem75#1 % 256);havoc main_#t~mem75#1; {179#false} is VALID [2022-02-20 19:03:41,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {179#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {179#false} is VALID [2022-02-20 19:03:41,945 INFO L272 TraceCheckUtils]: 10: Hoare triple {179#false} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {178#true} is VALID [2022-02-20 19:03:41,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,946 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {179#false} {179#false} #484#return; {179#false} is VALID [2022-02-20 19:03:41,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {179#false} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {179#false} is VALID [2022-02-20 19:03:41,946 INFO L272 TraceCheckUtils]: 16: Hoare triple {179#false} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {178#true} is VALID [2022-02-20 19:03:41,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,947 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {179#false} {179#false} #486#return; {179#false} is VALID [2022-02-20 19:03:41,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {179#false} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {179#false} is VALID [2022-02-20 19:03:41,948 INFO L272 TraceCheckUtils]: 22: Hoare triple {179#false} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {178#true} is VALID [2022-02-20 19:03:41,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,949 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {179#false} {179#false} #488#return; {179#false} is VALID [2022-02-20 19:03:41,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {179#false} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {179#false} is VALID [2022-02-20 19:03:41,949 INFO L272 TraceCheckUtils]: 28: Hoare triple {179#false} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {178#true} is VALID [2022-02-20 19:03:41,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,950 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {179#false} {179#false} #490#return; {179#false} is VALID [2022-02-20 19:03:41,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {179#false} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {179#false} is VALID [2022-02-20 19:03:41,950 INFO L272 TraceCheckUtils]: 34: Hoare triple {179#false} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {178#true} is VALID [2022-02-20 19:03:41,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,951 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {179#false} {179#false} #492#return; {179#false} is VALID [2022-02-20 19:03:41,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {179#false} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {179#false} is VALID [2022-02-20 19:03:41,952 INFO L272 TraceCheckUtils]: 40: Hoare triple {179#false} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {178#true} is VALID [2022-02-20 19:03:41,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,953 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {179#false} {179#false} #494#return; {179#false} is VALID [2022-02-20 19:03:41,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {179#false} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {179#false} is VALID [2022-02-20 19:03:41,953 INFO L272 TraceCheckUtils]: 46: Hoare triple {179#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {178#true} is VALID [2022-02-20 19:03:41,953 INFO L290 TraceCheckUtils]: 47: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,954 INFO L290 TraceCheckUtils]: 48: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,954 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {179#false} {179#false} #496#return; {179#false} is VALID [2022-02-20 19:03:41,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {179#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {179#false} is VALID [2022-02-20 19:03:41,955 INFO L272 TraceCheckUtils]: 52: Hoare triple {179#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {178#true} is VALID [2022-02-20 19:03:41,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,956 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {179#false} {179#false} #498#return; {179#false} is VALID [2022-02-20 19:03:41,956 INFO L290 TraceCheckUtils]: 57: Hoare triple {179#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {179#false} is VALID [2022-02-20 19:03:41,956 INFO L272 TraceCheckUtils]: 58: Hoare triple {179#false} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {178#true} is VALID [2022-02-20 19:03:41,956 INFO L290 TraceCheckUtils]: 59: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,956 INFO L290 TraceCheckUtils]: 60: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,957 INFO L290 TraceCheckUtils]: 61: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,957 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {179#false} {179#false} #500#return; {179#false} is VALID [2022-02-20 19:03:41,957 INFO L290 TraceCheckUtils]: 63: Hoare triple {179#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {179#false} is VALID [2022-02-20 19:03:41,957 INFO L272 TraceCheckUtils]: 64: Hoare triple {179#false} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {178#true} is VALID [2022-02-20 19:03:41,957 INFO L290 TraceCheckUtils]: 65: Hoare triple {178#true} ~cond := #in~cond; {178#true} is VALID [2022-02-20 19:03:41,958 INFO L290 TraceCheckUtils]: 66: Hoare triple {178#true} assume 0 == ~cond;assume false; {179#false} is VALID [2022-02-20 19:03:41,958 INFO L290 TraceCheckUtils]: 67: Hoare triple {179#false} assume true; {179#false} is VALID [2022-02-20 19:03:41,958 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {179#false} {179#false} #502#return; {179#false} is VALID [2022-02-20 19:03:41,958 INFO L290 TraceCheckUtils]: 69: Hoare triple {179#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {179#false} is VALID [2022-02-20 19:03:41,958 INFO L290 TraceCheckUtils]: 70: Hoare triple {179#false} assume 0 == __VERIFIER_assert_~cond#1; {179#false} is VALID [2022-02-20 19:03:41,959 INFO L290 TraceCheckUtils]: 71: Hoare triple {179#false} assume !false; {179#false} is VALID [2022-02-20 19:03:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 19:03:41,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:03:41,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344589531] [2022-02-20 19:03:41,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344589531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:03:41,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:03:41,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:03:41,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845563398] [2022-02-20 19:03:41,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:03:41,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-02-20 19:03:41,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:03:41,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:42,020 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:42,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:03:42,021 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:03:42,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:03:42,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:03:42,050 INFO L87 Difference]: Start difference. First operand has 175 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 112 states have internal predecessors, (161), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:44,301 INFO L93 Difference]: Finished difference Result 348 states and 578 transitions. [2022-02-20 19:03:44,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:03:44,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-02-20 19:03:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:03:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 578 transitions. [2022-02-20 19:03:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 578 transitions. [2022-02-20 19:03:44,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 578 transitions. [2022-02-20 19:03:44,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 578 edges. 578 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:03:44,824 INFO L225 Difference]: With dead ends: 348 [2022-02-20 19:03:44,825 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 19:03:44,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:03:44,847 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:03:44,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:03:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 19:03:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-02-20 19:03:44,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:03:44,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 171 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:44,880 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 171 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:44,881 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 171 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:44,906 INFO L93 Difference]: Finished difference Result 171 states and 261 transitions. [2022-02-20 19:03:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2022-02-20 19:03:44,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:03:44,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:03:44,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand 171 states. [2022-02-20 19:03:44,909 INFO L87 Difference]: Start difference. First operand has 171 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand 171 states. [2022-02-20 19:03:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:44,919 INFO L93 Difference]: Finished difference Result 171 states and 261 transitions. [2022-02-20 19:03:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2022-02-20 19:03:44,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:03:44,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:03:44,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:03:44,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:03:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2022-02-20 19:03:44,944 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 72 [2022-02-20 19:03:44,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:03:44,945 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2022-02-20 19:03:44,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2022-02-20 19:03:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:03:44,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:03:44,947 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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:03:44,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:03:44,948 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:03:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:03:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1330951645, now seen corresponding path program 1 times [2022-02-20 19:03:44,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:03:44,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825517510] [2022-02-20 19:03:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:03:44,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:03:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:03:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:45,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1290#false} #484#return; {1290#false} is VALID [2022-02-20 19:03:45,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 19:03:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:45,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1290#false} #486#return; {1290#false} is VALID [2022-02-20 19:03:45,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 19:03:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:45,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1290#false} #488#return; {1290#false} is VALID [2022-02-20 19:03:45,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 19:03:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:45,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1290#false} #490#return; {1290#false} is VALID [2022-02-20 19:03:45,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 19:03:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:45,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1290#false} #492#return; {1290#false} is VALID [2022-02-20 19:03:45,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:03:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:45,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1290#false} #494#return; {1290#false} is VALID [2022-02-20 19:03:45,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 19:03:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:45,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1290#false} #496#return; {1290#false} is VALID [2022-02-20 19:03:45,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 19:03:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:45,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1290#false} #498#return; {1290#false} is VALID [2022-02-20 19:03:45,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-20 19:03:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:45,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1290#false} #500#return; {1290#false} is VALID [2022-02-20 19:03:45,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-02-20 19:03:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:45,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1290#false} #502#return; {1290#false} is VALID [2022-02-20 19:03:45,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {1289#true} is VALID [2022-02-20 19:03:45,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {1291#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:03:45,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {1291#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 2); {1290#false} is VALID [2022-02-20 19:03:45,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {1290#false} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {1290#false} is VALID [2022-02-20 19:03:45,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {1290#false} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {1290#false} is VALID [2022-02-20 19:03:45,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {1290#false} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {1290#false} is VALID [2022-02-20 19:03:45,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {1290#false} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {1290#false} is VALID [2022-02-20 19:03:45,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {1290#false} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {1290#false} is VALID [2022-02-20 19:03:45,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {1290#false} assume !(1 == main_#t~mem75#1 % 256);havoc main_#t~mem75#1; {1290#false} is VALID [2022-02-20 19:03:45,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {1290#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {1290#false} is VALID [2022-02-20 19:03:45,172 INFO L272 TraceCheckUtils]: 10: Hoare triple {1290#false} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {1289#true} is VALID [2022-02-20 19:03:45,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,173 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1289#true} {1290#false} #484#return; {1290#false} is VALID [2022-02-20 19:03:45,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {1290#false} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {1290#false} is VALID [2022-02-20 19:03:45,173 INFO L272 TraceCheckUtils]: 16: Hoare triple {1290#false} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {1289#true} is VALID [2022-02-20 19:03:45,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,174 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1289#true} {1290#false} #486#return; {1290#false} is VALID [2022-02-20 19:03:45,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {1290#false} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {1290#false} is VALID [2022-02-20 19:03:45,174 INFO L272 TraceCheckUtils]: 22: Hoare triple {1290#false} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {1289#true} is VALID [2022-02-20 19:03:45,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,175 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1289#true} {1290#false} #488#return; {1290#false} is VALID [2022-02-20 19:03:45,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {1290#false} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {1290#false} is VALID [2022-02-20 19:03:45,175 INFO L272 TraceCheckUtils]: 28: Hoare triple {1290#false} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {1289#true} is VALID [2022-02-20 19:03:45,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,176 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1289#true} {1290#false} #490#return; {1290#false} is VALID [2022-02-20 19:03:45,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {1290#false} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {1290#false} is VALID [2022-02-20 19:03:45,176 INFO L272 TraceCheckUtils]: 34: Hoare triple {1290#false} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {1289#true} is VALID [2022-02-20 19:03:45,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,177 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1289#true} {1290#false} #492#return; {1290#false} is VALID [2022-02-20 19:03:45,177 INFO L290 TraceCheckUtils]: 39: Hoare triple {1290#false} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {1290#false} is VALID [2022-02-20 19:03:45,177 INFO L272 TraceCheckUtils]: 40: Hoare triple {1290#false} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {1289#true} is VALID [2022-02-20 19:03:45,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,178 INFO L290 TraceCheckUtils]: 43: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,178 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1289#true} {1290#false} #494#return; {1290#false} is VALID [2022-02-20 19:03:45,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {1290#false} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {1290#false} is VALID [2022-02-20 19:03:45,178 INFO L272 TraceCheckUtils]: 46: Hoare triple {1290#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {1289#true} is VALID [2022-02-20 19:03:45,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,179 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1289#true} {1290#false} #496#return; {1290#false} is VALID [2022-02-20 19:03:45,179 INFO L290 TraceCheckUtils]: 51: Hoare triple {1290#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {1290#false} is VALID [2022-02-20 19:03:45,179 INFO L272 TraceCheckUtils]: 52: Hoare triple {1290#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {1289#true} is VALID [2022-02-20 19:03:45,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,180 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {1289#true} {1290#false} #498#return; {1290#false} is VALID [2022-02-20 19:03:45,180 INFO L290 TraceCheckUtils]: 57: Hoare triple {1290#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {1290#false} is VALID [2022-02-20 19:03:45,180 INFO L272 TraceCheckUtils]: 58: Hoare triple {1290#false} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {1289#true} is VALID [2022-02-20 19:03:45,180 INFO L290 TraceCheckUtils]: 59: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,181 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {1289#true} {1290#false} #500#return; {1290#false} is VALID [2022-02-20 19:03:45,181 INFO L290 TraceCheckUtils]: 63: Hoare triple {1290#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {1290#false} is VALID [2022-02-20 19:03:45,181 INFO L272 TraceCheckUtils]: 64: Hoare triple {1290#false} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {1289#true} is VALID [2022-02-20 19:03:45,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {1289#true} ~cond := #in~cond; {1289#true} is VALID [2022-02-20 19:03:45,181 INFO L290 TraceCheckUtils]: 66: Hoare triple {1289#true} assume !(0 == ~cond); {1289#true} is VALID [2022-02-20 19:03:45,181 INFO L290 TraceCheckUtils]: 67: Hoare triple {1289#true} assume true; {1289#true} is VALID [2022-02-20 19:03:45,181 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {1289#true} {1290#false} #502#return; {1290#false} is VALID [2022-02-20 19:03:45,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {1290#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {1290#false} is VALID [2022-02-20 19:03:45,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {1290#false} assume 0 == __VERIFIER_assert_~cond#1; {1290#false} is VALID [2022-02-20 19:03:45,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {1290#false} assume !false; {1290#false} is VALID [2022-02-20 19:03:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 19:03:45,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:03:45,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825517510] [2022-02-20 19:03:45,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825517510] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:03:45,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:03:45,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:03:45,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110765561] [2022-02-20 19:03:45,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:03:45,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-02-20 19:03:45,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:03:45,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:45,224 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:45,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:03:45,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:03:45,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:03:45,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:03:45,226 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:49,618 INFO L93 Difference]: Finished difference Result 340 states and 520 transitions. [2022-02-20 19:03:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:03:49,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-02-20 19:03:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:03:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2022-02-20 19:03:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2022-02-20 19:03:49,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 520 transitions. [2022-02-20 19:03:49,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 520 edges. 520 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:03:50,006 INFO L225 Difference]: With dead ends: 340 [2022-02-20 19:03:50,006 INFO L226 Difference]: Without dead ends: 175 [2022-02-20 19:03:50,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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:50,008 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:03:50,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 514 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:03:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-02-20 19:03:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-02-20 19:03:50,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:03:50,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 172 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 109 states have internal predecessors, (154), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:50,019 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 172 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 109 states have internal predecessors, (154), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:50,019 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 172 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 109 states have internal predecessors, (154), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:50,025 INFO L93 Difference]: Finished difference Result 175 states and 266 transitions. [2022-02-20 19:03:50,025 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 266 transitions. [2022-02-20 19:03:50,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:03:50,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:03:50,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 109 states have internal predecessors, (154), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand 175 states. [2022-02-20 19:03:50,028 INFO L87 Difference]: Start difference. First operand has 172 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 109 states have internal predecessors, (154), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand 175 states. [2022-02-20 19:03:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:50,034 INFO L93 Difference]: Finished difference Result 175 states and 266 transitions. [2022-02-20 19:03:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 266 transitions. [2022-02-20 19:03:50,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:03:50,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:03:50,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:03:50,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:03:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 109 states have internal predecessors, (154), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2022-02-20 19:03:50,047 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 72 [2022-02-20 19:03:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:03:50,048 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2022-02-20 19:03:50,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2022-02-20 19:03:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 19:03:50,049 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:03:50,050 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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:03:50,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:03:50,050 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:03:50,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:03:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1826847327, now seen corresponding path program 1 times [2022-02-20 19:03:50,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:03:50,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142910861] [2022-02-20 19:03:50,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:03:50,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:03:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:50,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:03:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:50,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2401#true} {2402#false} #484#return; {2402#false} is VALID [2022-02-20 19:03:50,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 19:03:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:50,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2401#true} {2402#false} #486#return; {2402#false} is VALID [2022-02-20 19:03:50,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 19:03:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:50,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2401#true} {2402#false} #488#return; {2402#false} is VALID [2022-02-20 19:03:50,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-20 19:03:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:50,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2401#true} {2402#false} #490#return; {2402#false} is VALID [2022-02-20 19:03:50,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-20 19:03:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:50,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2401#true} {2402#false} #492#return; {2402#false} is VALID [2022-02-20 19:03:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:03:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:50,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2401#true} {2402#false} #494#return; {2402#false} is VALID [2022-02-20 19:03:50,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 19:03:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:50,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2401#true} {2402#false} #496#return; {2402#false} is VALID [2022-02-20 19:03:50,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 19:03:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:50,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2401#true} {2402#false} #498#return; {2402#false} is VALID [2022-02-20 19:03:50,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 19:03:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:50,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2401#true} {2402#false} #500#return; {2402#false} is VALID [2022-02-20 19:03:50,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 19:03:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:50,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2401#true} {2402#false} #502#return; {2402#false} is VALID [2022-02-20 19:03:50,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {2401#true} is VALID [2022-02-20 19:03:50,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {2401#true} is VALID [2022-02-20 19:03:50,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {2403#(= |ULTIMATE.start_main_~j~2#1| 0)} is VALID [2022-02-20 19:03:50,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {2403#(= |ULTIMATE.start_main_~j~2#1| 0)} assume !(main_~j~2#1 < 3); {2402#false} is VALID [2022-02-20 19:03:50,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {2402#false} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {2402#false} is VALID [2022-02-20 19:03:50,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {2402#false} assume !(main_~i~0#1 < 2); {2402#false} is VALID [2022-02-20 19:03:50,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {2402#false} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {2402#false} is VALID [2022-02-20 19:03:50,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {2402#false} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {2402#false} is VALID [2022-02-20 19:03:50,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {2402#false} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {2402#false} is VALID [2022-02-20 19:03:50,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {2402#false} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {2402#false} is VALID [2022-02-20 19:03:50,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {2402#false} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {2402#false} is VALID [2022-02-20 19:03:50,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {2402#false} assume !(1 == main_#t~mem75#1 % 256);havoc main_#t~mem75#1; {2402#false} is VALID [2022-02-20 19:03:50,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {2402#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {2402#false} is VALID [2022-02-20 19:03:50,189 INFO L272 TraceCheckUtils]: 13: Hoare triple {2402#false} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {2401#true} is VALID [2022-02-20 19:03:50,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,189 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2401#true} {2402#false} #484#return; {2402#false} is VALID [2022-02-20 19:03:50,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {2402#false} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {2402#false} is VALID [2022-02-20 19:03:50,189 INFO L272 TraceCheckUtils]: 19: Hoare triple {2402#false} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {2401#true} is VALID [2022-02-20 19:03:50,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,190 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2401#true} {2402#false} #486#return; {2402#false} is VALID [2022-02-20 19:03:50,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {2402#false} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {2402#false} is VALID [2022-02-20 19:03:50,190 INFO L272 TraceCheckUtils]: 25: Hoare triple {2402#false} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {2401#true} is VALID [2022-02-20 19:03:50,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,191 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2401#true} {2402#false} #488#return; {2402#false} is VALID [2022-02-20 19:03:50,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {2402#false} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {2402#false} is VALID [2022-02-20 19:03:50,191 INFO L272 TraceCheckUtils]: 31: Hoare triple {2402#false} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {2401#true} is VALID [2022-02-20 19:03:50,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,191 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2401#true} {2402#false} #490#return; {2402#false} is VALID [2022-02-20 19:03:50,192 INFO L290 TraceCheckUtils]: 36: Hoare triple {2402#false} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {2402#false} is VALID [2022-02-20 19:03:50,192 INFO L272 TraceCheckUtils]: 37: Hoare triple {2402#false} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {2401#true} is VALID [2022-02-20 19:03:50,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,192 INFO L290 TraceCheckUtils]: 39: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,192 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2401#true} {2402#false} #492#return; {2402#false} is VALID [2022-02-20 19:03:50,192 INFO L290 TraceCheckUtils]: 42: Hoare triple {2402#false} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {2402#false} is VALID [2022-02-20 19:03:50,193 INFO L272 TraceCheckUtils]: 43: Hoare triple {2402#false} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {2401#true} is VALID [2022-02-20 19:03:50,193 INFO L290 TraceCheckUtils]: 44: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,193 INFO L290 TraceCheckUtils]: 45: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,193 INFO L290 TraceCheckUtils]: 46: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,193 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2401#true} {2402#false} #494#return; {2402#false} is VALID [2022-02-20 19:03:50,193 INFO L290 TraceCheckUtils]: 48: Hoare triple {2402#false} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {2402#false} is VALID [2022-02-20 19:03:50,193 INFO L272 TraceCheckUtils]: 49: Hoare triple {2402#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {2401#true} is VALID [2022-02-20 19:03:50,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,194 INFO L290 TraceCheckUtils]: 51: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,194 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2401#true} {2402#false} #496#return; {2402#false} is VALID [2022-02-20 19:03:50,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {2402#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {2402#false} is VALID [2022-02-20 19:03:50,194 INFO L272 TraceCheckUtils]: 55: Hoare triple {2402#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {2401#true} is VALID [2022-02-20 19:03:50,194 INFO L290 TraceCheckUtils]: 56: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,194 INFO L290 TraceCheckUtils]: 57: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,194 INFO L290 TraceCheckUtils]: 58: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,195 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2401#true} {2402#false} #498#return; {2402#false} is VALID [2022-02-20 19:03:50,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {2402#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {2402#false} is VALID [2022-02-20 19:03:50,195 INFO L272 TraceCheckUtils]: 61: Hoare triple {2402#false} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {2401#true} is VALID [2022-02-20 19:03:50,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,195 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {2401#true} {2402#false} #500#return; {2402#false} is VALID [2022-02-20 19:03:50,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {2402#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {2402#false} is VALID [2022-02-20 19:03:50,196 INFO L272 TraceCheckUtils]: 67: Hoare triple {2402#false} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {2401#true} is VALID [2022-02-20 19:03:50,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {2401#true} ~cond := #in~cond; {2401#true} is VALID [2022-02-20 19:03:50,196 INFO L290 TraceCheckUtils]: 69: Hoare triple {2401#true} assume !(0 == ~cond); {2401#true} is VALID [2022-02-20 19:03:50,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {2401#true} assume true; {2401#true} is VALID [2022-02-20 19:03:50,196 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {2401#true} {2402#false} #502#return; {2402#false} is VALID [2022-02-20 19:03:50,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {2402#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {2402#false} is VALID [2022-02-20 19:03:50,196 INFO L290 TraceCheckUtils]: 73: Hoare triple {2402#false} assume 0 == __VERIFIER_assert_~cond#1; {2402#false} is VALID [2022-02-20 19:03:50,197 INFO L290 TraceCheckUtils]: 74: Hoare triple {2402#false} assume !false; {2402#false} is VALID [2022-02-20 19:03:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 19:03:50,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:03:50,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142910861] [2022-02-20 19:03:50,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142910861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:03:50,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:03:50,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:03:50,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540623186] [2022-02-20 19:03:50,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:03:50,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2022-02-20 19:03:50,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:03:50,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:50,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:03:50,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:03:50,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:03:50,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:03:50,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:03:50,235 INFO L87 Difference]: Start difference. First operand 172 states and 262 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:53,520 INFO L93 Difference]: Finished difference Result 343 states and 524 transitions. [2022-02-20 19:03:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:03:53,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2022-02-20 19:03:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:03:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2022-02-20 19:03:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2022-02-20 19:03:53,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 523 transitions. [2022-02-20 19:03:53,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:03:53,902 INFO L225 Difference]: With dead ends: 343 [2022-02-20 19:03:53,902 INFO L226 Difference]: Without dead ends: 174 [2022-02-20 19:03:53,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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:53,918 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 515 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:53,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 515 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:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-20 19:03:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2022-02-20 19:03:53,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:03:53,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 173 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:53,928 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 173 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:53,928 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 173 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:53,934 INFO L93 Difference]: Finished difference Result 174 states and 264 transitions. [2022-02-20 19:03:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 264 transitions. [2022-02-20 19:03:53,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:03:53,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:03:53,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand 174 states. [2022-02-20 19:03:53,936 INFO L87 Difference]: Start difference. First operand has 173 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand 174 states. [2022-02-20 19:03:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:03:53,942 INFO L93 Difference]: Finished difference Result 174 states and 264 transitions. [2022-02-20 19:03:53,942 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 264 transitions. [2022-02-20 19:03:53,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:03:53,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:03:53,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:03:53,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:03:53,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:03:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2022-02-20 19:03:53,949 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 75 [2022-02-20 19:03:53,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:03:53,949 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2022-02-20 19:03:53,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:03:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2022-02-20 19:03:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:03:53,951 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:03:53,951 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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:03:53,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:03:53,951 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:03:53,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:03:53,952 INFO L85 PathProgramCache]: Analyzing trace with hash -541531615, now seen corresponding path program 1 times [2022-02-20 19:03:53,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:03:53,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119281321] [2022-02-20 19:03:53,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:03:53,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:03:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 19:03:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3518#true} {3519#false} #484#return; {3519#false} is VALID [2022-02-20 19:03:54,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:03:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3518#true} {3519#false} #486#return; {3519#false} is VALID [2022-02-20 19:03:54,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:03:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3518#true} {3519#false} #488#return; {3519#false} is VALID [2022-02-20 19:03:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:03:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3518#true} {3519#false} #490#return; {3519#false} is VALID [2022-02-20 19:03:54,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:03:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3518#true} {3519#false} #492#return; {3519#false} is VALID [2022-02-20 19:03:54,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 19:03:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3518#true} {3519#false} #494#return; {3519#false} is VALID [2022-02-20 19:03:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:03:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3518#true} {3519#false} #496#return; {3519#false} is VALID [2022-02-20 19:03:54,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 19:03:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3518#true} {3519#false} #498#return; {3519#false} is VALID [2022-02-20 19:03:54,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-20 19:03:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3518#true} {3519#false} #500#return; {3519#false} is VALID [2022-02-20 19:03:54,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 19:03:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3518#true} {3519#false} #502#return; {3519#false} is VALID [2022-02-20 19:03:54,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {3518#true} is VALID [2022-02-20 19:03:54,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {3518#true} is VALID [2022-02-20 19:03:54,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {3520#(= |ULTIMATE.start_main_~j~2#1| 0)} is VALID [2022-02-20 19:03:54,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {3520#(= |ULTIMATE.start_main_~j~2#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {3520#(= |ULTIMATE.start_main_~j~2#1| 0)} is VALID [2022-02-20 19:03:54,119 INFO L290 TraceCheckUtils]: 4: Hoare triple {3520#(= |ULTIMATE.start_main_~j~2#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {3521#(<= |ULTIMATE.start_main_~j~2#1| 1)} is VALID [2022-02-20 19:03:54,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {3521#(<= |ULTIMATE.start_main_~j~2#1| 1)} assume !(main_~j~2#1 < 3); {3519#false} is VALID [2022-02-20 19:03:54,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {3519#false} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {3519#false} is VALID [2022-02-20 19:03:54,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {3519#false} assume !(main_~i~0#1 < 2); {3519#false} is VALID [2022-02-20 19:03:54,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {3519#false} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {3519#false} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {3519#false} is VALID [2022-02-20 19:03:54,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {3519#false} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {3519#false} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {3519#false} is VALID [2022-02-20 19:03:54,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {3519#false} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {3519#false} assume !(1 == main_#t~mem75#1 % 256);havoc main_#t~mem75#1; {3519#false} is VALID [2022-02-20 19:03:54,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {3519#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,120 INFO L272 TraceCheckUtils]: 15: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:54,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,121 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3518#true} {3519#false} #484#return; {3519#false} is VALID [2022-02-20 19:03:54,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {3519#false} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,121 INFO L272 TraceCheckUtils]: 21: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:54,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,122 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3518#true} {3519#false} #486#return; {3519#false} is VALID [2022-02-20 19:03:54,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {3519#false} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,122 INFO L272 TraceCheckUtils]: 27: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:54,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,122 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3518#true} {3519#false} #488#return; {3519#false} is VALID [2022-02-20 19:03:54,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {3519#false} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:54,123 INFO L272 TraceCheckUtils]: 33: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:54,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,123 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3518#true} {3519#false} #490#return; {3519#false} is VALID [2022-02-20 19:03:54,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {3519#false} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:54,124 INFO L272 TraceCheckUtils]: 39: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:54,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,124 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3518#true} {3519#false} #492#return; {3519#false} is VALID [2022-02-20 19:03:54,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {3519#false} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:54,124 INFO L272 TraceCheckUtils]: 45: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:54,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,125 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3518#true} {3519#false} #494#return; {3519#false} is VALID [2022-02-20 19:03:54,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {3519#false} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,125 INFO L272 TraceCheckUtils]: 51: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:54,125 INFO L290 TraceCheckUtils]: 52: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,125 INFO L290 TraceCheckUtils]: 53: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,125 INFO L290 TraceCheckUtils]: 54: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,126 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3518#true} {3519#false} #496#return; {3519#false} is VALID [2022-02-20 19:03:54,126 INFO L290 TraceCheckUtils]: 56: Hoare triple {3519#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,126 INFO L272 TraceCheckUtils]: 57: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:54,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,126 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3518#true} {3519#false} #498#return; {3519#false} is VALID [2022-02-20 19:03:54,126 INFO L290 TraceCheckUtils]: 62: Hoare triple {3519#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:54,127 INFO L272 TraceCheckUtils]: 63: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:54,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,127 INFO L290 TraceCheckUtils]: 66: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,127 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3518#true} {3519#false} #500#return; {3519#false} is VALID [2022-02-20 19:03:54,127 INFO L290 TraceCheckUtils]: 68: Hoare triple {3519#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:54,127 INFO L272 TraceCheckUtils]: 69: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:54,128 INFO L290 TraceCheckUtils]: 70: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:54,128 INFO L290 TraceCheckUtils]: 71: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:54,128 INFO L290 TraceCheckUtils]: 72: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:54,128 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3518#true} {3519#false} #502#return; {3519#false} is VALID [2022-02-20 19:03:54,128 INFO L290 TraceCheckUtils]: 74: Hoare triple {3519#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {3519#false} is VALID [2022-02-20 19:03:54,128 INFO L290 TraceCheckUtils]: 75: Hoare triple {3519#false} assume 0 == __VERIFIER_assert_~cond#1; {3519#false} is VALID [2022-02-20 19:03:54,128 INFO L290 TraceCheckUtils]: 76: Hoare triple {3519#false} assume !false; {3519#false} is VALID [2022-02-20 19:03:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 19:03:54,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:03:54,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119281321] [2022-02-20 19:03:54,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119281321] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:03:54,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457250753] [2022-02-20 19:03:54,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:03:54,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:03:54,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:03:54,133 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:54,136 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:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 1765 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 19:03:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:03:54,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:03:54,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {3518#true} is VALID [2022-02-20 19:03:54,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {3518#true} is VALID [2022-02-20 19:03:54,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {3571#(<= |ULTIMATE.start_main_~j~2#1| 0)} is VALID [2022-02-20 19:03:54,951 INFO L290 TraceCheckUtils]: 3: Hoare triple {3571#(<= |ULTIMATE.start_main_~j~2#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {3571#(<= |ULTIMATE.start_main_~j~2#1| 0)} is VALID [2022-02-20 19:03:54,951 INFO L290 TraceCheckUtils]: 4: Hoare triple {3571#(<= |ULTIMATE.start_main_~j~2#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {3521#(<= |ULTIMATE.start_main_~j~2#1| 1)} is VALID [2022-02-20 19:03:54,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {3521#(<= |ULTIMATE.start_main_~j~2#1| 1)} assume !(main_~j~2#1 < 3); {3519#false} is VALID [2022-02-20 19:03:54,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {3519#false} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {3519#false} is VALID [2022-02-20 19:03:54,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {3519#false} assume !(main_~i~0#1 < 2); {3519#false} is VALID [2022-02-20 19:03:54,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {3519#false} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {3519#false} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {3519#false} is VALID [2022-02-20 19:03:54,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {3519#false} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {3519#false} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {3519#false} is VALID [2022-02-20 19:03:54,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {3519#false} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {3519#false} assume !(1 == main_#t~mem75#1 % 256);havoc main_#t~mem75#1; {3519#false} is VALID [2022-02-20 19:03:54,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {3519#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L272 TraceCheckUtils]: 15: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {3519#false} ~cond := #in~cond; {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {3519#false} assume !(0 == ~cond); {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {3519#false} assume true; {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3519#false} {3519#false} #484#return; {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {3519#false} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L272 TraceCheckUtils]: 21: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {3519#false} ~cond := #in~cond; {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {3519#false} assume !(0 == ~cond); {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {3519#false} assume true; {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3519#false} {3519#false} #486#return; {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {3519#false} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L272 TraceCheckUtils]: 27: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {3519#false} is VALID [2022-02-20 19:03:54,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {3519#false} ~cond := #in~cond; {3519#false} is VALID [2022-02-20 19:03:54,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {3519#false} assume !(0 == ~cond); {3519#false} is VALID [2022-02-20 19:03:54,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {3519#false} assume true; {3519#false} is VALID [2022-02-20 19:03:54,954 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3519#false} {3519#false} #488#return; {3519#false} is VALID [2022-02-20 19:03:54,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {3519#false} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:54,954 INFO L272 TraceCheckUtils]: 33: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {3519#false} is VALID [2022-02-20 19:03:54,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {3519#false} ~cond := #in~cond; {3519#false} is VALID [2022-02-20 19:03:54,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {3519#false} assume !(0 == ~cond); {3519#false} is VALID [2022-02-20 19:03:54,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {3519#false} assume true; {3519#false} is VALID [2022-02-20 19:03:54,954 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3519#false} {3519#false} #490#return; {3519#false} is VALID [2022-02-20 19:03:54,954 INFO L290 TraceCheckUtils]: 38: Hoare triple {3519#false} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:54,955 INFO L272 TraceCheckUtils]: 39: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {3519#false} is VALID [2022-02-20 19:03:54,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {3519#false} ~cond := #in~cond; {3519#false} is VALID [2022-02-20 19:03:54,955 INFO L290 TraceCheckUtils]: 41: Hoare triple {3519#false} assume !(0 == ~cond); {3519#false} is VALID [2022-02-20 19:03:54,955 INFO L290 TraceCheckUtils]: 42: Hoare triple {3519#false} assume true; {3519#false} is VALID [2022-02-20 19:03:54,955 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3519#false} {3519#false} #492#return; {3519#false} is VALID [2022-02-20 19:03:54,955 INFO L290 TraceCheckUtils]: 44: Hoare triple {3519#false} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:54,955 INFO L272 TraceCheckUtils]: 45: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {3519#false} is VALID [2022-02-20 19:03:54,955 INFO L290 TraceCheckUtils]: 46: Hoare triple {3519#false} ~cond := #in~cond; {3519#false} is VALID [2022-02-20 19:03:54,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {3519#false} assume !(0 == ~cond); {3519#false} is VALID [2022-02-20 19:03:54,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {3519#false} assume true; {3519#false} is VALID [2022-02-20 19:03:54,955 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3519#false} {3519#false} #494#return; {3519#false} is VALID [2022-02-20 19:03:54,955 INFO L290 TraceCheckUtils]: 50: Hoare triple {3519#false} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,956 INFO L272 TraceCheckUtils]: 51: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {3519#false} is VALID [2022-02-20 19:03:54,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {3519#false} ~cond := #in~cond; {3519#false} is VALID [2022-02-20 19:03:54,956 INFO L290 TraceCheckUtils]: 53: Hoare triple {3519#false} assume !(0 == ~cond); {3519#false} is VALID [2022-02-20 19:03:54,956 INFO L290 TraceCheckUtils]: 54: Hoare triple {3519#false} assume true; {3519#false} is VALID [2022-02-20 19:03:54,956 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3519#false} {3519#false} #496#return; {3519#false} is VALID [2022-02-20 19:03:54,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {3519#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:54,956 INFO L272 TraceCheckUtils]: 57: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {3519#false} is VALID [2022-02-20 19:03:54,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {3519#false} ~cond := #in~cond; {3519#false} is VALID [2022-02-20 19:03:54,957 INFO L290 TraceCheckUtils]: 59: Hoare triple {3519#false} assume !(0 == ~cond); {3519#false} is VALID [2022-02-20 19:03:54,957 INFO L290 TraceCheckUtils]: 60: Hoare triple {3519#false} assume true; {3519#false} is VALID [2022-02-20 19:03:54,957 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3519#false} {3519#false} #498#return; {3519#false} is VALID [2022-02-20 19:03:54,957 INFO L290 TraceCheckUtils]: 62: Hoare triple {3519#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:54,957 INFO L272 TraceCheckUtils]: 63: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {3519#false} is VALID [2022-02-20 19:03:54,957 INFO L290 TraceCheckUtils]: 64: Hoare triple {3519#false} ~cond := #in~cond; {3519#false} is VALID [2022-02-20 19:03:54,957 INFO L290 TraceCheckUtils]: 65: Hoare triple {3519#false} assume !(0 == ~cond); {3519#false} is VALID [2022-02-20 19:03:54,958 INFO L290 TraceCheckUtils]: 66: Hoare triple {3519#false} assume true; {3519#false} is VALID [2022-02-20 19:03:54,958 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3519#false} {3519#false} #500#return; {3519#false} is VALID [2022-02-20 19:03:54,958 INFO L290 TraceCheckUtils]: 68: Hoare triple {3519#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:54,958 INFO L272 TraceCheckUtils]: 69: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {3519#false} is VALID [2022-02-20 19:03:54,958 INFO L290 TraceCheckUtils]: 70: Hoare triple {3519#false} ~cond := #in~cond; {3519#false} is VALID [2022-02-20 19:03:54,958 INFO L290 TraceCheckUtils]: 71: Hoare triple {3519#false} assume !(0 == ~cond); {3519#false} is VALID [2022-02-20 19:03:54,958 INFO L290 TraceCheckUtils]: 72: Hoare triple {3519#false} assume true; {3519#false} is VALID [2022-02-20 19:03:54,958 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3519#false} {3519#false} #502#return; {3519#false} is VALID [2022-02-20 19:03:54,959 INFO L290 TraceCheckUtils]: 74: Hoare triple {3519#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {3519#false} is VALID [2022-02-20 19:03:54,959 INFO L290 TraceCheckUtils]: 75: Hoare triple {3519#false} assume 0 == __VERIFIER_assert_~cond#1; {3519#false} is VALID [2022-02-20 19:03:54,959 INFO L290 TraceCheckUtils]: 76: Hoare triple {3519#false} assume !false; {3519#false} is VALID [2022-02-20 19:03:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 19:03:54,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:03:55,178 INFO L290 TraceCheckUtils]: 76: Hoare triple {3519#false} assume !false; {3519#false} is VALID [2022-02-20 19:03:55,179 INFO L290 TraceCheckUtils]: 75: Hoare triple {3519#false} assume 0 == __VERIFIER_assert_~cond#1; {3519#false} is VALID [2022-02-20 19:03:55,179 INFO L290 TraceCheckUtils]: 74: Hoare triple {3519#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {3519#false} is VALID [2022-02-20 19:03:55,179 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3518#true} {3519#false} #502#return; {3519#false} is VALID [2022-02-20 19:03:55,179 INFO L290 TraceCheckUtils]: 72: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:55,179 INFO L290 TraceCheckUtils]: 71: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:55,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:55,180 INFO L272 TraceCheckUtils]: 69: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:55,180 INFO L290 TraceCheckUtils]: 68: Hoare triple {3519#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:55,180 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3518#true} {3519#false} #500#return; {3519#false} is VALID [2022-02-20 19:03:55,180 INFO L290 TraceCheckUtils]: 66: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:55,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:55,180 INFO L290 TraceCheckUtils]: 64: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:55,180 INFO L272 TraceCheckUtils]: 63: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:55,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {3519#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:55,181 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3518#true} {3519#false} #498#return; {3519#false} is VALID [2022-02-20 19:03:55,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:55,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:55,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:55,181 INFO L272 TraceCheckUtils]: 57: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:55,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {3519#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:55,181 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3518#true} {3519#false} #496#return; {3519#false} is VALID [2022-02-20 19:03:55,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:55,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:55,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:55,182 INFO L272 TraceCheckUtils]: 51: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:55,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {3519#false} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:55,182 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3518#true} {3519#false} #494#return; {3519#false} is VALID [2022-02-20 19:03:55,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:55,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:55,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:55,183 INFO L272 TraceCheckUtils]: 45: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:55,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {3519#false} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:55,183 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3518#true} {3519#false} #492#return; {3519#false} is VALID [2022-02-20 19:03:55,183 INFO L290 TraceCheckUtils]: 42: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:55,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:55,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:55,183 INFO L272 TraceCheckUtils]: 39: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:55,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {3519#false} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:55,184 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3518#true} {3519#false} #490#return; {3519#false} is VALID [2022-02-20 19:03:55,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:55,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:55,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:55,184 INFO L272 TraceCheckUtils]: 33: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:55,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {3519#false} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {3519#false} is VALID [2022-02-20 19:03:55,184 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3518#true} {3519#false} #488#return; {3519#false} is VALID [2022-02-20 19:03:55,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:55,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:55,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:55,185 INFO L272 TraceCheckUtils]: 27: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:55,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {3519#false} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:55,185 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3518#true} {3519#false} #486#return; {3519#false} is VALID [2022-02-20 19:03:55,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:55,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:55,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:55,186 INFO L272 TraceCheckUtils]: 21: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:55,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {3519#false} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:55,186 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3518#true} {3519#false} #484#return; {3519#false} is VALID [2022-02-20 19:03:55,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {3518#true} assume true; {3518#true} is VALID [2022-02-20 19:03:55,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {3518#true} assume !(0 == ~cond); {3518#true} is VALID [2022-02-20 19:03:55,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {3518#true} ~cond := #in~cond; {3518#true} is VALID [2022-02-20 19:03:55,187 INFO L272 TraceCheckUtils]: 15: Hoare triple {3519#false} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {3518#true} is VALID [2022-02-20 19:03:55,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {3519#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {3519#false} is VALID [2022-02-20 19:03:55,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {3519#false} assume !(1 == main_#t~mem75#1 % 256);havoc main_#t~mem75#1; {3519#false} is VALID [2022-02-20 19:03:55,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {3519#false} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {3519#false} is VALID [2022-02-20 19:03:55,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {3519#false} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {3519#false} is VALID [2022-02-20 19:03:55,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {3519#false} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {3519#false} is VALID [2022-02-20 19:03:55,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {3519#false} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {3519#false} is VALID [2022-02-20 19:03:55,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {3519#false} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {3519#false} is VALID [2022-02-20 19:03:55,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {3519#false} assume !(main_~i~0#1 < 2); {3519#false} is VALID [2022-02-20 19:03:55,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {3519#false} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {3519#false} is VALID [2022-02-20 19:03:55,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {4007#(< |ULTIMATE.start_main_~j~2#1| 3)} assume !(main_~j~2#1 < 3); {3519#false} is VALID [2022-02-20 19:03:55,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {3521#(<= |ULTIMATE.start_main_~j~2#1| 1)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {4007#(< |ULTIMATE.start_main_~j~2#1| 3)} is VALID [2022-02-20 19:03:55,189 INFO L290 TraceCheckUtils]: 3: Hoare triple {3521#(<= |ULTIMATE.start_main_~j~2#1| 1)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {3521#(<= |ULTIMATE.start_main_~j~2#1| 1)} is VALID [2022-02-20 19:03:55,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {3518#true} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {3521#(<= |ULTIMATE.start_main_~j~2#1| 1)} is VALID [2022-02-20 19:03:55,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {3518#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {3518#true} is VALID [2022-02-20 19:03:55,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {3518#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {3518#true} is VALID [2022-02-20 19:03:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 19:03:55,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457250753] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:03:55,192 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:03:55,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-02-20 19:03:55,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769060255] [2022-02-20 19:03:55,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:03:55,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 77 [2022-02-20 19:03:55,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:03:55,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-02-20 19:03:55,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:03:55,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:03:55,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:03:55,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:03:55,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:03:55,302 INFO L87 Difference]: Start difference. First operand 173 states and 263 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-02-20 19:04:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:02,656 INFO L93 Difference]: Finished difference Result 347 states and 529 transitions. [2022-02-20 19:04:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:04:02,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 77 [2022-02-20 19:04:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:04:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-02-20 19:04:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2022-02-20 19:04:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-02-20 19:04:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2022-02-20 19:04:02,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 527 transitions. [2022-02-20 19:04:03,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 527 edges. 527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:03,049 INFO L225 Difference]: With dead ends: 347 [2022-02-20 19:04:03,049 INFO L226 Difference]: Without dead ends: 177 [2022-02-20 19:04:03,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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:04:03,051 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1027 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:04:03,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1027 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:04:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-20 19:04:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-02-20 19:04:03,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:04:03,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 177 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:04:03,060 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 177 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:04:03,060 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 177 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:04:03,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:03,071 INFO L93 Difference]: Finished difference Result 177 states and 267 transitions. [2022-02-20 19:04:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2022-02-20 19:04:03,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:03,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:03,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand 177 states. [2022-02-20 19:04:03,084 INFO L87 Difference]: Start difference. First operand has 177 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand 177 states. [2022-02-20 19:04:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:03,091 INFO L93 Difference]: Finished difference Result 177 states and 267 transitions. [2022-02-20 19:04:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2022-02-20 19:04:03,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:03,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:03,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:04:03,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:04:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-02-20 19:04:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2022-02-20 19:04:03,097 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 77 [2022-02-20 19:04:03,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:04:03,098 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2022-02-20 19:04:03,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-02-20 19:04:03,098 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2022-02-20 19:04:03,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 19:04:03,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:04:03,100 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2022-02-20 19:04:03,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 19:04:03,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:04:03,338 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:04:03,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:04:03,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1454696411, now seen corresponding path program 2 times [2022-02-20 19:04:03,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:04:03,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8412941] [2022-02-20 19:04:03,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:04:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 19:04:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5113#true} {5114#false} #484#return; {5114#false} is VALID [2022-02-20 19:04:03,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 19:04:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5113#true} {5114#false} #486#return; {5114#false} is VALID [2022-02-20 19:04:03,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-20 19:04:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5113#true} {5114#false} #488#return; {5114#false} is VALID [2022-02-20 19:04:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-20 19:04:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5113#true} {5114#false} #490#return; {5114#false} is VALID [2022-02-20 19:04:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:04:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5113#true} {5114#false} #492#return; {5114#false} is VALID [2022-02-20 19:04:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 19:04:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5113#true} {5114#false} #494#return; {5114#false} is VALID [2022-02-20 19:04:03,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 19:04:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5113#true} {5114#false} #496#return; {5114#false} is VALID [2022-02-20 19:04:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 19:04:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5113#true} {5114#false} #498#return; {5114#false} is VALID [2022-02-20 19:04:03,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 19:04:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5113#true} {5114#false} #500#return; {5114#false} is VALID [2022-02-20 19:04:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-02-20 19:04:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:03,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5113#true} {5114#false} #502#return; {5114#false} is VALID [2022-02-20 19:04:03,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {5113#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {5113#true} is VALID [2022-02-20 19:04:03,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {5113#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~2#1 < 3); {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:03,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {5115#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {5116#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 19:04:03,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {5116#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 2); {5114#false} is VALID [2022-02-20 19:04:03,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {5114#false} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {5114#false} is VALID [2022-02-20 19:04:03,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {5114#false} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {5114#false} is VALID [2022-02-20 19:04:03,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {5114#false} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {5114#false} is VALID [2022-02-20 19:04:03,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {5114#false} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {5114#false} is VALID [2022-02-20 19:04:03,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {5114#false} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {5114#false} is VALID [2022-02-20 19:04:03,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {5114#false} assume !(1 == main_#t~mem75#1 % 256);havoc main_#t~mem75#1; {5114#false} is VALID [2022-02-20 19:04:03,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {5114#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5114#false} is VALID [2022-02-20 19:04:03,629 INFO L272 TraceCheckUtils]: 19: Hoare triple {5114#false} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {5113#true} is VALID [2022-02-20 19:04:03,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,629 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5113#true} {5114#false} #484#return; {5114#false} is VALID [2022-02-20 19:04:03,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {5114#false} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5114#false} is VALID [2022-02-20 19:04:03,629 INFO L272 TraceCheckUtils]: 25: Hoare triple {5114#false} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {5113#true} is VALID [2022-02-20 19:04:03,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,630 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5113#true} {5114#false} #486#return; {5114#false} is VALID [2022-02-20 19:04:03,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {5114#false} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5114#false} is VALID [2022-02-20 19:04:03,630 INFO L272 TraceCheckUtils]: 31: Hoare triple {5114#false} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {5113#true} is VALID [2022-02-20 19:04:03,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,631 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5113#true} {5114#false} #488#return; {5114#false} is VALID [2022-02-20 19:04:03,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {5114#false} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5114#false} is VALID [2022-02-20 19:04:03,631 INFO L272 TraceCheckUtils]: 37: Hoare triple {5114#false} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {5113#true} is VALID [2022-02-20 19:04:03,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,631 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5113#true} {5114#false} #490#return; {5114#false} is VALID [2022-02-20 19:04:03,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {5114#false} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5114#false} is VALID [2022-02-20 19:04:03,632 INFO L272 TraceCheckUtils]: 43: Hoare triple {5114#false} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {5113#true} is VALID [2022-02-20 19:04:03,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,632 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5113#true} {5114#false} #492#return; {5114#false} is VALID [2022-02-20 19:04:03,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {5114#false} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5114#false} is VALID [2022-02-20 19:04:03,632 INFO L272 TraceCheckUtils]: 49: Hoare triple {5114#false} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {5113#true} is VALID [2022-02-20 19:04:03,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,633 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5113#true} {5114#false} #494#return; {5114#false} is VALID [2022-02-20 19:04:03,645 INFO L290 TraceCheckUtils]: 54: Hoare triple {5114#false} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {5114#false} is VALID [2022-02-20 19:04:03,655 INFO L272 TraceCheckUtils]: 55: Hoare triple {5114#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {5113#true} is VALID [2022-02-20 19:04:03,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,655 INFO L290 TraceCheckUtils]: 57: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,655 INFO L290 TraceCheckUtils]: 58: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,655 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5113#true} {5114#false} #496#return; {5114#false} is VALID [2022-02-20 19:04:03,655 INFO L290 TraceCheckUtils]: 60: Hoare triple {5114#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {5114#false} is VALID [2022-02-20 19:04:03,656 INFO L272 TraceCheckUtils]: 61: Hoare triple {5114#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {5113#true} is VALID [2022-02-20 19:04:03,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,656 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {5113#true} {5114#false} #498#return; {5114#false} is VALID [2022-02-20 19:04:03,656 INFO L290 TraceCheckUtils]: 66: Hoare triple {5114#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {5114#false} is VALID [2022-02-20 19:04:03,656 INFO L272 TraceCheckUtils]: 67: Hoare triple {5114#false} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {5113#true} is VALID [2022-02-20 19:04:03,656 INFO L290 TraceCheckUtils]: 68: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,656 INFO L290 TraceCheckUtils]: 69: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,657 INFO L290 TraceCheckUtils]: 70: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,657 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5113#true} {5114#false} #500#return; {5114#false} is VALID [2022-02-20 19:04:03,657 INFO L290 TraceCheckUtils]: 72: Hoare triple {5114#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {5114#false} is VALID [2022-02-20 19:04:03,657 INFO L272 TraceCheckUtils]: 73: Hoare triple {5114#false} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {5113#true} is VALID [2022-02-20 19:04:03,657 INFO L290 TraceCheckUtils]: 74: Hoare triple {5113#true} ~cond := #in~cond; {5113#true} is VALID [2022-02-20 19:04:03,657 INFO L290 TraceCheckUtils]: 75: Hoare triple {5113#true} assume !(0 == ~cond); {5113#true} is VALID [2022-02-20 19:04:03,657 INFO L290 TraceCheckUtils]: 76: Hoare triple {5113#true} assume true; {5113#true} is VALID [2022-02-20 19:04:03,657 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5113#true} {5114#false} #502#return; {5114#false} is VALID [2022-02-20 19:04:03,658 INFO L290 TraceCheckUtils]: 78: Hoare triple {5114#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {5114#false} is VALID [2022-02-20 19:04:03,658 INFO L290 TraceCheckUtils]: 79: Hoare triple {5114#false} assume 0 == __VERIFIER_assert_~cond#1; {5114#false} is VALID [2022-02-20 19:04:03,658 INFO L290 TraceCheckUtils]: 80: Hoare triple {5114#false} assume !false; {5114#false} is VALID [2022-02-20 19:04:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-02-20 19:04:03,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:04:03,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8412941] [2022-02-20 19:04:03,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8412941] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:04:03,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611172159] [2022-02-20 19:04:03,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 19:04:03,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:04:03,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:04:03,676 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:04:03,678 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:04:04,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 19:04:04,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:04:04,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:04:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:04,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:04:04,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {5113#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {5160#(= ~__CS_error~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {5160#(= ~__CS_error~0 0)} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {5160#(= ~__CS_error~0 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {5160#(= ~__CS_error~0 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {5160#(= ~__CS_error~0 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {5160#(= ~__CS_error~0 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {5160#(= ~__CS_error~0 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {5160#(= ~__CS_error~0 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(main_~j~2#1 < 3); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {5160#(= ~__CS_error~0 0)} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(main_~i~0#1 < 2); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {5160#(= ~__CS_error~0 0)} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {5160#(= ~__CS_error~0 0)} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {5160#(= ~__CS_error~0 0)} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(1 == main_#t~mem75#1 % 256);havoc main_#t~mem75#1; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {5160#(= ~__CS_error~0 0)} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,694 INFO L272 TraceCheckUtils]: 19: Hoare triple {5160#(= ~__CS_error~0 0)} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {5160#(= ~__CS_error~0 0)} ~cond := #in~cond; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(0 == ~cond); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {5160#(= ~__CS_error~0 0)} assume true; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,696 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5160#(= ~__CS_error~0 0)} {5160#(= ~__CS_error~0 0)} #484#return; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {5160#(= ~__CS_error~0 0)} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,697 INFO L272 TraceCheckUtils]: 25: Hoare triple {5160#(= ~__CS_error~0 0)} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {5160#(= ~__CS_error~0 0)} ~cond := #in~cond; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(0 == ~cond); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {5160#(= ~__CS_error~0 0)} assume true; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,698 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5160#(= ~__CS_error~0 0)} {5160#(= ~__CS_error~0 0)} #486#return; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {5160#(= ~__CS_error~0 0)} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,699 INFO L272 TraceCheckUtils]: 31: Hoare triple {5160#(= ~__CS_error~0 0)} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {5160#(= ~__CS_error~0 0)} ~cond := #in~cond; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(0 == ~cond); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {5160#(= ~__CS_error~0 0)} assume true; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,700 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5160#(= ~__CS_error~0 0)} {5160#(= ~__CS_error~0 0)} #488#return; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {5160#(= ~__CS_error~0 0)} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,701 INFO L272 TraceCheckUtils]: 37: Hoare triple {5160#(= ~__CS_error~0 0)} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {5160#(= ~__CS_error~0 0)} ~cond := #in~cond; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(0 == ~cond); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {5160#(= ~__CS_error~0 0)} assume true; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,702 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5160#(= ~__CS_error~0 0)} {5160#(= ~__CS_error~0 0)} #490#return; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {5160#(= ~__CS_error~0 0)} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,703 INFO L272 TraceCheckUtils]: 43: Hoare triple {5160#(= ~__CS_error~0 0)} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {5160#(= ~__CS_error~0 0)} ~cond := #in~cond; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(0 == ~cond); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {5160#(= ~__CS_error~0 0)} assume true; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,704 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5160#(= ~__CS_error~0 0)} {5160#(= ~__CS_error~0 0)} #492#return; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,705 INFO L290 TraceCheckUtils]: 48: Hoare triple {5160#(= ~__CS_error~0 0)} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,705 INFO L272 TraceCheckUtils]: 49: Hoare triple {5160#(= ~__CS_error~0 0)} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,706 INFO L290 TraceCheckUtils]: 50: Hoare triple {5160#(= ~__CS_error~0 0)} ~cond := #in~cond; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,706 INFO L290 TraceCheckUtils]: 51: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(0 == ~cond); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,706 INFO L290 TraceCheckUtils]: 52: Hoare triple {5160#(= ~__CS_error~0 0)} assume true; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,709 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5160#(= ~__CS_error~0 0)} {5160#(= ~__CS_error~0 0)} #494#return; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,709 INFO L290 TraceCheckUtils]: 54: Hoare triple {5160#(= ~__CS_error~0 0)} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,709 INFO L272 TraceCheckUtils]: 55: Hoare triple {5160#(= ~__CS_error~0 0)} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,710 INFO L290 TraceCheckUtils]: 56: Hoare triple {5160#(= ~__CS_error~0 0)} ~cond := #in~cond; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,710 INFO L290 TraceCheckUtils]: 57: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(0 == ~cond); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,710 INFO L290 TraceCheckUtils]: 58: Hoare triple {5160#(= ~__CS_error~0 0)} assume true; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,711 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5160#(= ~__CS_error~0 0)} {5160#(= ~__CS_error~0 0)} #496#return; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,711 INFO L290 TraceCheckUtils]: 60: Hoare triple {5160#(= ~__CS_error~0 0)} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,711 INFO L272 TraceCheckUtils]: 61: Hoare triple {5160#(= ~__CS_error~0 0)} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,712 INFO L290 TraceCheckUtils]: 62: Hoare triple {5160#(= ~__CS_error~0 0)} ~cond := #in~cond; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,712 INFO L290 TraceCheckUtils]: 63: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(0 == ~cond); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,712 INFO L290 TraceCheckUtils]: 64: Hoare triple {5160#(= ~__CS_error~0 0)} assume true; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,713 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {5160#(= ~__CS_error~0 0)} {5160#(= ~__CS_error~0 0)} #498#return; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {5160#(= ~__CS_error~0 0)} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,714 INFO L272 TraceCheckUtils]: 67: Hoare triple {5160#(= ~__CS_error~0 0)} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,715 INFO L290 TraceCheckUtils]: 68: Hoare triple {5160#(= ~__CS_error~0 0)} ~cond := #in~cond; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,715 INFO L290 TraceCheckUtils]: 69: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(0 == ~cond); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,715 INFO L290 TraceCheckUtils]: 70: Hoare triple {5160#(= ~__CS_error~0 0)} assume true; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,716 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5160#(= ~__CS_error~0 0)} {5160#(= ~__CS_error~0 0)} #500#return; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,716 INFO L290 TraceCheckUtils]: 72: Hoare triple {5160#(= ~__CS_error~0 0)} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,717 INFO L272 TraceCheckUtils]: 73: Hoare triple {5160#(= ~__CS_error~0 0)} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,717 INFO L290 TraceCheckUtils]: 74: Hoare triple {5160#(= ~__CS_error~0 0)} ~cond := #in~cond; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,717 INFO L290 TraceCheckUtils]: 75: Hoare triple {5160#(= ~__CS_error~0 0)} assume !(0 == ~cond); {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,717 INFO L290 TraceCheckUtils]: 76: Hoare triple {5160#(= ~__CS_error~0 0)} assume true; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,718 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5160#(= ~__CS_error~0 0)} {5160#(= ~__CS_error~0 0)} #502#return; {5160#(= ~__CS_error~0 0)} is VALID [2022-02-20 19:04:04,718 INFO L290 TraceCheckUtils]: 78: Hoare triple {5160#(= ~__CS_error~0 0)} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {5395#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:04:04,719 INFO L290 TraceCheckUtils]: 79: Hoare triple {5395#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {5114#false} is VALID [2022-02-20 19:04:04,719 INFO L290 TraceCheckUtils]: 80: Hoare triple {5114#false} assume !false; {5114#false} is VALID [2022-02-20 19:04:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-20 19:04:04,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:04:04,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611172159] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:04:04,719 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 19:04:04,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-02-20 19:04:04,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753182815] [2022-02-20 19:04:04,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:04:04,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2022-02-20 19:04:04,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:04:04,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:04:04,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:04,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:04:04,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:04:04,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:04:04,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:04:04,805 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:04:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:07,940 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-02-20 19:04:07,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:04:07,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2022-02-20 19:04:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:04:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:04:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-02-20 19:04:07,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:04:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-02-20 19:04:07,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 518 transitions. [2022-02-20 19:04:08,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 518 edges. 518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:08,370 INFO L225 Difference]: With dead ends: 339 [2022-02-20 19:04:08,370 INFO L226 Difference]: Without dead ends: 313 [2022-02-20 19:04:08,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 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:08,371 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 208 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1001 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:08,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 1001 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:08,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-02-20 19:04:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 312. [2022-02-20 19:04:08,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:04:08,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 312 states, 198 states have (on average 1.4292929292929293) internal successors, (283), 198 states have internal predecessors, (283), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2022-02-20 19:04:08,387 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 312 states, 198 states have (on average 1.4292929292929293) internal successors, (283), 198 states have internal predecessors, (283), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2022-02-20 19:04:08,387 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 312 states, 198 states have (on average 1.4292929292929293) internal successors, (283), 198 states have internal predecessors, (283), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2022-02-20 19:04:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:08,397 INFO L93 Difference]: Finished difference Result 313 states and 486 transitions. [2022-02-20 19:04:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 486 transitions. [2022-02-20 19:04:08,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:08,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:08,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 312 states, 198 states have (on average 1.4292929292929293) internal successors, (283), 198 states have internal predecessors, (283), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) Second operand 313 states. [2022-02-20 19:04:08,400 INFO L87 Difference]: Start difference. First operand has 312 states, 198 states have (on average 1.4292929292929293) internal successors, (283), 198 states have internal predecessors, (283), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) Second operand 313 states. [2022-02-20 19:04:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:08,409 INFO L93 Difference]: Finished difference Result 313 states and 486 transitions. [2022-02-20 19:04:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 486 transitions. [2022-02-20 19:04:08,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:08,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:08,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:04:08,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:04:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 198 states have (on average 1.4292929292929293) internal successors, (283), 198 states have internal predecessors, (283), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2022-02-20 19:04:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 485 transitions. [2022-02-20 19:04:08,421 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 485 transitions. Word has length 81 [2022-02-20 19:04:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:04:08,421 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 485 transitions. [2022-02-20 19:04:08,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-02-20 19:04:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 485 transitions. [2022-02-20 19:04:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-02-20 19:04:08,424 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:04:08,424 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:04:08,464 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:08,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:04:08,640 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:04:08,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:04:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1723452947, now seen corresponding path program 1 times [2022-02-20 19:04:08,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:04:08,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604446917] [2022-02-20 19:04:08,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:08,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:04:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:04:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 19:04:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:04:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:08,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:08,905 INFO L272 TraceCheckUtils]: 1: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:08,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,906 INFO L290 TraceCheckUtils]: 3: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,906 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:08,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:08,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:08,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:08,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,907 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6943#true} {6943#true} #434#return; {6943#true} is VALID [2022-02-20 19:04:08,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 19:04:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {7116#(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); {6943#true} is VALID [2022-02-20 19:04:08,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {6943#true} is VALID [2022-02-20 19:04:08,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6943#true} #436#return; {6943#true} is VALID [2022-02-20 19:04:08,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 19:04:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:04:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:08,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:08,932 INFO L272 TraceCheckUtils]: 1: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:08,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,932 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:08,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:08,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:08,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:08,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,933 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6943#true} {6943#true} #438#return; {6943#true} is VALID [2022-02-20 19:04:08,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 19:04:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:04:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:08,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:08,940 INFO L272 TraceCheckUtils]: 1: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:08,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,941 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:08,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:08,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:08,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:08,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,941 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6943#true} {6943#true} #440#return; {6943#true} is VALID [2022-02-20 19:04:08,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:04:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {7125#(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); {6943#true} is VALID [2022-02-20 19:04:08,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#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; {6943#true} is VALID [2022-02-20 19:04:08,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6943#true} #442#return; {6943#true} is VALID [2022-02-20 19:04:08,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:04:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:04:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:08,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:08,968 INFO L272 TraceCheckUtils]: 1: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:08,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,968 INFO L290 TraceCheckUtils]: 3: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,968 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:08,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:08,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:08,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:08,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,969 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6943#true} {6943#true} #444#return; {6943#true} is VALID [2022-02-20 19:04:08,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {7058#(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)|))} #~77#1.base, #~77#1.offset := #in~77#1.base, #in~77#1.offset; {6943#true} is VALID [2022-02-20 19:04:08,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {6943#true} is VALID [2022-02-20 19:04:08,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#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 := #~77#1.base, #~77#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; {6943#true} is VALID [2022-02-20 19:04:08,970 INFO L272 TraceCheckUtils]: 3: Hoare triple {6943#true} call __CS_cs(); {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:08,970 INFO L290 TraceCheckUtils]: 4: Hoare triple {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:08,971 INFO L272 TraceCheckUtils]: 5: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:08,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,971 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:08,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:08,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:08,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:08,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,972 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6943#true} {6943#true} #434#return; {6943#true} is VALID [2022-02-20 19:04:08,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {6943#true} assume !(0 != ~__CS_ret~0 % 256); {6943#true} is VALID [2022-02-20 19:04:08,973 INFO L272 TraceCheckUtils]: 16: Hoare triple {6943#true} call thread2_#t~ret30#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {7116#(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:08,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {7116#(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); {6943#true} is VALID [2022-02-20 19:04:08,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {6943#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {6943#true} is VALID [2022-02-20 19:04:08,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,973 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6943#true} {6943#true} #436#return; {6943#true} is VALID [2022-02-20 19:04:08,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {6943#true} assume -2147483648 <= thread2_#t~ret30#1 && thread2_#t~ret30#1 <= 2147483647;havoc thread2_#t~ret30#1; {6943#true} is VALID [2022-02-20 19:04:08,974 INFO L272 TraceCheckUtils]: 22: Hoare triple {6943#true} call __CS_cs(); {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:08,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:08,974 INFO L272 TraceCheckUtils]: 24: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:08,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,975 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:08,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:08,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:08,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:08,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,975 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6943#true} {6943#true} #438#return; {6943#true} is VALID [2022-02-20 19:04:08,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {6943#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; {6943#true} is VALID [2022-02-20 19:04:08,976 INFO L272 TraceCheckUtils]: 35: Hoare triple {6943#true} call __CS_cs(); {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:08,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:08,976 INFO L272 TraceCheckUtils]: 37: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:08,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,977 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:08,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:08,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:08,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:08,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,977 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6943#true} {6943#true} #440#return; {6943#true} is VALID [2022-02-20 19:04:08,977 INFO L290 TraceCheckUtils]: 47: Hoare triple {6943#true} assume !(0 != ~__CS_ret~0 % 256); {6943#true} is VALID [2022-02-20 19:04:08,978 INFO L272 TraceCheckUtils]: 48: Hoare triple {6943#true} call thread2_#t~ret32#1 := __CS_pthread_mutex_unlock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {7125#(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:08,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {7125#(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); {6943#true} is VALID [2022-02-20 19:04:08,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {6943#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; {6943#true} is VALID [2022-02-20 19:04:08,979 INFO L290 TraceCheckUtils]: 51: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,979 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6943#true} {6943#true} #442#return; {6943#true} is VALID [2022-02-20 19:04:08,979 INFO L290 TraceCheckUtils]: 53: Hoare triple {6943#true} assume -2147483648 <= thread2_#t~ret32#1 && thread2_#t~ret32#1 <= 2147483647;havoc thread2_#t~ret32#1; {6943#true} is VALID [2022-02-20 19:04:08,979 INFO L272 TraceCheckUtils]: 54: Hoare triple {6943#true} call __CS_cs(); {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:08,979 INFO L290 TraceCheckUtils]: 55: Hoare triple {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:08,979 INFO L272 TraceCheckUtils]: 56: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:08,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,980 INFO L290 TraceCheckUtils]: 58: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,980 INFO L290 TraceCheckUtils]: 59: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,980 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:08,980 INFO L290 TraceCheckUtils]: 61: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:08,980 INFO L290 TraceCheckUtils]: 62: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:08,980 INFO L290 TraceCheckUtils]: 63: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:08,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,981 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {6943#true} {6943#true} #444#return; {6943#true} is VALID [2022-02-20 19:04:08,981 INFO L290 TraceCheckUtils]: 66: Hoare triple {6943#true} assume 0 != ~__CS_ret~0 % 256;thread2_#res#1.base, thread2_#res#1.offset := 0, 0; {6943#true} is VALID [2022-02-20 19:04:08,981 INFO L290 TraceCheckUtils]: 67: Hoare triple {6943#true} #t~ret108#1.base, #t~ret108#1.offset := thread2_#res#1.base, thread2_#res#1.offset;assume { :end_inline_thread2 } true;#t~funptrres106#1.base, #t~funptrres106#1.offset := #t~ret108#1.base, #t~ret108#1.offset; {6943#true} is VALID [2022-02-20 19:04:08,981 INFO L290 TraceCheckUtils]: 68: Hoare triple {6943#true} #res#1.base, #res#1.offset := #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset;havoc #t~ret108#1.base, #t~ret108#1.offset;havoc #t~ret109#1.base, #t~ret109#1.offset; {6943#true} is VALID [2022-02-20 19:04:08,981 INFO L290 TraceCheckUtils]: 69: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,981 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {6943#true} {6944#false} #482#return; {6944#false} is VALID [2022-02-20 19:04:08,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-02-20 19:04:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6944#false} #484#return; {6944#false} is VALID [2022-02-20 19:04:08,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-02-20 19:04:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6944#false} #486#return; {6944#false} is VALID [2022-02-20 19:04:08,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-02-20 19:04:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6944#false} #488#return; {6944#false} is VALID [2022-02-20 19:04:08,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-02-20 19:04:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:08,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:08,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:08,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:08,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6944#false} #490#return; {6944#false} is VALID [2022-02-20 19:04:08,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-02-20 19:04:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:09,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6944#false} #492#return; {6944#false} is VALID [2022-02-20 19:04:09,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-02-20 19:04:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:09,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6944#false} #494#return; {6944#false} is VALID [2022-02-20 19:04:09,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-02-20 19:04:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:09,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6944#false} #496#return; {6944#false} is VALID [2022-02-20 19:04:09,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-02-20 19:04:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:09,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6944#false} #498#return; {6944#false} is VALID [2022-02-20 19:04:09,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-02-20 19:04:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:09,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6944#false} #500#return; {6944#false} is VALID [2022-02-20 19:04:09,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-02-20 19:04:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:09,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6943#true} {6944#false} #502#return; {6944#false} is VALID [2022-02-20 19:04:09,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {6943#true} is VALID [2022-02-20 19:04:09,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:09,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:09,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:09,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:09,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:09,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:09,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:09,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:09,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~2#1 < 3); {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:09,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {6945#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {6946#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 19:04:09,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {6946#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 2); {6944#false} is VALID [2022-02-20 19:04:09,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {6944#false} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {6944#false} is VALID [2022-02-20 19:04:09,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {6944#false} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {6944#false} is VALID [2022-02-20 19:04:09,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {6944#false} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {6944#false} is VALID [2022-02-20 19:04:09,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {6944#false} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {6944#false} is VALID [2022-02-20 19:04:09,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {6944#false} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {6944#false} is VALID [2022-02-20 19:04:09,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {6944#false} assume 1 == main_#t~mem75#1 % 256;havoc main_#t~mem75#1;call main_#t~mem76#1 := read~int(~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_round~0 := main_#t~mem76#1;havoc main_#t~mem76#1;~__CS_ret~0 := 0; {6944#false} is VALID [2022-02-20 19:04:09,047 INFO L272 TraceCheckUtils]: 18: Hoare triple {6944#false} call main_#t~ret78#1.base, main_#t~ret78#1.offset := ##fun~$Pointer$~TO~$Pointer$(0, 0, ~__CS_thread~0.base[2], ~__CS_thread~0.offset[2]); {7058#(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:09,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {7058#(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)|))} #~77#1.base, #~77#1.offset := #in~77#1.base, #in~77#1.offset; {6943#true} is VALID [2022-02-20 19:04:09,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {6943#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {6943#true} is VALID [2022-02-20 19:04:09,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {6943#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 := #~77#1.base, #~77#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; {6943#true} is VALID [2022-02-20 19:04:09,048 INFO L272 TraceCheckUtils]: 22: Hoare triple {6943#true} call __CS_cs(); {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:09,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:09,048 INFO L272 TraceCheckUtils]: 24: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,049 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:09,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:09,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:09,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:09,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,050 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6943#true} {6943#true} #434#return; {6943#true} is VALID [2022-02-20 19:04:09,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {6943#true} assume !(0 != ~__CS_ret~0 % 256); {6943#true} is VALID [2022-02-20 19:04:09,050 INFO L272 TraceCheckUtils]: 35: Hoare triple {6943#true} call thread2_#t~ret30#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {7116#(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:09,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {7116#(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); {6943#true} is VALID [2022-02-20 19:04:09,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {6943#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {6943#true} is VALID [2022-02-20 19:04:09,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,051 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6943#true} {6943#true} #436#return; {6943#true} is VALID [2022-02-20 19:04:09,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {6943#true} assume -2147483648 <= thread2_#t~ret30#1 && thread2_#t~ret30#1 <= 2147483647;havoc thread2_#t~ret30#1; {6943#true} is VALID [2022-02-20 19:04:09,051 INFO L272 TraceCheckUtils]: 41: Hoare triple {6943#true} call __CS_cs(); {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:09,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:09,052 INFO L272 TraceCheckUtils]: 43: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,052 INFO L290 TraceCheckUtils]: 46: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,052 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:09,052 INFO L290 TraceCheckUtils]: 48: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:09,052 INFO L290 TraceCheckUtils]: 49: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:09,052 INFO L290 TraceCheckUtils]: 50: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:09,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,053 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6943#true} {6943#true} #438#return; {6943#true} is VALID [2022-02-20 19:04:09,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {6943#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; {6943#true} is VALID [2022-02-20 19:04:09,053 INFO L272 TraceCheckUtils]: 54: Hoare triple {6943#true} call __CS_cs(); {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:09,053 INFO L290 TraceCheckUtils]: 55: Hoare triple {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:09,053 INFO L272 TraceCheckUtils]: 56: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,053 INFO L290 TraceCheckUtils]: 57: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,054 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:09,054 INFO L290 TraceCheckUtils]: 61: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:09,054 INFO L290 TraceCheckUtils]: 62: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:09,054 INFO L290 TraceCheckUtils]: 63: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:09,054 INFO L290 TraceCheckUtils]: 64: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,054 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {6943#true} {6943#true} #440#return; {6943#true} is VALID [2022-02-20 19:04:09,055 INFO L290 TraceCheckUtils]: 66: Hoare triple {6943#true} assume !(0 != ~__CS_ret~0 % 256); {6943#true} is VALID [2022-02-20 19:04:09,055 INFO L272 TraceCheckUtils]: 67: Hoare triple {6943#true} call thread2_#t~ret32#1 := __CS_pthread_mutex_unlock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {7125#(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:09,055 INFO L290 TraceCheckUtils]: 68: Hoare triple {7125#(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); {6943#true} is VALID [2022-02-20 19:04:09,055 INFO L290 TraceCheckUtils]: 69: Hoare triple {6943#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; {6943#true} is VALID [2022-02-20 19:04:09,056 INFO L290 TraceCheckUtils]: 70: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,056 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6943#true} {6943#true} #442#return; {6943#true} is VALID [2022-02-20 19:04:09,056 INFO L290 TraceCheckUtils]: 72: Hoare triple {6943#true} assume -2147483648 <= thread2_#t~ret32#1 && thread2_#t~ret32#1 <= 2147483647;havoc thread2_#t~ret32#1; {6943#true} is VALID [2022-02-20 19:04:09,056 INFO L272 TraceCheckUtils]: 73: Hoare triple {6943#true} call __CS_cs(); {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:09,056 INFO L290 TraceCheckUtils]: 74: Hoare triple {7111#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:09,056 INFO L272 TraceCheckUtils]: 75: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,057 INFO L290 TraceCheckUtils]: 76: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,057 INFO L290 TraceCheckUtils]: 77: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,057 INFO L290 TraceCheckUtils]: 78: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,057 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:09,057 INFO L290 TraceCheckUtils]: 80: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:09,057 INFO L290 TraceCheckUtils]: 81: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:09,057 INFO L290 TraceCheckUtils]: 82: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:09,057 INFO L290 TraceCheckUtils]: 83: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,057 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {6943#true} {6943#true} #444#return; {6943#true} is VALID [2022-02-20 19:04:09,058 INFO L290 TraceCheckUtils]: 85: Hoare triple {6943#true} assume 0 != ~__CS_ret~0 % 256;thread2_#res#1.base, thread2_#res#1.offset := 0, 0; {6943#true} is VALID [2022-02-20 19:04:09,058 INFO L290 TraceCheckUtils]: 86: Hoare triple {6943#true} #t~ret108#1.base, #t~ret108#1.offset := thread2_#res#1.base, thread2_#res#1.offset;assume { :end_inline_thread2 } true;#t~funptrres106#1.base, #t~funptrres106#1.offset := #t~ret108#1.base, #t~ret108#1.offset; {6943#true} is VALID [2022-02-20 19:04:09,058 INFO L290 TraceCheckUtils]: 87: Hoare triple {6943#true} #res#1.base, #res#1.offset := #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset;havoc #t~ret108#1.base, #t~ret108#1.offset;havoc #t~ret109#1.base, #t~ret109#1.offset; {6943#true} is VALID [2022-02-20 19:04:09,058 INFO L290 TraceCheckUtils]: 88: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,058 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {6943#true} {6944#false} #482#return; {6944#false} is VALID [2022-02-20 19:04:09,058 INFO L290 TraceCheckUtils]: 90: Hoare triple {6944#false} havoc main_#t~ret78#1.base, main_#t~ret78#1.offset; {6944#false} is VALID [2022-02-20 19:04:09,058 INFO L290 TraceCheckUtils]: 91: Hoare triple {6944#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); {6944#false} is VALID [2022-02-20 19:04:09,058 INFO L290 TraceCheckUtils]: 92: Hoare triple {6944#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:09,059 INFO L272 TraceCheckUtils]: 93: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,059 INFO L290 TraceCheckUtils]: 94: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,059 INFO L290 TraceCheckUtils]: 95: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,059 INFO L290 TraceCheckUtils]: 96: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,059 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {6943#true} {6944#false} #484#return; {6944#false} is VALID [2022-02-20 19:04:09,059 INFO L290 TraceCheckUtils]: 98: Hoare triple {6944#false} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:09,059 INFO L272 TraceCheckUtils]: 99: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,059 INFO L290 TraceCheckUtils]: 100: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,060 INFO L290 TraceCheckUtils]: 101: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,060 INFO L290 TraceCheckUtils]: 102: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,060 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {6943#true} {6944#false} #486#return; {6944#false} is VALID [2022-02-20 19:04:09,060 INFO L290 TraceCheckUtils]: 104: Hoare triple {6944#false} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:09,060 INFO L272 TraceCheckUtils]: 105: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,060 INFO L290 TraceCheckUtils]: 106: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,060 INFO L290 TraceCheckUtils]: 107: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,060 INFO L290 TraceCheckUtils]: 108: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,061 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {6943#true} {6944#false} #488#return; {6944#false} is VALID [2022-02-20 19:04:09,061 INFO L290 TraceCheckUtils]: 110: Hoare triple {6944#false} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:09,061 INFO L272 TraceCheckUtils]: 111: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,061 INFO L290 TraceCheckUtils]: 112: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,061 INFO L290 TraceCheckUtils]: 113: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,061 INFO L290 TraceCheckUtils]: 114: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,061 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {6943#true} {6944#false} #490#return; {6944#false} is VALID [2022-02-20 19:04:09,061 INFO L290 TraceCheckUtils]: 116: Hoare triple {6944#false} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:09,061 INFO L272 TraceCheckUtils]: 117: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,062 INFO L290 TraceCheckUtils]: 118: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,062 INFO L290 TraceCheckUtils]: 119: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,062 INFO L290 TraceCheckUtils]: 120: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,062 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {6943#true} {6944#false} #492#return; {6944#false} is VALID [2022-02-20 19:04:09,062 INFO L290 TraceCheckUtils]: 122: Hoare triple {6944#false} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:09,062 INFO L272 TraceCheckUtils]: 123: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,062 INFO L290 TraceCheckUtils]: 124: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,062 INFO L290 TraceCheckUtils]: 125: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,063 INFO L290 TraceCheckUtils]: 126: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,063 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {6943#true} {6944#false} #494#return; {6944#false} is VALID [2022-02-20 19:04:09,063 INFO L290 TraceCheckUtils]: 128: Hoare triple {6944#false} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:09,063 INFO L272 TraceCheckUtils]: 129: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,063 INFO L290 TraceCheckUtils]: 130: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,063 INFO L290 TraceCheckUtils]: 131: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,063 INFO L290 TraceCheckUtils]: 132: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,063 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {6943#true} {6944#false} #496#return; {6944#false} is VALID [2022-02-20 19:04:09,063 INFO L290 TraceCheckUtils]: 134: Hoare triple {6944#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:09,064 INFO L272 TraceCheckUtils]: 135: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,064 INFO L290 TraceCheckUtils]: 136: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,064 INFO L290 TraceCheckUtils]: 137: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,064 INFO L290 TraceCheckUtils]: 138: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,064 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {6943#true} {6944#false} #498#return; {6944#false} is VALID [2022-02-20 19:04:09,064 INFO L290 TraceCheckUtils]: 140: Hoare triple {6944#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:09,064 INFO L272 TraceCheckUtils]: 141: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,064 INFO L290 TraceCheckUtils]: 142: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,065 INFO L290 TraceCheckUtils]: 143: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,065 INFO L290 TraceCheckUtils]: 144: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,065 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {6943#true} {6944#false} #500#return; {6944#false} is VALID [2022-02-20 19:04:09,065 INFO L290 TraceCheckUtils]: 146: Hoare triple {6944#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:09,065 INFO L272 TraceCheckUtils]: 147: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:09,065 INFO L290 TraceCheckUtils]: 148: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:09,065 INFO L290 TraceCheckUtils]: 149: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:09,065 INFO L290 TraceCheckUtils]: 150: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:09,066 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {6943#true} {6944#false} #502#return; {6944#false} is VALID [2022-02-20 19:04:09,066 INFO L290 TraceCheckUtils]: 152: Hoare triple {6944#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {6944#false} is VALID [2022-02-20 19:04:09,066 INFO L290 TraceCheckUtils]: 153: Hoare triple {6944#false} assume 0 == __VERIFIER_assert_~cond#1; {6944#false} is VALID [2022-02-20 19:04:09,066 INFO L290 TraceCheckUtils]: 154: Hoare triple {6944#false} assume !false; {6944#false} is VALID [2022-02-20 19:04:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-02-20 19:04:09,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:04:09,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604446917] [2022-02-20 19:04:09,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604446917] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:04:09,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183540757] [2022-02-20 19:04:09,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:09,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:04:09,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:04:09,069 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:09,070 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:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:09,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 2135 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 19:04:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:09,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:04:10,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {6943#true} is VALID [2022-02-20 19:04:10,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~2#1 < 3); {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {6946#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 19:04:10,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {6946#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 2); {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {6944#false} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {6944#false} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {6944#false} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {6944#false} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {6944#false} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {6944#false} assume 1 == main_#t~mem75#1 % 256;havoc main_#t~mem75#1;call main_#t~mem76#1 := read~int(~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_round~0 := main_#t~mem76#1;havoc main_#t~mem76#1;~__CS_ret~0 := 0; {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L272 TraceCheckUtils]: 18: Hoare triple {6944#false} call main_#t~ret78#1.base, main_#t~ret78#1.offset := ##fun~$Pointer$~TO~$Pointer$(0, 0, ~__CS_thread~0.base[2], ~__CS_thread~0.offset[2]); {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {6944#false} #~77#1.base, #~77#1.offset := #in~77#1.base, #in~77#1.offset; {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {6944#false} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {6944#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 := #~77#1.base, #~77#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; {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L272 TraceCheckUtils]: 22: Hoare triple {6944#false} call __CS_cs(); {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {6944#false} ~k~0 := #t~nondet3;havoc #t~nondet3; {6944#false} is VALID [2022-02-20 19:04:10,173 INFO L272 TraceCheckUtils]: 24: Hoare triple {6944#false} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,174 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6944#false} {6944#false} #504#return; {6944#false} is VALID [2022-02-20 19:04:10,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {6944#false} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6944#false} is VALID [2022-02-20 19:04:10,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {6944#false} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6944#false} is VALID [2022-02-20 19:04:10,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {6944#false} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6944#false} is VALID [2022-02-20 19:04:10,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,174 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6944#false} {6944#false} #434#return; {6944#false} is VALID [2022-02-20 19:04:10,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {6944#false} assume !(0 != ~__CS_ret~0 % 256); {6944#false} is VALID [2022-02-20 19:04:10,174 INFO L272 TraceCheckUtils]: 35: Hoare triple {6944#false} call thread2_#t~ret30#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {6944#false} is VALID [2022-02-20 19:04:10,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {6944#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {6944#false} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6944#false} {6944#false} #436#return; {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {6944#false} assume -2147483648 <= thread2_#t~ret30#1 && thread2_#t~ret30#1 <= 2147483647;havoc thread2_#t~ret30#1; {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L272 TraceCheckUtils]: 41: Hoare triple {6944#false} call __CS_cs(); {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {6944#false} ~k~0 := #t~nondet3;havoc #t~nondet3; {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L272 TraceCheckUtils]: 43: Hoare triple {6944#false} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6944#false} {6944#false} #504#return; {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {6944#false} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {6944#false} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {6944#false} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,175 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6944#false} {6944#false} #438#return; {6944#false} is VALID [2022-02-20 19:04:10,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {6944#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; {6944#false} is VALID [2022-02-20 19:04:10,176 INFO L272 TraceCheckUtils]: 54: Hoare triple {6944#false} call __CS_cs(); {6944#false} is VALID [2022-02-20 19:04:10,176 INFO L290 TraceCheckUtils]: 55: Hoare triple {6944#false} ~k~0 := #t~nondet3;havoc #t~nondet3; {6944#false} is VALID [2022-02-20 19:04:10,176 INFO L272 TraceCheckUtils]: 56: Hoare triple {6944#false} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,176 INFO L290 TraceCheckUtils]: 57: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,176 INFO L290 TraceCheckUtils]: 58: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,177 INFO L290 TraceCheckUtils]: 59: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,177 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6944#false} {6944#false} #504#return; {6944#false} is VALID [2022-02-20 19:04:10,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {6944#false} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6944#false} is VALID [2022-02-20 19:04:10,177 INFO L290 TraceCheckUtils]: 62: Hoare triple {6944#false} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6944#false} is VALID [2022-02-20 19:04:10,177 INFO L290 TraceCheckUtils]: 63: Hoare triple {6944#false} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6944#false} is VALID [2022-02-20 19:04:10,177 INFO L290 TraceCheckUtils]: 64: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,177 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {6944#false} {6944#false} #440#return; {6944#false} is VALID [2022-02-20 19:04:10,177 INFO L290 TraceCheckUtils]: 66: Hoare triple {6944#false} assume !(0 != ~__CS_ret~0 % 256); {6944#false} is VALID [2022-02-20 19:04:10,177 INFO L272 TraceCheckUtils]: 67: Hoare triple {6944#false} call thread2_#t~ret32#1 := __CS_pthread_mutex_unlock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {6944#false} is VALID [2022-02-20 19:04:10,178 INFO L290 TraceCheckUtils]: 68: Hoare triple {6944#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,178 INFO L290 TraceCheckUtils]: 69: Hoare triple {6944#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; {6944#false} is VALID [2022-02-20 19:04:10,178 INFO L290 TraceCheckUtils]: 70: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,178 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6944#false} {6944#false} #442#return; {6944#false} is VALID [2022-02-20 19:04:10,178 INFO L290 TraceCheckUtils]: 72: Hoare triple {6944#false} assume -2147483648 <= thread2_#t~ret32#1 && thread2_#t~ret32#1 <= 2147483647;havoc thread2_#t~ret32#1; {6944#false} is VALID [2022-02-20 19:04:10,178 INFO L272 TraceCheckUtils]: 73: Hoare triple {6944#false} call __CS_cs(); {6944#false} is VALID [2022-02-20 19:04:10,178 INFO L290 TraceCheckUtils]: 74: Hoare triple {6944#false} ~k~0 := #t~nondet3;havoc #t~nondet3; {6944#false} is VALID [2022-02-20 19:04:10,178 INFO L272 TraceCheckUtils]: 75: Hoare triple {6944#false} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,179 INFO L290 TraceCheckUtils]: 76: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,179 INFO L290 TraceCheckUtils]: 77: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,179 INFO L290 TraceCheckUtils]: 78: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,179 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {6944#false} {6944#false} #504#return; {6944#false} is VALID [2022-02-20 19:04:10,179 INFO L290 TraceCheckUtils]: 80: Hoare triple {6944#false} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6944#false} is VALID [2022-02-20 19:04:10,179 INFO L290 TraceCheckUtils]: 81: Hoare triple {6944#false} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6944#false} is VALID [2022-02-20 19:04:10,179 INFO L290 TraceCheckUtils]: 82: Hoare triple {6944#false} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6944#false} is VALID [2022-02-20 19:04:10,179 INFO L290 TraceCheckUtils]: 83: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,180 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {6944#false} {6944#false} #444#return; {6944#false} is VALID [2022-02-20 19:04:10,180 INFO L290 TraceCheckUtils]: 85: Hoare triple {6944#false} assume 0 != ~__CS_ret~0 % 256;thread2_#res#1.base, thread2_#res#1.offset := 0, 0; {6944#false} is VALID [2022-02-20 19:04:10,180 INFO L290 TraceCheckUtils]: 86: Hoare triple {6944#false} #t~ret108#1.base, #t~ret108#1.offset := thread2_#res#1.base, thread2_#res#1.offset;assume { :end_inline_thread2 } true;#t~funptrres106#1.base, #t~funptrres106#1.offset := #t~ret108#1.base, #t~ret108#1.offset; {6944#false} is VALID [2022-02-20 19:04:10,180 INFO L290 TraceCheckUtils]: 87: Hoare triple {6944#false} #res#1.base, #res#1.offset := #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset;havoc #t~ret108#1.base, #t~ret108#1.offset;havoc #t~ret109#1.base, #t~ret109#1.offset; {6944#false} is VALID [2022-02-20 19:04:10,180 INFO L290 TraceCheckUtils]: 88: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,180 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {6944#false} {6944#false} #482#return; {6944#false} is VALID [2022-02-20 19:04:10,180 INFO L290 TraceCheckUtils]: 90: Hoare triple {6944#false} havoc main_#t~ret78#1.base, main_#t~ret78#1.offset; {6944#false} is VALID [2022-02-20 19:04:10,180 INFO L290 TraceCheckUtils]: 91: Hoare triple {6944#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); {6944#false} is VALID [2022-02-20 19:04:10,180 INFO L290 TraceCheckUtils]: 92: Hoare triple {6944#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,181 INFO L272 TraceCheckUtils]: 93: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,181 INFO L290 TraceCheckUtils]: 94: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,181 INFO L290 TraceCheckUtils]: 95: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,181 INFO L290 TraceCheckUtils]: 96: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,181 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {6944#false} {6944#false} #484#return; {6944#false} is VALID [2022-02-20 19:04:10,181 INFO L290 TraceCheckUtils]: 98: Hoare triple {6944#false} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,181 INFO L272 TraceCheckUtils]: 99: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,181 INFO L290 TraceCheckUtils]: 100: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,182 INFO L290 TraceCheckUtils]: 101: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,182 INFO L290 TraceCheckUtils]: 102: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,182 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {6944#false} {6944#false} #486#return; {6944#false} is VALID [2022-02-20 19:04:10,182 INFO L290 TraceCheckUtils]: 104: Hoare triple {6944#false} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,182 INFO L272 TraceCheckUtils]: 105: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,182 INFO L290 TraceCheckUtils]: 106: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,182 INFO L290 TraceCheckUtils]: 107: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,182 INFO L290 TraceCheckUtils]: 108: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,183 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {6944#false} {6944#false} #488#return; {6944#false} is VALID [2022-02-20 19:04:10,183 INFO L290 TraceCheckUtils]: 110: Hoare triple {6944#false} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:10,183 INFO L272 TraceCheckUtils]: 111: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,183 INFO L290 TraceCheckUtils]: 112: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,183 INFO L290 TraceCheckUtils]: 113: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,183 INFO L290 TraceCheckUtils]: 114: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,183 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {6944#false} {6944#false} #490#return; {6944#false} is VALID [2022-02-20 19:04:10,183 INFO L290 TraceCheckUtils]: 116: Hoare triple {6944#false} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:10,184 INFO L272 TraceCheckUtils]: 117: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,184 INFO L290 TraceCheckUtils]: 118: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,184 INFO L290 TraceCheckUtils]: 119: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,184 INFO L290 TraceCheckUtils]: 120: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,184 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {6944#false} {6944#false} #492#return; {6944#false} is VALID [2022-02-20 19:04:10,184 INFO L290 TraceCheckUtils]: 122: Hoare triple {6944#false} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:10,184 INFO L272 TraceCheckUtils]: 123: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,184 INFO L290 TraceCheckUtils]: 124: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,185 INFO L290 TraceCheckUtils]: 125: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,185 INFO L290 TraceCheckUtils]: 126: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,185 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {6944#false} {6944#false} #494#return; {6944#false} is VALID [2022-02-20 19:04:10,185 INFO L290 TraceCheckUtils]: 128: Hoare triple {6944#false} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,185 INFO L272 TraceCheckUtils]: 129: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,185 INFO L290 TraceCheckUtils]: 130: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,199 INFO L290 TraceCheckUtils]: 131: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,199 INFO L290 TraceCheckUtils]: 132: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,199 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {6944#false} {6944#false} #496#return; {6944#false} is VALID [2022-02-20 19:04:10,200 INFO L290 TraceCheckUtils]: 134: Hoare triple {6944#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,200 INFO L272 TraceCheckUtils]: 135: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,200 INFO L290 TraceCheckUtils]: 136: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,200 INFO L290 TraceCheckUtils]: 137: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,200 INFO L290 TraceCheckUtils]: 138: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,200 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {6944#false} {6944#false} #498#return; {6944#false} is VALID [2022-02-20 19:04:10,200 INFO L290 TraceCheckUtils]: 140: Hoare triple {6944#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:10,200 INFO L272 TraceCheckUtils]: 141: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,201 INFO L290 TraceCheckUtils]: 142: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,201 INFO L290 TraceCheckUtils]: 143: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,201 INFO L290 TraceCheckUtils]: 144: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,201 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {6944#false} {6944#false} #500#return; {6944#false} is VALID [2022-02-20 19:04:10,201 INFO L290 TraceCheckUtils]: 146: Hoare triple {6944#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:10,201 INFO L272 TraceCheckUtils]: 147: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {6944#false} is VALID [2022-02-20 19:04:10,201 INFO L290 TraceCheckUtils]: 148: Hoare triple {6944#false} ~cond := #in~cond; {6944#false} is VALID [2022-02-20 19:04:10,201 INFO L290 TraceCheckUtils]: 149: Hoare triple {6944#false} assume !(0 == ~cond); {6944#false} is VALID [2022-02-20 19:04:10,201 INFO L290 TraceCheckUtils]: 150: Hoare triple {6944#false} assume true; {6944#false} is VALID [2022-02-20 19:04:10,202 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {6944#false} {6944#false} #502#return; {6944#false} is VALID [2022-02-20 19:04:10,202 INFO L290 TraceCheckUtils]: 152: Hoare triple {6944#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {6944#false} is VALID [2022-02-20 19:04:10,202 INFO L290 TraceCheckUtils]: 153: Hoare triple {6944#false} assume 0 == __VERIFIER_assert_~cond#1; {6944#false} is VALID [2022-02-20 19:04:10,202 INFO L290 TraceCheckUtils]: 154: Hoare triple {6944#false} assume !false; {6944#false} is VALID [2022-02-20 19:04:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-02-20 19:04:10,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:04:10,620 INFO L290 TraceCheckUtils]: 154: Hoare triple {6944#false} assume !false; {6944#false} is VALID [2022-02-20 19:04:10,620 INFO L290 TraceCheckUtils]: 153: Hoare triple {6944#false} assume 0 == __VERIFIER_assert_~cond#1; {6944#false} is VALID [2022-02-20 19:04:10,620 INFO L290 TraceCheckUtils]: 152: Hoare triple {6944#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {6944#false} is VALID [2022-02-20 19:04:10,620 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {6943#true} {6944#false} #502#return; {6944#false} is VALID [2022-02-20 19:04:10,620 INFO L290 TraceCheckUtils]: 150: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,620 INFO L290 TraceCheckUtils]: 149: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,620 INFO L290 TraceCheckUtils]: 148: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,620 INFO L272 TraceCheckUtils]: 147: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,620 INFO L290 TraceCheckUtils]: 146: Hoare triple {6944#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:10,620 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {6943#true} {6944#false} #500#return; {6944#false} is VALID [2022-02-20 19:04:10,620 INFO L290 TraceCheckUtils]: 144: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,620 INFO L290 TraceCheckUtils]: 143: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,621 INFO L290 TraceCheckUtils]: 142: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,621 INFO L272 TraceCheckUtils]: 141: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,621 INFO L290 TraceCheckUtils]: 140: Hoare triple {6944#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:10,621 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {6943#true} {6944#false} #498#return; {6944#false} is VALID [2022-02-20 19:04:10,621 INFO L290 TraceCheckUtils]: 138: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,621 INFO L290 TraceCheckUtils]: 137: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,621 INFO L290 TraceCheckUtils]: 136: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,621 INFO L272 TraceCheckUtils]: 135: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,621 INFO L290 TraceCheckUtils]: 134: Hoare triple {6944#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,621 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {6943#true} {6944#false} #496#return; {6944#false} is VALID [2022-02-20 19:04:10,621 INFO L290 TraceCheckUtils]: 132: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,621 INFO L290 TraceCheckUtils]: 131: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,621 INFO L290 TraceCheckUtils]: 130: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,621 INFO L272 TraceCheckUtils]: 129: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,623 INFO L290 TraceCheckUtils]: 128: Hoare triple {6944#false} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,624 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {6943#true} {6944#false} #494#return; {6944#false} is VALID [2022-02-20 19:04:10,624 INFO L290 TraceCheckUtils]: 126: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,624 INFO L290 TraceCheckUtils]: 125: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,624 INFO L290 TraceCheckUtils]: 124: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,624 INFO L272 TraceCheckUtils]: 123: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,624 INFO L290 TraceCheckUtils]: 122: Hoare triple {6944#false} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:10,624 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {6943#true} {6944#false} #492#return; {6944#false} is VALID [2022-02-20 19:04:10,624 INFO L290 TraceCheckUtils]: 120: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,624 INFO L290 TraceCheckUtils]: 119: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,624 INFO L290 TraceCheckUtils]: 118: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,624 INFO L272 TraceCheckUtils]: 117: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,624 INFO L290 TraceCheckUtils]: 116: Hoare triple {6944#false} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:10,624 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {6943#true} {6944#false} #490#return; {6944#false} is VALID [2022-02-20 19:04:10,624 INFO L290 TraceCheckUtils]: 114: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,624 INFO L290 TraceCheckUtils]: 113: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,624 INFO L290 TraceCheckUtils]: 112: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,625 INFO L272 TraceCheckUtils]: 111: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,625 INFO L290 TraceCheckUtils]: 110: Hoare triple {6944#false} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {6944#false} is VALID [2022-02-20 19:04:10,625 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {6943#true} {6944#false} #488#return; {6944#false} is VALID [2022-02-20 19:04:10,625 INFO L290 TraceCheckUtils]: 108: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,625 INFO L290 TraceCheckUtils]: 107: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,625 INFO L290 TraceCheckUtils]: 106: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,625 INFO L272 TraceCheckUtils]: 105: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,625 INFO L290 TraceCheckUtils]: 104: Hoare triple {6944#false} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,625 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {6943#true} {6944#false} #486#return; {6944#false} is VALID [2022-02-20 19:04:10,625 INFO L290 TraceCheckUtils]: 102: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,625 INFO L290 TraceCheckUtils]: 101: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,626 INFO L290 TraceCheckUtils]: 100: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,626 INFO L272 TraceCheckUtils]: 99: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,626 INFO L290 TraceCheckUtils]: 98: Hoare triple {6944#false} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,626 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {6943#true} {6944#false} #484#return; {6944#false} is VALID [2022-02-20 19:04:10,626 INFO L290 TraceCheckUtils]: 96: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,626 INFO L290 TraceCheckUtils]: 95: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,626 INFO L290 TraceCheckUtils]: 94: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,626 INFO L272 TraceCheckUtils]: 93: Hoare triple {6944#false} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,626 INFO L290 TraceCheckUtils]: 92: Hoare triple {6944#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,626 INFO L290 TraceCheckUtils]: 91: Hoare triple {6944#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); {6944#false} is VALID [2022-02-20 19:04:10,626 INFO L290 TraceCheckUtils]: 90: Hoare triple {6944#false} havoc main_#t~ret78#1.base, main_#t~ret78#1.offset; {6944#false} is VALID [2022-02-20 19:04:10,626 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {6943#true} {6944#false} #482#return; {6944#false} is VALID [2022-02-20 19:04:10,626 INFO L290 TraceCheckUtils]: 88: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,626 INFO L290 TraceCheckUtils]: 87: Hoare triple {6943#true} #res#1.base, #res#1.offset := #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset;havoc #t~ret108#1.base, #t~ret108#1.offset;havoc #t~ret109#1.base, #t~ret109#1.offset; {6943#true} is VALID [2022-02-20 19:04:10,626 INFO L290 TraceCheckUtils]: 86: Hoare triple {6943#true} #t~ret108#1.base, #t~ret108#1.offset := thread2_#res#1.base, thread2_#res#1.offset;assume { :end_inline_thread2 } true;#t~funptrres106#1.base, #t~funptrres106#1.offset := #t~ret108#1.base, #t~ret108#1.offset; {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L290 TraceCheckUtils]: 85: Hoare triple {6943#true} assume 0 != ~__CS_ret~0 % 256;thread2_#res#1.base, thread2_#res#1.offset := 0, 0; {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {6943#true} {6943#true} #444#return; {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L290 TraceCheckUtils]: 83: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L290 TraceCheckUtils]: 82: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L290 TraceCheckUtils]: 81: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L290 TraceCheckUtils]: 80: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L290 TraceCheckUtils]: 78: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L290 TraceCheckUtils]: 77: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L290 TraceCheckUtils]: 76: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L272 TraceCheckUtils]: 75: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L290 TraceCheckUtils]: 74: Hoare triple {6943#true} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L272 TraceCheckUtils]: 73: Hoare triple {6943#true} call __CS_cs(); {6943#true} is VALID [2022-02-20 19:04:10,627 INFO L290 TraceCheckUtils]: 72: Hoare triple {6943#true} assume -2147483648 <= thread2_#t~ret32#1 && thread2_#t~ret32#1 <= 2147483647;havoc thread2_#t~ret32#1; {6943#true} is VALID [2022-02-20 19:04:10,628 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6943#true} {6943#true} #442#return; {6943#true} is VALID [2022-02-20 19:04:10,628 INFO L290 TraceCheckUtils]: 70: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,628 INFO L290 TraceCheckUtils]: 69: Hoare triple {6943#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; {6943#true} is VALID [2022-02-20 19:04:10,628 INFO L290 TraceCheckUtils]: 68: Hoare triple {6943#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem10 := read~int(~lock.base, ~lock.offset, 1); {6943#true} is VALID [2022-02-20 19:04:10,628 INFO L272 TraceCheckUtils]: 67: Hoare triple {6943#true} call thread2_#t~ret32#1 := __CS_pthread_mutex_unlock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {6943#true} is VALID [2022-02-20 19:04:10,628 INFO L290 TraceCheckUtils]: 66: Hoare triple {6943#true} assume !(0 != ~__CS_ret~0 % 256); {6943#true} is VALID [2022-02-20 19:04:10,628 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {6943#true} {6943#true} #440#return; {6943#true} is VALID [2022-02-20 19:04:10,628 INFO L290 TraceCheckUtils]: 64: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,628 INFO L290 TraceCheckUtils]: 63: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:10,628 INFO L290 TraceCheckUtils]: 62: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:10,629 INFO L290 TraceCheckUtils]: 61: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:10,629 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:10,629 INFO L290 TraceCheckUtils]: 59: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,629 INFO L290 TraceCheckUtils]: 58: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,629 INFO L290 TraceCheckUtils]: 57: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,629 INFO L272 TraceCheckUtils]: 56: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,629 INFO L290 TraceCheckUtils]: 55: Hoare triple {6943#true} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:10,629 INFO L272 TraceCheckUtils]: 54: Hoare triple {6943#true} call __CS_cs(); {6943#true} is VALID [2022-02-20 19:04:10,630 INFO L290 TraceCheckUtils]: 53: Hoare triple {6943#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; {6943#true} is VALID [2022-02-20 19:04:10,630 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6943#true} {6943#true} #438#return; {6943#true} is VALID [2022-02-20 19:04:10,630 INFO L290 TraceCheckUtils]: 51: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,630 INFO L290 TraceCheckUtils]: 50: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:10,630 INFO L290 TraceCheckUtils]: 49: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:10,630 INFO L290 TraceCheckUtils]: 48: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:10,630 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:10,630 INFO L290 TraceCheckUtils]: 46: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,630 INFO L290 TraceCheckUtils]: 45: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,631 INFO L272 TraceCheckUtils]: 43: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {6943#true} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:10,631 INFO L272 TraceCheckUtils]: 41: Hoare triple {6943#true} call __CS_cs(); {6943#true} is VALID [2022-02-20 19:04:10,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {6943#true} assume -2147483648 <= thread2_#t~ret30#1 && thread2_#t~ret30#1 <= 2147483647;havoc thread2_#t~ret30#1; {6943#true} is VALID [2022-02-20 19:04:10,631 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6943#true} {6943#true} #436#return; {6943#true} is VALID [2022-02-20 19:04:10,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {6943#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {6943#true} is VALID [2022-02-20 19:04:10,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {6943#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {6943#true} is VALID [2022-02-20 19:04:10,632 INFO L272 TraceCheckUtils]: 35: Hoare triple {6943#true} call thread2_#t~ret30#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {6943#true} is VALID [2022-02-20 19:04:10,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {6943#true} assume !(0 != ~__CS_ret~0 % 256); {6943#true} is VALID [2022-02-20 19:04:10,632 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6943#true} {6943#true} #434#return; {6943#true} is VALID [2022-02-20 19:04:10,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {6943#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {6943#true} is VALID [2022-02-20 19:04:10,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {6943#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {6943#true} is VALID [2022-02-20 19:04:10,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {6943#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {6943#true} is VALID [2022-02-20 19:04:10,633 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6943#true} {6943#true} #504#return; {6943#true} is VALID [2022-02-20 19:04:10,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {6943#true} assume true; {6943#true} is VALID [2022-02-20 19:04:10,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {6943#true} assume !(0 == ~cond); {6943#true} is VALID [2022-02-20 19:04:10,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {6943#true} ~cond := #in~cond; {6943#true} is VALID [2022-02-20 19:04:10,633 INFO L272 TraceCheckUtils]: 24: Hoare triple {6943#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {6943#true} is VALID [2022-02-20 19:04:10,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {6943#true} ~k~0 := #t~nondet3;havoc #t~nondet3; {6943#true} is VALID [2022-02-20 19:04:10,633 INFO L272 TraceCheckUtils]: 22: Hoare triple {6943#true} call __CS_cs(); {6943#true} is VALID [2022-02-20 19:04:10,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {6943#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 := #~77#1.base, #~77#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; {6943#true} is VALID [2022-02-20 19:04:10,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {6943#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {6943#true} is VALID [2022-02-20 19:04:10,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {6943#true} #~77#1.base, #~77#1.offset := #in~77#1.base, #in~77#1.offset; {6943#true} is VALID [2022-02-20 19:04:10,634 INFO L272 TraceCheckUtils]: 18: Hoare triple {6944#false} call main_#t~ret78#1.base, main_#t~ret78#1.offset := ##fun~$Pointer$~TO~$Pointer$(0, 0, ~__CS_thread~0.base[2], ~__CS_thread~0.offset[2]); {6943#true} is VALID [2022-02-20 19:04:10,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {6944#false} assume 1 == main_#t~mem75#1 % 256;havoc main_#t~mem75#1;call main_#t~mem76#1 := read~int(~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_round~0 := main_#t~mem76#1;havoc main_#t~mem76#1;~__CS_ret~0 := 0; {6944#false} is VALID [2022-02-20 19:04:10,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {6944#false} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {6944#false} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {6944#false} is VALID [2022-02-20 19:04:10,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {6944#false} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {6944#false} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {6944#false} is VALID [2022-02-20 19:04:10,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {6944#false} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {6944#false} is VALID [2022-02-20 19:04:10,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {6946#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 2); {6944#false} is VALID [2022-02-20 19:04:10,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {6946#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 19:04:10,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~2#1 < 3); {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {6943#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {7136#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:10,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {6943#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {6943#true} is VALID [2022-02-20 19:04:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-02-20 19:04:10,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183540757] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:04:10,640 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:04:10,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-02-20 19:04:10,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354643137] [2022-02-20 19:04:10,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:04:10,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 155 [2022-02-20 19:04:13,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:04:13,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-02-20 19:04:13,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:13,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:04:13,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:04:13,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:04:13,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:04:13,367 INFO L87 Difference]: Start difference. First operand 312 states and 485 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-02-20 19:04:19,506 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:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:21,229 INFO L93 Difference]: Finished difference Result 631 states and 988 transitions. [2022-02-20 19:04:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 19:04:21,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 155 [2022-02-20 19:04:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:04:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-02-20 19:04:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 534 transitions. [2022-02-20 19:04:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-02-20 19:04:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 534 transitions. [2022-02-20 19:04:21,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 534 transitions. [2022-02-20 19:04:21,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 534 edges. 534 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:21,753 INFO L225 Difference]: With dead ends: 631 [2022-02-20 19:04:21,753 INFO L226 Difference]: Without dead ends: 331 [2022-02-20 19:04:21,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 346 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:21,755 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 56 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 118 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:04:21,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 677 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 436 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-02-20 19:04:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-02-20 19:04:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2022-02-20 19:04:21,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:04:21,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 325 states, 209 states have (on average 1.4114832535885167) internal successors, (295), 211 states have internal predecessors, (295), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2022-02-20 19:04:21,794 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 325 states, 209 states have (on average 1.4114832535885167) internal successors, (295), 211 states have internal predecessors, (295), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2022-02-20 19:04:21,794 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 325 states, 209 states have (on average 1.4114832535885167) internal successors, (295), 211 states have internal predecessors, (295), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2022-02-20 19:04:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:21,804 INFO L93 Difference]: Finished difference Result 331 states and 516 transitions. [2022-02-20 19:04:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 516 transitions. [2022-02-20 19:04:21,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:21,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:21,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 209 states have (on average 1.4114832535885167) internal successors, (295), 211 states have internal predecessors, (295), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) Second operand 331 states. [2022-02-20 19:04:21,808 INFO L87 Difference]: Start difference. First operand has 325 states, 209 states have (on average 1.4114832535885167) internal successors, (295), 211 states have internal predecessors, (295), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) Second operand 331 states. [2022-02-20 19:04:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:21,818 INFO L93 Difference]: Finished difference Result 331 states and 516 transitions. [2022-02-20 19:04:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 516 transitions. [2022-02-20 19:04:21,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:21,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:21,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:04:21,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:04:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 209 states have (on average 1.4114832535885167) internal successors, (295), 211 states have internal predecessors, (295), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2022-02-20 19:04:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 503 transitions. [2022-02-20 19:04:21,831 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 503 transitions. Word has length 155 [2022-02-20 19:04:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:04:21,832 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 503 transitions. [2022-02-20 19:04:21,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-02-20 19:04:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 503 transitions. [2022-02-20 19:04:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-02-20 19:04:21,835 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:04:21,835 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:04:21,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 19:04:22,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:04:22,052 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:04:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:04:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1367546533, now seen corresponding path program 2 times [2022-02-20 19:04:22,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:04:22,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518989341] [2022-02-20 19:04:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:04:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:04:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 19:04:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:04:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10059#true} is VALID [2022-02-20 19:04:22,542 INFO L272 TraceCheckUtils]: 1: Hoare triple {10059#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,542 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {10059#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10059#true} is VALID [2022-02-20 19:04:22,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {10059#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10059#true} is VALID [2022-02-20 19:04:22,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {10059#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10059#true} is VALID [2022-02-20 19:04:22,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #434#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 19:04:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {10232#(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); {10059#true} is VALID [2022-02-20 19:04:22,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {10059#true} is VALID [2022-02-20 19:04:22,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #436#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 19:04:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:04:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10059#true} is VALID [2022-02-20 19:04:22,569 INFO L272 TraceCheckUtils]: 1: Hoare triple {10059#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,570 INFO L290 TraceCheckUtils]: 4: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,570 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {10059#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10059#true} is VALID [2022-02-20 19:04:22,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {10059#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10059#true} is VALID [2022-02-20 19:04:22,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {10059#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10059#true} is VALID [2022-02-20 19:04:22,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,570 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #438#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 19:04:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:04:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10059#true} is VALID [2022-02-20 19:04:22,579 INFO L272 TraceCheckUtils]: 1: Hoare triple {10059#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,579 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {10059#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10059#true} is VALID [2022-02-20 19:04:22,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {10059#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10059#true} is VALID [2022-02-20 19:04:22,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {10059#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10059#true} is VALID [2022-02-20 19:04:22,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #440#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:04:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {10241#(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); {10059#true} is VALID [2022-02-20 19:04:22,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#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; {10059#true} is VALID [2022-02-20 19:04:22,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #442#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:04:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:04:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10059#true} is VALID [2022-02-20 19:04:22,606 INFO L272 TraceCheckUtils]: 1: Hoare triple {10059#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,606 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {10059#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10059#true} is VALID [2022-02-20 19:04:22,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {10059#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10059#true} is VALID [2022-02-20 19:04:22,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {10059#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10059#true} is VALID [2022-02-20 19:04:22,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #444#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {10173#(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)|))} #~77#1.base, #~77#1.offset := #in~77#1.base, #in~77#1.offset; {10059#true} is VALID [2022-02-20 19:04:22,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {10059#true} is VALID [2022-02-20 19:04:22,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#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 := #~77#1.base, #~77#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; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,608 INFO L272 TraceCheckUtils]: 3: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:22,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10059#true} is VALID [2022-02-20 19:04:22,609 INFO L272 TraceCheckUtils]: 5: Hoare triple {10059#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,609 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {10059#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10059#true} is VALID [2022-02-20 19:04:22,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {10059#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10059#true} is VALID [2022-02-20 19:04:22,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {10059#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10059#true} is VALID [2022-02-20 19:04:22,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,610 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #434#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume !(0 != ~__CS_ret~0 % 256); {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,611 INFO L272 TraceCheckUtils]: 16: Hoare triple {10174#(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); {10232#(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:22,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {10232#(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); {10059#true} is VALID [2022-02-20 19:04:22,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {10059#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {10059#true} is VALID [2022-02-20 19:04:22,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,612 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #436#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {10174#(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; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,613 INFO L272 TraceCheckUtils]: 22: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:22,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10059#true} is VALID [2022-02-20 19:04:22,613 INFO L272 TraceCheckUtils]: 24: Hoare triple {10059#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,613 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {10059#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10059#true} is VALID [2022-02-20 19:04:22,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {10059#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10059#true} is VALID [2022-02-20 19:04:22,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {10059#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10059#true} is VALID [2022-02-20 19:04:22,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,614 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #438#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {10174#(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; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,615 INFO L272 TraceCheckUtils]: 35: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:22,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10059#true} is VALID [2022-02-20 19:04:22,615 INFO L272 TraceCheckUtils]: 37: Hoare triple {10059#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,615 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {10059#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10059#true} is VALID [2022-02-20 19:04:22,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {10059#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10059#true} is VALID [2022-02-20 19:04:22,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {10059#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10059#true} is VALID [2022-02-20 19:04:22,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,616 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #440#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume !(0 != ~__CS_ret~0 % 256); {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,617 INFO L272 TraceCheckUtils]: 48: Hoare triple {10174#(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); {10241#(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:22,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {10241#(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); {10059#true} is VALID [2022-02-20 19:04:22,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {10059#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; {10059#true} is VALID [2022-02-20 19:04:22,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,618 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #442#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {10174#(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; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,619 INFO L272 TraceCheckUtils]: 54: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:22,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10059#true} is VALID [2022-02-20 19:04:22,619 INFO L272 TraceCheckUtils]: 56: Hoare triple {10059#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,620 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {10059#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10059#true} is VALID [2022-02-20 19:04:22,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {10059#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10059#true} is VALID [2022-02-20 19:04:22,620 INFO L290 TraceCheckUtils]: 63: Hoare triple {10059#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10059#true} is VALID [2022-02-20 19:04:22,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,620 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #444#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,621 INFO L290 TraceCheckUtils]: 66: Hoare triple {10174#(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; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,621 INFO L290 TraceCheckUtils]: 67: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #t~ret108#1.base, #t~ret108#1.offset := thread2_#res#1.base, thread2_#res#1.offset;assume { :end_inline_thread2 } true;#t~funptrres106#1.base, #t~funptrres106#1.offset := #t~ret108#1.base, #t~ret108#1.offset; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,621 INFO L290 TraceCheckUtils]: 68: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #res#1.base, #res#1.offset := #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset;havoc #t~ret108#1.base, #t~ret108#1.offset;havoc #t~ret109#1.base, #t~ret109#1.offset; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume true; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,622 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} {10061#(= (select ~__CS_thread~0.offset 2) 0)} #482#return; {10060#false} is VALID [2022-02-20 19:04:22,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-02-20 19:04:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10060#false} #484#return; {10060#false} is VALID [2022-02-20 19:04:22,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-02-20 19:04:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10060#false} #486#return; {10060#false} is VALID [2022-02-20 19:04:22,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-02-20 19:04:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10060#false} #488#return; {10060#false} is VALID [2022-02-20 19:04:22,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-02-20 19:04:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10060#false} #490#return; {10060#false} is VALID [2022-02-20 19:04:22,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-02-20 19:04:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10060#false} #492#return; {10060#false} is VALID [2022-02-20 19:04:22,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-02-20 19:04:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10060#false} #494#return; {10060#false} is VALID [2022-02-20 19:04:22,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-02-20 19:04:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10060#false} #496#return; {10060#false} is VALID [2022-02-20 19:04:22,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-02-20 19:04:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10060#false} #498#return; {10060#false} is VALID [2022-02-20 19:04:22,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-02-20 19:04:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10060#false} #500#return; {10060#false} is VALID [2022-02-20 19:04:22,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-02-20 19:04:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:22,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10059#true} {10060#false} #502#return; {10060#false} is VALID [2022-02-20 19:04:22,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {10061#(= (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~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !(main_~j~2#1 < 3); {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !(main_~j~2#1 < 3); {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !(main_~i~0#1 < 2); {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} assume 1 == main_#t~mem75#1 % 256;havoc main_#t~mem75#1;call main_#t~mem76#1 := read~int(~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_round~0 := main_#t~mem76#1;havoc main_#t~mem76#1;~__CS_ret~0 := 0; {10061#(= (select ~__CS_thread~0.offset 2) 0)} is VALID [2022-02-20 19:04:22,669 INFO L272 TraceCheckUtils]: 27: Hoare triple {10061#(= (select ~__CS_thread~0.offset 2) 0)} call main_#t~ret78#1.base, main_#t~ret78#1.offset := ##fun~$Pointer$~TO~$Pointer$(0, 0, ~__CS_thread~0.base[2], ~__CS_thread~0.offset[2]); {10173#(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:22,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {10173#(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)|))} #~77#1.base, #~77#1.offset := #in~77#1.base, #in~77#1.offset; {10059#true} is VALID [2022-02-20 19:04:22,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {10059#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {10059#true} is VALID [2022-02-20 19:04:22,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {10059#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 := #~77#1.base, #~77#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; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,670 INFO L272 TraceCheckUtils]: 31: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:22,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10059#true} is VALID [2022-02-20 19:04:22,671 INFO L272 TraceCheckUtils]: 33: Hoare triple {10059#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,671 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {10059#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10059#true} is VALID [2022-02-20 19:04:22,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {10059#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10059#true} is VALID [2022-02-20 19:04:22,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {10059#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10059#true} is VALID [2022-02-20 19:04:22,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,672 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #434#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume !(0 != ~__CS_ret~0 % 256); {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,673 INFO L272 TraceCheckUtils]: 44: Hoare triple {10174#(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); {10232#(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:22,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {10232#(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); {10059#true} is VALID [2022-02-20 19:04:22,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {10059#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {10059#true} is VALID [2022-02-20 19:04:22,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,674 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #436#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {10174#(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; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,675 INFO L272 TraceCheckUtils]: 50: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:22,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10059#true} is VALID [2022-02-20 19:04:22,675 INFO L272 TraceCheckUtils]: 52: Hoare triple {10059#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,675 INFO L290 TraceCheckUtils]: 54: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,675 INFO L290 TraceCheckUtils]: 55: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,675 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,675 INFO L290 TraceCheckUtils]: 57: Hoare triple {10059#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10059#true} is VALID [2022-02-20 19:04:22,675 INFO L290 TraceCheckUtils]: 58: Hoare triple {10059#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10059#true} is VALID [2022-02-20 19:04:22,676 INFO L290 TraceCheckUtils]: 59: Hoare triple {10059#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10059#true} is VALID [2022-02-20 19:04:22,676 INFO L290 TraceCheckUtils]: 60: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,676 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #438#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,676 INFO L290 TraceCheckUtils]: 62: Hoare triple {10174#(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; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,677 INFO L272 TraceCheckUtils]: 63: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:22,677 INFO L290 TraceCheckUtils]: 64: Hoare triple {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10059#true} is VALID [2022-02-20 19:04:22,677 INFO L272 TraceCheckUtils]: 65: Hoare triple {10059#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,677 INFO L290 TraceCheckUtils]: 66: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,677 INFO L290 TraceCheckUtils]: 67: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,677 INFO L290 TraceCheckUtils]: 68: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,677 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,678 INFO L290 TraceCheckUtils]: 70: Hoare triple {10059#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10059#true} is VALID [2022-02-20 19:04:22,678 INFO L290 TraceCheckUtils]: 71: Hoare triple {10059#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10059#true} is VALID [2022-02-20 19:04:22,678 INFO L290 TraceCheckUtils]: 72: Hoare triple {10059#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10059#true} is VALID [2022-02-20 19:04:22,678 INFO L290 TraceCheckUtils]: 73: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,678 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #440#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,678 INFO L290 TraceCheckUtils]: 75: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume !(0 != ~__CS_ret~0 % 256); {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,679 INFO L272 TraceCheckUtils]: 76: Hoare triple {10174#(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); {10241#(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:22,679 INFO L290 TraceCheckUtils]: 77: Hoare triple {10241#(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); {10059#true} is VALID [2022-02-20 19:04:22,680 INFO L290 TraceCheckUtils]: 78: Hoare triple {10059#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; {10059#true} is VALID [2022-02-20 19:04:22,680 INFO L290 TraceCheckUtils]: 79: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,680 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #442#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,680 INFO L290 TraceCheckUtils]: 81: Hoare triple {10174#(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; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,681 INFO L272 TraceCheckUtils]: 82: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} call __CS_cs(); {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:22,681 INFO L290 TraceCheckUtils]: 83: Hoare triple {10227#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {10059#true} is VALID [2022-02-20 19:04:22,681 INFO L272 TraceCheckUtils]: 84: Hoare triple {10059#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,681 INFO L290 TraceCheckUtils]: 85: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,681 INFO L290 TraceCheckUtils]: 86: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,682 INFO L290 TraceCheckUtils]: 87: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,682 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10059#true} {10059#true} #504#return; {10059#true} is VALID [2022-02-20 19:04:22,682 INFO L290 TraceCheckUtils]: 89: Hoare triple {10059#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {10059#true} is VALID [2022-02-20 19:04:22,682 INFO L290 TraceCheckUtils]: 90: Hoare triple {10059#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {10059#true} is VALID [2022-02-20 19:04:22,682 INFO L290 TraceCheckUtils]: 91: Hoare triple {10059#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {10059#true} is VALID [2022-02-20 19:04:22,682 INFO L290 TraceCheckUtils]: 92: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,682 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {10059#true} {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #444#return; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,683 INFO L290 TraceCheckUtils]: 94: Hoare triple {10174#(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; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,683 INFO L290 TraceCheckUtils]: 95: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #t~ret108#1.base, #t~ret108#1.offset := thread2_#res#1.base, thread2_#res#1.offset;assume { :end_inline_thread2 } true;#t~funptrres106#1.base, #t~funptrres106#1.offset := #t~ret108#1.base, #t~ret108#1.offset; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,683 INFO L290 TraceCheckUtils]: 96: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} #res#1.base, #res#1.offset := #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset;havoc #t~ret108#1.base, #t~ret108#1.offset;havoc #t~ret109#1.base, #t~ret109#1.offset; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,684 INFO L290 TraceCheckUtils]: 97: Hoare triple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} assume true; {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} is VALID [2022-02-20 19:04:22,684 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10174#(not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))} {10061#(= (select ~__CS_thread~0.offset 2) 0)} #482#return; {10060#false} is VALID [2022-02-20 19:04:22,684 INFO L290 TraceCheckUtils]: 99: Hoare triple {10060#false} havoc main_#t~ret78#1.base, main_#t~ret78#1.offset; {10060#false} is VALID [2022-02-20 19:04:22,685 INFO L290 TraceCheckUtils]: 100: Hoare triple {10060#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); {10060#false} is VALID [2022-02-20 19:04:22,685 INFO L290 TraceCheckUtils]: 101: Hoare triple {10060#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {10060#false} is VALID [2022-02-20 19:04:22,685 INFO L272 TraceCheckUtils]: 102: Hoare triple {10060#false} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,685 INFO L290 TraceCheckUtils]: 103: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,685 INFO L290 TraceCheckUtils]: 104: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,685 INFO L290 TraceCheckUtils]: 105: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,685 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10059#true} {10060#false} #484#return; {10060#false} is VALID [2022-02-20 19:04:22,685 INFO L290 TraceCheckUtils]: 107: Hoare triple {10060#false} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {10060#false} is VALID [2022-02-20 19:04:22,685 INFO L272 TraceCheckUtils]: 108: Hoare triple {10060#false} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,686 INFO L290 TraceCheckUtils]: 109: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,686 INFO L290 TraceCheckUtils]: 110: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,686 INFO L290 TraceCheckUtils]: 111: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,686 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {10059#true} {10060#false} #486#return; {10060#false} is VALID [2022-02-20 19:04:22,686 INFO L290 TraceCheckUtils]: 113: Hoare triple {10060#false} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {10060#false} is VALID [2022-02-20 19:04:22,686 INFO L272 TraceCheckUtils]: 114: Hoare triple {10060#false} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,686 INFO L290 TraceCheckUtils]: 115: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,686 INFO L290 TraceCheckUtils]: 116: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,687 INFO L290 TraceCheckUtils]: 117: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,687 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {10059#true} {10060#false} #488#return; {10060#false} is VALID [2022-02-20 19:04:22,687 INFO L290 TraceCheckUtils]: 119: Hoare triple {10060#false} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {10060#false} is VALID [2022-02-20 19:04:22,687 INFO L272 TraceCheckUtils]: 120: Hoare triple {10060#false} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,687 INFO L290 TraceCheckUtils]: 121: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,687 INFO L290 TraceCheckUtils]: 122: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,687 INFO L290 TraceCheckUtils]: 123: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,687 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10059#true} {10060#false} #490#return; {10060#false} is VALID [2022-02-20 19:04:22,687 INFO L290 TraceCheckUtils]: 125: Hoare triple {10060#false} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {10060#false} is VALID [2022-02-20 19:04:22,688 INFO L272 TraceCheckUtils]: 126: Hoare triple {10060#false} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,688 INFO L290 TraceCheckUtils]: 127: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,688 INFO L290 TraceCheckUtils]: 128: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,688 INFO L290 TraceCheckUtils]: 129: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,688 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {10059#true} {10060#false} #492#return; {10060#false} is VALID [2022-02-20 19:04:22,688 INFO L290 TraceCheckUtils]: 131: Hoare triple {10060#false} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {10060#false} is VALID [2022-02-20 19:04:22,688 INFO L272 TraceCheckUtils]: 132: Hoare triple {10060#false} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,688 INFO L290 TraceCheckUtils]: 133: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,688 INFO L290 TraceCheckUtils]: 134: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,689 INFO L290 TraceCheckUtils]: 135: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,689 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {10059#true} {10060#false} #494#return; {10060#false} is VALID [2022-02-20 19:04:22,689 INFO L290 TraceCheckUtils]: 137: Hoare triple {10060#false} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {10060#false} is VALID [2022-02-20 19:04:22,689 INFO L272 TraceCheckUtils]: 138: Hoare triple {10060#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,689 INFO L290 TraceCheckUtils]: 139: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,689 INFO L290 TraceCheckUtils]: 140: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,689 INFO L290 TraceCheckUtils]: 141: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,689 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {10059#true} {10060#false} #496#return; {10060#false} is VALID [2022-02-20 19:04:22,689 INFO L290 TraceCheckUtils]: 143: Hoare triple {10060#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {10060#false} is VALID [2022-02-20 19:04:22,690 INFO L272 TraceCheckUtils]: 144: Hoare triple {10060#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,690 INFO L290 TraceCheckUtils]: 145: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,690 INFO L290 TraceCheckUtils]: 146: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,690 INFO L290 TraceCheckUtils]: 147: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,690 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {10059#true} {10060#false} #498#return; {10060#false} is VALID [2022-02-20 19:04:22,690 INFO L290 TraceCheckUtils]: 149: Hoare triple {10060#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {10060#false} is VALID [2022-02-20 19:04:22,690 INFO L272 TraceCheckUtils]: 150: Hoare triple {10060#false} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,690 INFO L290 TraceCheckUtils]: 151: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,690 INFO L290 TraceCheckUtils]: 152: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,691 INFO L290 TraceCheckUtils]: 153: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,691 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {10059#true} {10060#false} #500#return; {10060#false} is VALID [2022-02-20 19:04:22,691 INFO L290 TraceCheckUtils]: 155: Hoare triple {10060#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {10060#false} is VALID [2022-02-20 19:04:22,691 INFO L272 TraceCheckUtils]: 156: Hoare triple {10060#false} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {10059#true} is VALID [2022-02-20 19:04:22,691 INFO L290 TraceCheckUtils]: 157: Hoare triple {10059#true} ~cond := #in~cond; {10059#true} is VALID [2022-02-20 19:04:22,691 INFO L290 TraceCheckUtils]: 158: Hoare triple {10059#true} assume !(0 == ~cond); {10059#true} is VALID [2022-02-20 19:04:22,691 INFO L290 TraceCheckUtils]: 159: Hoare triple {10059#true} assume true; {10059#true} is VALID [2022-02-20 19:04:22,691 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {10059#true} {10060#false} #502#return; {10060#false} is VALID [2022-02-20 19:04:22,692 INFO L290 TraceCheckUtils]: 161: Hoare triple {10060#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {10060#false} is VALID [2022-02-20 19:04:22,692 INFO L290 TraceCheckUtils]: 162: Hoare triple {10060#false} assume 0 == __VERIFIER_assert_~cond#1; {10060#false} is VALID [2022-02-20 19:04:22,692 INFO L290 TraceCheckUtils]: 163: Hoare triple {10060#false} assume !false; {10060#false} is VALID [2022-02-20 19:04:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-02-20 19:04:22,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:04:22,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518989341] [2022-02-20 19:04:22,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518989341] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:04:22,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:04:22,693 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:04:22,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500046238] [2022-02-20 19:04:22,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:04:22,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 164 [2022-02-20 19:04:22,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:04:22,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-02-20 19:04:22,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:22,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:04:22,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:04:22,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:04:22,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:04:22,769 INFO L87 Difference]: Start difference. First operand 325 states and 503 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-02-20 19:04:24,844 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:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:28,007 INFO L93 Difference]: Finished difference Result 680 states and 1072 transitions. [2022-02-20 19:04:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:04:28,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 164 [2022-02-20 19:04:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:04:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-02-20 19:04:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 588 transitions. [2022-02-20 19:04:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-02-20 19:04:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 588 transitions. [2022-02-20 19:04:28,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 588 transitions. [2022-02-20 19:04:28,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:28,621 INFO L225 Difference]: With dead ends: 680 [2022-02-20 19:04:28,621 INFO L226 Difference]: Without dead ends: 650 [2022-02-20 19:04:28,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 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:28,623 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 419 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 485 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:04:28,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 839 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 590 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-02-20 19:04:28,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-02-20 19:04:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 631. [2022-02-20 19:04:28,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:04:28,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 650 states. Second operand has 631 states, 398 states have (on average 1.4221105527638191) internal successors, (566), 405 states have internal predecessors, (566), 193 states have call successors, (193), 32 states have call predecessors, (193), 39 states have return successors, (237), 193 states have call predecessors, (237), 193 states have call successors, (237) [2022-02-20 19:04:28,653 INFO L74 IsIncluded]: Start isIncluded. First operand 650 states. Second operand has 631 states, 398 states have (on average 1.4221105527638191) internal successors, (566), 405 states have internal predecessors, (566), 193 states have call successors, (193), 32 states have call predecessors, (193), 39 states have return successors, (237), 193 states have call predecessors, (237), 193 states have call successors, (237) [2022-02-20 19:04:28,654 INFO L87 Difference]: Start difference. First operand 650 states. Second operand has 631 states, 398 states have (on average 1.4221105527638191) internal successors, (566), 405 states have internal predecessors, (566), 193 states have call successors, (193), 32 states have call predecessors, (193), 39 states have return successors, (237), 193 states have call predecessors, (237), 193 states have call successors, (237) [2022-02-20 19:04:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:28,676 INFO L93 Difference]: Finished difference Result 650 states and 1029 transitions. [2022-02-20 19:04:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1029 transitions. [2022-02-20 19:04:28,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:28,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:28,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 631 states, 398 states have (on average 1.4221105527638191) internal successors, (566), 405 states have internal predecessors, (566), 193 states have call successors, (193), 32 states have call predecessors, (193), 39 states have return successors, (237), 193 states have call predecessors, (237), 193 states have call successors, (237) Second operand 650 states. [2022-02-20 19:04:28,684 INFO L87 Difference]: Start difference. First operand has 631 states, 398 states have (on average 1.4221105527638191) internal successors, (566), 405 states have internal predecessors, (566), 193 states have call successors, (193), 32 states have call predecessors, (193), 39 states have return successors, (237), 193 states have call predecessors, (237), 193 states have call successors, (237) Second operand 650 states. [2022-02-20 19:04:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:28,707 INFO L93 Difference]: Finished difference Result 650 states and 1029 transitions. [2022-02-20 19:04:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1029 transitions. [2022-02-20 19:04:28,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:28,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:28,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:04:28,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:04:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 398 states have (on average 1.4221105527638191) internal successors, (566), 405 states have internal predecessors, (566), 193 states have call successors, (193), 32 states have call predecessors, (193), 39 states have return successors, (237), 193 states have call predecessors, (237), 193 states have call successors, (237) [2022-02-20 19:04:28,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 996 transitions. [2022-02-20 19:04:28,738 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 996 transitions. Word has length 164 [2022-02-20 19:04:28,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:04:28,738 INFO L470 AbstractCegarLoop]: Abstraction has 631 states and 996 transitions. [2022-02-20 19:04:28,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2022-02-20 19:04:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 996 transitions. [2022-02-20 19:04:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-02-20 19:04:28,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:04:28,742 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:04:28,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:04:28,742 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:04:28,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:04:28,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1817944839, now seen corresponding path program 1 times [2022-02-20 19:04:28,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:04:28,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436483335] [2022-02-20 19:04:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:28,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:04:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:36,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:04:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:36,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 19:04:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:04:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:37,013 INFO L272 TraceCheckUtils]: 1: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,013 INFO L290 TraceCheckUtils]: 3: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,014 INFO L290 TraceCheckUtils]: 4: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,014 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:37,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13564#(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:37,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {13564#(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; {13565#(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:37,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {13565#(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; {13565#(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:37,016 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13565#(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))))} {13389#true} #456#return; {13515#(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:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 19:04:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {13566#(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); {13389#true} is VALID [2022-02-20 19:04:37,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {13389#true} is VALID [2022-02-20 19:04:37,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13516#(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))))} #458#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 19:04:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:04:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:37,048 INFO L272 TraceCheckUtils]: 1: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,048 INFO L290 TraceCheckUtils]: 3: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,049 INFO L290 TraceCheckUtils]: 4: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,049 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:37,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13389#true} is VALID [2022-02-20 19:04:37,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {13389#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {13389#true} is VALID [2022-02-20 19:04:37,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,050 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13389#true} {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #460#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 19:04:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:04:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:37,060 INFO L272 TraceCheckUtils]: 1: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,060 INFO L290 TraceCheckUtils]: 3: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,060 INFO L290 TraceCheckUtils]: 4: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,060 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:37,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13389#true} is VALID [2022-02-20 19:04:37,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {13389#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {13389#true} is VALID [2022-02-20 19:04:37,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13389#true} {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #462#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:04:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {13575#(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); {13389#true} is VALID [2022-02-20 19:04:37,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#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; {13389#true} is VALID [2022-02-20 19:04:37,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #464#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:04:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:04:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:37,093 INFO L272 TraceCheckUtils]: 1: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,093 INFO L290 TraceCheckUtils]: 4: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,094 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:37,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13389#true} is VALID [2022-02-20 19:04:37,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {13389#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {13389#true} is VALID [2022-02-20 19:04:37,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,095 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13389#true} {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #466#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {13503#(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)|))} #~77#1.base, #~77#1.offset := #in~77#1.base, #in~77#1.offset; {13389#true} is VALID [2022-02-20 19:04:37,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {13389#true} is VALID [2022-02-20 19:04:37,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#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 := #~77#1.base, #~77#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; {13389#true} is VALID [2022-02-20 19:04:37,096 INFO L272 TraceCheckUtils]: 3: Hoare triple {13389#true} call __CS_cs(); {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:37,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:37,096 INFO L272 TraceCheckUtils]: 5: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,097 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:37,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13564#(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:37,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {13564#(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; {13565#(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:37,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {13565#(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; {13565#(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:37,099 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {13565#(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))))} {13389#true} #456#return; {13515#(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:37,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {13515#(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); {13516#(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:37,101 INFO L272 TraceCheckUtils]: 16: Hoare triple {13516#(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); {13566#(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:37,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {13566#(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); {13389#true} is VALID [2022-02-20 19:04:37,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {13389#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {13389#true} is VALID [2022-02-20 19:04:37,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,103 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13389#true} {13516#(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))))} #458#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {13521#(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; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,104 INFO L272 TraceCheckUtils]: 22: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call __CS_cs(); {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:37,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:37,104 INFO L272 TraceCheckUtils]: 24: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,105 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:37,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13389#true} is VALID [2022-02-20 19:04:37,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {13389#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {13389#true} is VALID [2022-02-20 19:04:37,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,106 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {13389#true} {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #460#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {13521#(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; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,107 INFO L272 TraceCheckUtils]: 35: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call __CS_cs(); {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:37,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:37,107 INFO L272 TraceCheckUtils]: 37: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,108 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:37,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13389#true} is VALID [2022-02-20 19:04:37,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {13389#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {13389#true} is VALID [2022-02-20 19:04:37,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,109 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13389#true} {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #462#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,109 INFO L290 TraceCheckUtils]: 47: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume !(0 != ~__CS_ret~0 % 256); {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,110 INFO L272 TraceCheckUtils]: 48: Hoare triple {13521#(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); {13575#(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:37,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {13575#(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); {13389#true} is VALID [2022-02-20 19:04:37,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {13389#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; {13389#true} is VALID [2022-02-20 19:04:37,111 INFO L290 TraceCheckUtils]: 51: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,112 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13389#true} {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #464#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {13521#(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; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,113 INFO L272 TraceCheckUtils]: 54: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call __CS_cs(); {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:37,113 INFO L290 TraceCheckUtils]: 55: Hoare triple {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:37,113 INFO L272 TraceCheckUtils]: 56: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,113 INFO L290 TraceCheckUtils]: 57: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,113 INFO L290 TraceCheckUtils]: 59: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,113 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:37,114 INFO L290 TraceCheckUtils]: 62: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13389#true} is VALID [2022-02-20 19:04:37,114 INFO L290 TraceCheckUtils]: 63: Hoare triple {13389#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {13389#true} is VALID [2022-02-20 19:04:37,114 INFO L290 TraceCheckUtils]: 64: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,114 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {13389#true} {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #466#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,115 INFO L290 TraceCheckUtils]: 66: Hoare triple {13521#(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; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,115 INFO L290 TraceCheckUtils]: 67: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #t~ret107#1.base, #t~ret107#1.offset := thread1_#res#1.base, thread1_#res#1.offset;assume { :end_inline_thread1 } true;#t~funptrres106#1.base, #t~funptrres106#1.offset := #t~ret107#1.base, #t~ret107#1.offset; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #res#1.base, #res#1.offset := #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset;havoc #t~ret108#1.base, #t~ret108#1.offset;havoc #t~ret109#1.base, #t~ret109#1.offset; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume true; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,117 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} #482#return; {13390#false} is VALID [2022-02-20 19:04:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-02-20 19:04:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13390#false} #484#return; {13390#false} is VALID [2022-02-20 19:04:37,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-02-20 19:04:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13390#false} #486#return; {13390#false} is VALID [2022-02-20 19:04:37,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-02-20 19:04:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13390#false} #488#return; {13390#false} is VALID [2022-02-20 19:04:37,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-02-20 19:04:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13390#false} #490#return; {13390#false} is VALID [2022-02-20 19:04:37,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-02-20 19:04:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13390#false} #492#return; {13390#false} is VALID [2022-02-20 19:04:37,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-02-20 19:04:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13390#false} #494#return; {13390#false} is VALID [2022-02-20 19:04:37,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-02-20 19:04:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13390#false} #496#return; {13390#false} is VALID [2022-02-20 19:04:37,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-02-20 19:04:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13390#false} #498#return; {13390#false} is VALID [2022-02-20 19:04:37,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-02-20 19:04:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13390#false} #500#return; {13390#false} is VALID [2022-02-20 19:04:37,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-02-20 19:04:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:37,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13389#true} {13390#false} #502#return; {13390#false} is VALID [2022-02-20 19:04:37,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !(main_~j~2#1 < 3); {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !(main_~j~2#1 < 3); {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !(main_~i~0#1 < 2); {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} assume 1 == main_#t~mem75#1 % 256;havoc main_#t~mem75#1;call main_#t~mem76#1 := read~int(~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_round~0 := main_#t~mem76#1;havoc main_#t~mem76#1;~__CS_ret~0 := 0; {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} is VALID [2022-02-20 19:04:37,172 INFO L272 TraceCheckUtils]: 27: Hoare triple {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} call main_#t~ret78#1.base, main_#t~ret78#1.offset := ##fun~$Pointer$~TO~$Pointer$(0, 0, ~__CS_thread~0.base[2], ~__CS_thread~0.offset[2]); {13503#(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:37,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {13503#(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)|))} #~77#1.base, #~77#1.offset := #in~77#1.base, #in~77#1.offset; {13389#true} is VALID [2022-02-20 19:04:37,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {13389#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {13389#true} is VALID [2022-02-20 19:04:37,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {13389#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 := #~77#1.base, #~77#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; {13389#true} is VALID [2022-02-20 19:04:37,173 INFO L272 TraceCheckUtils]: 31: Hoare triple {13389#true} call __CS_cs(); {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:37,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:37,174 INFO L272 TraceCheckUtils]: 33: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,174 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:37,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13564#(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:37,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {13564#(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; {13565#(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:37,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {13565#(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; {13565#(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:37,177 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13565#(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))))} {13389#true} #456#return; {13515#(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:37,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {13515#(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); {13516#(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:37,178 INFO L272 TraceCheckUtils]: 44: Hoare triple {13516#(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); {13566#(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:37,179 INFO L290 TraceCheckUtils]: 45: Hoare triple {13566#(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); {13389#true} is VALID [2022-02-20 19:04:37,179 INFO L290 TraceCheckUtils]: 46: Hoare triple {13389#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {13389#true} is VALID [2022-02-20 19:04:37,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,180 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13389#true} {13516#(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))))} #458#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {13521#(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; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,181 INFO L272 TraceCheckUtils]: 50: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call __CS_cs(); {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:37,181 INFO L290 TraceCheckUtils]: 51: Hoare triple {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:37,181 INFO L272 TraceCheckUtils]: 52: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,184 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,184 INFO L290 TraceCheckUtils]: 57: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:37,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13389#true} is VALID [2022-02-20 19:04:37,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {13389#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {13389#true} is VALID [2022-02-20 19:04:37,185 INFO L290 TraceCheckUtils]: 60: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,185 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {13389#true} {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #460#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,186 INFO L290 TraceCheckUtils]: 62: Hoare triple {13521#(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; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,186 INFO L272 TraceCheckUtils]: 63: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call __CS_cs(); {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:37,186 INFO L290 TraceCheckUtils]: 64: Hoare triple {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:37,187 INFO L272 TraceCheckUtils]: 65: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,187 INFO L290 TraceCheckUtils]: 66: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,187 INFO L290 TraceCheckUtils]: 67: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,187 INFO L290 TraceCheckUtils]: 68: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,187 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,187 INFO L290 TraceCheckUtils]: 70: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:37,187 INFO L290 TraceCheckUtils]: 71: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13389#true} is VALID [2022-02-20 19:04:37,188 INFO L290 TraceCheckUtils]: 72: Hoare triple {13389#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {13389#true} is VALID [2022-02-20 19:04:37,188 INFO L290 TraceCheckUtils]: 73: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,188 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13389#true} {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #462#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,189 INFO L290 TraceCheckUtils]: 75: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume !(0 != ~__CS_ret~0 % 256); {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,189 INFO L272 TraceCheckUtils]: 76: Hoare triple {13521#(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); {13575#(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:37,190 INFO L290 TraceCheckUtils]: 77: Hoare triple {13575#(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); {13389#true} is VALID [2022-02-20 19:04:37,190 INFO L290 TraceCheckUtils]: 78: Hoare triple {13389#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; {13389#true} is VALID [2022-02-20 19:04:37,190 INFO L290 TraceCheckUtils]: 79: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,191 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13389#true} {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #464#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,191 INFO L290 TraceCheckUtils]: 81: Hoare triple {13521#(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; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,192 INFO L272 TraceCheckUtils]: 82: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} call __CS_cs(); {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} is VALID [2022-02-20 19:04:37,192 INFO L290 TraceCheckUtils]: 83: Hoare triple {13559#(and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:37,192 INFO L272 TraceCheckUtils]: 84: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,192 INFO L290 TraceCheckUtils]: 85: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,192 INFO L290 TraceCheckUtils]: 86: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,192 INFO L290 TraceCheckUtils]: 87: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,192 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:37,193 INFO L290 TraceCheckUtils]: 89: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:37,193 INFO L290 TraceCheckUtils]: 90: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13389#true} is VALID [2022-02-20 19:04:37,193 INFO L290 TraceCheckUtils]: 91: Hoare triple {13389#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {13389#true} is VALID [2022-02-20 19:04:37,193 INFO L290 TraceCheckUtils]: 92: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,193 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {13389#true} {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #466#return; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,194 INFO L290 TraceCheckUtils]: 94: Hoare triple {13521#(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; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,194 INFO L290 TraceCheckUtils]: 95: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #t~ret107#1.base, #t~ret107#1.offset := thread1_#res#1.base, thread1_#res#1.offset;assume { :end_inline_thread1 } true;#t~funptrres106#1.base, #t~funptrres106#1.offset := #t~ret107#1.base, #t~ret107#1.offset; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,195 INFO L290 TraceCheckUtils]: 96: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} #res#1.base, #res#1.offset := #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~funptrres106#1.base, #t~funptrres106#1.offset;havoc #t~ret107#1.base, #t~ret107#1.offset;havoc #t~ret108#1.base, #t~ret108#1.offset;havoc #t~ret109#1.base, #t~ret109#1.offset; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,195 INFO L290 TraceCheckUtils]: 97: Hoare triple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} assume true; {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} is VALID [2022-02-20 19:04:37,196 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13521#(or (<= 256 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 0))} {13391#(= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0)} #482#return; {13390#false} is VALID [2022-02-20 19:04:37,196 INFO L290 TraceCheckUtils]: 99: Hoare triple {13390#false} havoc main_#t~ret78#1.base, main_#t~ret78#1.offset; {13390#false} is VALID [2022-02-20 19:04:37,196 INFO L290 TraceCheckUtils]: 100: Hoare triple {13390#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); {13390#false} is VALID [2022-02-20 19:04:37,197 INFO L290 TraceCheckUtils]: 101: Hoare triple {13390#false} call main_#t~mem79#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem80#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {13390#false} is VALID [2022-02-20 19:04:37,197 INFO L272 TraceCheckUtils]: 102: Hoare triple {13390#false} call assume_abort_if_not((if main_#t~mem79#1 % 256 == main_#t~mem80#1 % 256 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,197 INFO L290 TraceCheckUtils]: 103: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,197 INFO L290 TraceCheckUtils]: 104: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,197 INFO L290 TraceCheckUtils]: 105: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,197 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13389#true} {13390#false} #484#return; {13390#false} is VALID [2022-02-20 19:04:37,197 INFO L290 TraceCheckUtils]: 107: Hoare triple {13390#false} havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem82#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {13390#false} is VALID [2022-02-20 19:04:37,198 INFO L272 TraceCheckUtils]: 108: Hoare triple {13390#false} call assume_abort_if_not((if main_#t~mem81#1 % 256 == main_#t~mem82#1 % 256 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,198 INFO L290 TraceCheckUtils]: 109: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,198 INFO L290 TraceCheckUtils]: 110: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,198 INFO L290 TraceCheckUtils]: 111: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,198 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {13389#true} {13390#false} #486#return; {13390#false} is VALID [2022-02-20 19:04:37,198 INFO L290 TraceCheckUtils]: 113: Hoare triple {13390#false} havoc main_#t~mem81#1;havoc main_#t~mem82#1;call main_#t~mem83#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem84#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {13390#false} is VALID [2022-02-20 19:04:37,199 INFO L272 TraceCheckUtils]: 114: Hoare triple {13390#false} call assume_abort_if_not((if main_#t~mem83#1 % 256 == main_#t~mem84#1 % 256 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,199 INFO L290 TraceCheckUtils]: 115: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,199 INFO L290 TraceCheckUtils]: 116: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,199 INFO L290 TraceCheckUtils]: 117: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,199 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {13389#true} {13390#false} #488#return; {13390#false} is VALID [2022-02-20 19:04:37,199 INFO L290 TraceCheckUtils]: 119: Hoare triple {13390#false} havoc main_#t~mem83#1;havoc main_#t~mem84#1;call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__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, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {13390#false} is VALID [2022-02-20 19:04:37,199 INFO L272 TraceCheckUtils]: 120: Hoare triple {13390#false} call assume_abort_if_not((if main_#t~mem85#1.base == main_#t~mem86#1.base && main_#t~mem85#1.offset == main_#t~mem86#1.offset then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,200 INFO L290 TraceCheckUtils]: 121: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,200 INFO L290 TraceCheckUtils]: 122: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,200 INFO L290 TraceCheckUtils]: 123: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,200 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {13389#true} {13390#false} #490#return; {13390#false} is VALID [2022-02-20 19:04:37,200 INFO L290 TraceCheckUtils]: 125: Hoare triple {13390#false} havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__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, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {13390#false} is VALID [2022-02-20 19:04:37,200 INFO L272 TraceCheckUtils]: 126: Hoare triple {13390#false} call assume_abort_if_not((if main_#t~mem87#1.base == main_#t~mem88#1.base && main_#t~mem87#1.offset == main_#t~mem88#1.offset then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,200 INFO L290 TraceCheckUtils]: 127: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,201 INFO L290 TraceCheckUtils]: 128: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,201 INFO L290 TraceCheckUtils]: 129: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,201 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {13389#true} {13390#false} #492#return; {13390#false} is VALID [2022-02-20 19:04:37,201 INFO L290 TraceCheckUtils]: 131: Hoare triple {13390#false} havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {13390#false} is VALID [2022-02-20 19:04:37,201 INFO L272 TraceCheckUtils]: 132: Hoare triple {13390#false} call assume_abort_if_not((if main_#t~mem89#1.base == main_#t~mem90#1.base && main_#t~mem89#1.offset == main_#t~mem90#1.offset then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,201 INFO L290 TraceCheckUtils]: 133: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,201 INFO L290 TraceCheckUtils]: 134: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,202 INFO L290 TraceCheckUtils]: 135: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,202 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {13389#true} {13390#false} #494#return; {13390#false} is VALID [2022-02-20 19:04:37,202 INFO L290 TraceCheckUtils]: 137: Hoare triple {13390#false} havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1 := read~int(~#ma~0.base, ~#ma~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1); {13390#false} is VALID [2022-02-20 19:04:37,202 INFO L272 TraceCheckUtils]: 138: Hoare triple {13390#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,202 INFO L290 TraceCheckUtils]: 139: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,202 INFO L290 TraceCheckUtils]: 140: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,202 INFO L290 TraceCheckUtils]: 141: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,203 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {13389#true} {13390#false} #496#return; {13390#false} is VALID [2022-02-20 19:04:37,203 INFO L290 TraceCheckUtils]: 143: Hoare triple {13390#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#mb~0.base, ~#mb~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1); {13390#false} is VALID [2022-02-20 19:04:37,203 INFO L272 TraceCheckUtils]: 144: Hoare triple {13390#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,203 INFO L290 TraceCheckUtils]: 145: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,203 INFO L290 TraceCheckUtils]: 146: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,203 INFO L290 TraceCheckUtils]: 147: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,203 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {13389#true} {13390#false} #498#return; {13390#false} is VALID [2022-02-20 19:04:37,204 INFO L290 TraceCheckUtils]: 149: Hoare triple {13390#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#data1~0.base, ~#data1~0.offset, 4);call main_#t~mem96#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4); {13390#false} is VALID [2022-02-20 19:04:37,204 INFO L272 TraceCheckUtils]: 150: Hoare triple {13390#false} call assume_abort_if_not((if main_#t~mem95#1 == main_#t~mem96#1 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,204 INFO L290 TraceCheckUtils]: 151: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,204 INFO L290 TraceCheckUtils]: 152: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,204 INFO L290 TraceCheckUtils]: 153: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,204 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {13389#true} {13390#false} #500#return; {13390#false} is VALID [2022-02-20 19:04:37,205 INFO L290 TraceCheckUtils]: 155: Hoare triple {13390#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#data2~0.base, ~#data2~0.offset, 4);call main_#t~mem98#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4); {13390#false} is VALID [2022-02-20 19:04:37,205 INFO L272 TraceCheckUtils]: 156: Hoare triple {13390#false} call assume_abort_if_not((if main_#t~mem97#1 == main_#t~mem98#1 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:37,205 INFO L290 TraceCheckUtils]: 157: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:37,205 INFO L290 TraceCheckUtils]: 158: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:37,205 INFO L290 TraceCheckUtils]: 159: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:37,205 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {13389#true} {13390#false} #502#return; {13390#false} is VALID [2022-02-20 19:04:37,205 INFO L290 TraceCheckUtils]: 161: Hoare triple {13390#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;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; {13390#false} is VALID [2022-02-20 19:04:37,206 INFO L290 TraceCheckUtils]: 162: Hoare triple {13390#false} assume 0 == __VERIFIER_assert_~cond#1; {13390#false} is VALID [2022-02-20 19:04:37,206 INFO L290 TraceCheckUtils]: 163: Hoare triple {13390#false} assume !false; {13390#false} is VALID [2022-02-20 19:04:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-02-20 19:04:37,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:04:37,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436483335] [2022-02-20 19:04:37,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436483335] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:04:37,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101281828] [2022-02-20 19:04:37,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:37,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:04:37,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:04:37,224 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:37,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 19:04:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:38,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 2307 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 19:04:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:38,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {13389#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1, ULTIMATE.init_#t~nondet102#1, ULTIMATE.init_#t~nondet103#1, ULTIMATE.init_#t~nondet104#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~nondet99#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet101#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet102#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet103#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet104#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;havoc ULTIMATE.init_#t~nondet103#1;havoc ULTIMATE.init_#t~nondet104#1; {13389#true} is VALID [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {13389#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~post54#1, main_#t~post49#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~ret70#1.base, main_#t~ret70#1.offset, main_#t~mem71#1, main_#t~mem72#1, main_#t~ret74#1.base, main_#t~ret74#1.offset, main_#t~mem75#1, main_#t~mem76#1, main_#t~ret78#1.base, main_#t~ret78#1.offset, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1, main_#t~mem83#1, main_#t~mem84#1, 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.base, main_#t~mem89#1.offset, main_#t~mem90#1.base, main_#t~mem90#1.offset, 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_#t~mem97#1, main_#t~mem98#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, main_~i~0#1, main_~j~2#1;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);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {13389#true} is VALID [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {13389#true} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {13389#true} is VALID [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {13389#true} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {13389#true} is VALID [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 4: Hoare triple {13389#true} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {13389#true} is VALID [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {13389#true} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {13389#true} is VALID [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {13389#true} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {13389#true} is VALID [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {13389#true} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {13389#true} is VALID [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {13389#true} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {13389#true} is VALID [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {13389#true} assume !(main_~j~2#1 < 3); {13389#true} is VALID [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {13389#true} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {13389#true} is VALID [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {13389#true} assume !!(main_~i~0#1 < 2);call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);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_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1;main_~j~2#1 := 0; {13389#true} is VALID [2022-02-20 19:04:39,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {13389#true} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {13389#true} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {13389#true} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {13389#true} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {13389#true} assume !!(main_~j~2#1 < 3);call write~int(main_#t~nondet55#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~nondet55#1;call write~$Pointer$(0, (if main_#t~nondet56#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet56#1 % 4294967296 % 4294967296 else main_#t~nondet56#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~nondet56#1; {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {13389#true} main_#t~post54#1 := main_~j~2#1;main_~j~2#1 := 1 + main_#t~post54#1;havoc main_#t~post54#1; {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {13389#true} assume !(main_~j~2#1 < 3); {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {13389#true} main_#t~post49#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {13389#true} assume !(main_~i~0#1 < 2); {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {13389#true} call main_#t~mem57#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~mem57#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#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~mem58#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#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~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, main_#t~mem60#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset;call main_#t~mem61#1.base, main_#t~mem61#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~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#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~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~#__CS_cp_ma~0#1.base, 1 + main_~#__CS_cp_ma~0#1.offset, 1);call write~int(main_#t~mem63#1, ~#ma~0.base, 1 + ~#ma~0.offset, 1);havoc main_#t~mem63#1;call main_#t~mem64#1 := read~int(main_~#__CS_cp_mb~0#1.base, 1 + main_~#__CS_cp_mb~0#1.offset, 1);call write~int(main_#t~mem64#1, ~#mb~0.base, 1 + ~#mb~0.offset, 1);havoc main_#t~mem64#1;call main_#t~mem65#1 := read~int(main_~#__CS_cp_data1~0#1.base, 4 + main_~#__CS_cp_data1~0#1.offset, 4);call write~int(main_#t~mem65#1, ~#data1~0.base, 4 + ~#data1~0.offset, 4);havoc main_#t~mem65#1;call main_#t~mem66#1 := read~int(main_~#__CS_cp_data2~0#1.base, 4 + main_~#__CS_cp_data2~0#1.offset, 4);call write~int(main_#t~mem66#1, ~#data2~0.base, 4 + ~#data2~0.offset, 4);havoc main_#t~mem66#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~mem67#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {13389#true} assume !(1 == main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {13389#true} call main_#t~mem71#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {13389#true} assume !(1 == main_#t~mem71#1 % 256);havoc main_#t~mem71#1; {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {13389#true} call main_#t~mem75#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {13389#true} assume 1 == main_#t~mem75#1 % 256;havoc main_#t~mem75#1;call main_#t~mem76#1 := read~int(~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_round~0 := main_#t~mem76#1;havoc main_#t~mem76#1;~__CS_ret~0 := 0; {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L272 TraceCheckUtils]: 27: Hoare triple {13389#true} call main_#t~ret78#1.base, main_#t~ret78#1.offset := ##fun~$Pointer$~TO~$Pointer$(0, 0, ~__CS_thread~0.base[2], ~__CS_thread~0.offset[2]); {13389#true} is VALID [2022-02-20 19:04:39,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {13389#true} #~77#1.base, #~77#1.offset := #in~77#1.base, #in~77#1.offset; {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {13389#true} assume !(#in~#fp#1.base == #funAddr~main_thread.base && #in~#fp#1.offset == #funAddr~main_thread.offset); {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {13389#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 := #~77#1.base, #~77#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; {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L272 TraceCheckUtils]: 31: Hoare triple {13389#true} call __CS_cs(); {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {13389#true} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L272 TraceCheckUtils]: 33: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L290 TraceCheckUtils]: 38: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L290 TraceCheckUtils]: 39: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {13389#true} ~__CS_ret~0 := #t~ite5;havoc #t~nondet4;havoc #t~ite5; {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13389#true} {13389#true} #456#return; {13389#true} is VALID [2022-02-20 19:04:39,230 INFO L290 TraceCheckUtils]: 43: Hoare triple {13389#true} assume !(0 != ~__CS_ret~0 % 256); {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L272 TraceCheckUtils]: 44: Hoare triple {13389#true} call thread1_#t~ret22#1 := __CS_pthread_mutex_lock(~#ma~0.base, ~#ma~0.offset + ~__CS_round~0 % 256); {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {13389#true} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset;call #t~mem9 := read~int(~lock.base, ~lock.offset, 1); {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {13389#true} assume !(0 == #t~mem9 % 256);havoc #t~mem9;~__CS_ret~0 := ~__CS_ret_PREEMPTED~0;#res := 1; {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13389#true} {13389#true} #458#return; {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L290 TraceCheckUtils]: 49: Hoare triple {13389#true} assume -2147483648 <= thread1_#t~ret22#1 && thread1_#t~ret22#1 <= 2147483647;havoc thread1_#t~ret22#1; {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L272 TraceCheckUtils]: 50: Hoare triple {13389#true} call __CS_cs(); {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {13389#true} ~k~0 := #t~nondet3;havoc #t~nondet3; {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L272 TraceCheckUtils]: 52: Hoare triple {13389#true} call assume_abort_if_not((if ~__CS_round~0 % 256 + ~k~0 % 256 < 2 then 1 else 0)); {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {13389#true} ~cond := #in~cond; {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {13389#true} assume !(0 == ~cond); {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {13389#true} assume true; {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13389#true} {13389#true} #504#return; {13389#true} is VALID [2022-02-20 19:04:39,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {13389#true} ~__CS_round~0 := ~__CS_round~0 % 256 + ~k~0 % 256;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13389#true} is VALID [2022-02-20 19:04:39,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {13389#true} assume 0 != #t~nondet4 && 1 == ~__CS_round~0 % 256;#t~ite5 := ~__CS_ret_PREEMPTED~0 % 256; {13564#(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:39,233 INFO L290 TraceCheckUtils]: 59: Hoare triple {13564#(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; {13565#(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:39,233 INFO L290 TraceCheckUtils]: 60: Hoare triple {13565#(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; {13565#(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:39,233 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {13565#(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))))} {13389#true} #460#return; {13565#(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:39,235 ERROR L290 TraceCheckUtils]: 62: Hoare triple {13565#(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 !(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; {13769#(<= (div (- ~__CS_ret_PREEMPTED~0) (- 256)) (* (div ~__CS_ret_PREEMPTED~0 256) 2))} is INVALID [2022-02-20 19:04:39,236 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 19:04:39,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 19:04:39,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:04:39,456 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: invalid Hoare triple in FP at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:213) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 19:04:39,460 INFO L158 Benchmark]: Toolchain (without parser) took 61776.50ms. Allocated memory was 88.1MB in the beginning and 3.5GB in the end (delta: 3.5GB). Free memory was 51.6MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 974.8MB. Max. memory is 16.1GB. [2022-02-20 19:04:39,461 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:04:39,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.21ms. Allocated memory is still 88.1MB. Free memory was 51.3MB in the beginning and 44.4MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 19:04:39,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.16ms. Allocated memory is still 88.1MB. Free memory was 44.4MB in the beginning and 38.8MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 19:04:39,461 INFO L158 Benchmark]: Boogie Preprocessor took 57.83ms. Allocated memory is still 88.1MB. Free memory was 38.8MB in the beginning and 33.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:04:39,461 INFO L158 Benchmark]: RCFGBuilder took 2909.04ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 64.3MB in the beginning and 66.4MB in the end (delta: -2.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2022-02-20 19:04:39,462 INFO L158 Benchmark]: TraceAbstraction took 58137.83ms. Allocated memory was 107.0MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 65.7MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 970.8MB. Max. memory is 16.1GB. [2022-02-20 19:04:39,466 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 572.21ms. Allocated memory is still 88.1MB. Free memory was 51.3MB in the beginning and 44.4MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.16ms. Allocated memory is still 88.1MB. Free memory was 44.4MB in the beginning and 38.8MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.83ms. Allocated memory is still 88.1MB. Free memory was 38.8MB in the beginning and 33.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2909.04ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 64.3MB in the beginning and 66.4MB in the end (delta: -2.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 58137.83ms. Allocated memory was 107.0MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 65.7MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 970.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: invalid Hoare triple in FP de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: invalid Hoare triple in FP: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:213) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 19:04:39,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:04:41,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:04:41,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:04:41,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:04:41,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:04:41,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:04:41,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:04:41,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:04:41,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:04:41,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:04:41,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:04:41,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:04:41,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:04:41,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:04:41,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:04:41,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:04:41,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:04:41,318 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:04:41,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:04:41,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:04:41,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:04:41,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:04:41,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:04:41,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:04:41,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:04:41,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:04:41,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:04:41,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:04:41,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:04:41,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:04:41,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:04:41,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:04:41,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:04:41,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:04:41,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:04:41,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:04:41,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:04:41,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:04:41,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:04:41,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:04:41,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:04:41,348 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 19:04:41,377 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:04:41,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:04:41,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:04:41,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:04:41,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:04:41,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:04:41,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:04:41,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:04:41,382 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:04:41,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:04:41,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:04:41,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:04:41,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:04:41,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:04:41,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:04:41,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:04:41,384 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:04:41,385 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:04:41,385 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:04:41,385 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:04:41,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:04:41,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:04:41,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:04:41,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:04:41,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:04:41,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:04:41,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:04:41,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:04:41,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:04:41,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:04:41,387 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:04:41,388 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:04:41,388 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:04:41,388 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:04:41,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:04:41,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:04:41,389 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc [2022-02-20 19:04:41,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:04:41,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:04:41,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:04:41,684 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:04:41,684 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:04:41,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2022-02-20 19:04:41,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b505f7c8d/7ed33fc8e9ac4f61a0619a632f90c6ba/FLAGdc24ddc02 [2022-02-20 19:04:42,062 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:04:42,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2022-02-20 19:04:42,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b505f7c8d/7ed33fc8e9ac4f61a0619a632f90c6ba/FLAGdc24ddc02 [2022-02-20 19:04:42,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b505f7c8d/7ed33fc8e9ac4f61a0619a632f90c6ba [2022-02-20 19:04:42,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:04:42,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:04:42,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:04:42,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:04:42,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:04:42,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:04:42" (1/1) ... [2022-02-20 19:04:42,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dbb5927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:42, skipping insertion in model container [2022-02-20 19:04:42,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:04:42" (1/1) ... [2022-02-20 19:04:42,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:04:42,523 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:04:42,723 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-2.i[23607,23620] [2022-02-20 19:04:42,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:04:42,788 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:04:42,819 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-2.i[23607,23620] [2022-02-20 19:04:42,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:04:42,901 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:04:42,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:42 WrapperNode [2022-02-20 19:04:42,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:04:42,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:04:42,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:04:42,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:04:42,908 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:04:42" (1/1) ... [2022-02-20 19:04:42,929 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:04:42" (1/1) ... [2022-02-20 19:04:42,966 INFO L137 Inliner]: procedures = 149, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 524 [2022-02-20 19:04:42,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:04:42,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:04:42,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:04:42,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:04:42,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:42" (1/1) ... [2022-02-20 19:04:42,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:42" (1/1) ... [2022-02-20 19:04:42,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:42" (1/1) ... [2022-02-20 19:04:42,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:42" (1/1) ... [2022-02-20 19:04:43,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:42" (1/1) ... [2022-02-20 19:04:43,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:42" (1/1) ... [2022-02-20 19:04:43,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:42" (1/1) ... [2022-02-20 19:04:43,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:04:43,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:04:43,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:04:43,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:04:43,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:42" (1/1) ... [2022-02-20 19:04:43,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:04:43,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:04:43,076 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:04:43,086 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:04:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-02-20 19:04:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 19:04:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 19:04:43,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 19:04:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:04:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 19:04:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 19:04:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2022-02-20 19:04:43,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2022-02-20 19:04:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-02-20 19:04:43,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-02-20 19:04:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-02-20 19:04:43,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-02-20 19:04:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 19:04:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-02-20 19:04:43,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-02-20 19:04:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-02-20 19:04:43,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-02-20 19:04:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-20 19:04:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 19:04:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 19:04:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 19:04:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:04:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-02-20 19:04:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-02-20 19:04:43,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-02-20 19:04:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-02-20 19:04:43,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-02-20 19:04:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:04:43,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:04:43,228 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:04:43,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:04:43,485 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2022-02-20 19:04:43,485 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;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:04:43,485 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-02-20 19:04:43,485 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-02-20 19:04:43,485 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;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:04:43,485 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-02-20 19:04:43,485 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;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;