./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/pthread-demo-datarace-3.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a4c57e3 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/pthread-demo-datarace-3.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 17:34:13,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 17:34:13,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 17:34:13,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 17:34:13,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 17:34:13,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 17:34:13,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 17:34:13,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 17:34:13,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 17:34:13,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 17:34:13,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 17:34:13,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 17:34:13,546 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 17:34:13,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 17:34:13,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 17:34:13,548 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 17:34:13,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 17:34:13,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 17:34:13,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 17:34:13,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 17:34:13,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 17:34:13,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 17:34:13,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 17:34:13,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 17:34:13,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 17:34:13,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 17:34:13,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 17:34:13,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 17:34:13,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 17:34:13,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 17:34:13,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 17:34:13,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 17:34:13,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 17:34:13,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 17:34:13,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 17:34:13,555 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 17:34:13,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 17:34:13,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 17:34:13,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 17:34:13,556 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 17:34:13,556 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 17:34:13,557 INFO L153 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/UGemCutter-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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-09-08 17:34:13,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 17:34:13,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 17:34:13,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 17:34:13,797 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 17:34:13,798 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 17:34:13,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/mutex-meet-local/pthread-demo-datarace-3.yml/witness.yml [2024-09-08 17:34:13,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 17:34:13,862 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 17:34:13,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-09-08 17:34:15,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 17:34:15,500 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 17:34:15,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-09-08 17:34:15,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9e7cbf8ab/34ea2c7e03cc4cb4935505cd554217cb/FLAG7a99c5ab4 [2024-09-08 17:34:15,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9e7cbf8ab/34ea2c7e03cc4cb4935505cd554217cb [2024-09-08 17:34:15,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 17:34:15,536 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 17:34:15,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 17:34:15,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 17:34:15,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 17:34:15,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 05:34:13" (1/2) ... [2024-09-08 17:34:15,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac32228 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 05:34:15, skipping insertion in model container [2024-09-08 17:34:15,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 05:34:13" (1/2) ... [2024-09-08 17:34:15,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2d5313f3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 05:34:15, skipping insertion in model container [2024-09-08 17:34:15,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:34:15" (2/2) ... [2024-09-08 17:34:15,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac32228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:15, skipping insertion in model container [2024-09-08 17:34:15,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:34:15" (2/2) ... [2024-09-08 17:34:15,575 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 17:34:15,576 INFO L1541 ArrayList]: Location invariant before [L1355-L1355] 0 <= myglobal [2024-09-08 17:34:15,576 INFO L1541 ArrayList]: Location invariant before [L1333-L1333] 0 <= myglobal [2024-09-08 17:34:15,576 INFO L1541 ArrayList]: Location invariant before [L1328-L1328] 0 <= myglobal [2024-09-08 17:34:15,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 17:34:15,802 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-09-08 17:34:16,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 17:34:16,113 INFO L200 MainTranslator]: Completed pre-run [2024-09-08 17:34:16,125 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-08 17:34:16,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 17:34:16,312 INFO L204 MainTranslator]: Completed translation [2024-09-08 17:34:16,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16 WrapperNode [2024-09-08 17:34:16,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 17:34:16,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 17:34:16,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 17:34:16,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 17:34:16,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16" (1/1) ... [2024-09-08 17:34:16,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16" (1/1) ... [2024-09-08 17:34:16,356 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-09-08 17:34:16,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 17:34:16,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 17:34:16,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 17:34:16,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 17:34:16,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16" (1/1) ... [2024-09-08 17:34:16,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16" (1/1) ... [2024-09-08 17:34:16,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16" (1/1) ... [2024-09-08 17:34:16,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16" (1/1) ... [2024-09-08 17:34:16,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16" (1/1) ... [2024-09-08 17:34:16,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16" (1/1) ... [2024-09-08 17:34:16,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16" (1/1) ... [2024-09-08 17:34:16,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16" (1/1) ... [2024-09-08 17:34:16,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 17:34:16,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 17:34:16,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 17:34:16,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 17:34:16,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16" (1/1) ... [2024-09-08 17:34:16,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 17:34:16,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 17:34:16,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-08 17:34:16,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-08 17:34:16,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 17:34:16,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 17:34:16,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-09-08 17:34:16,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-09-08 17:34:16,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 17:34:16,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 17:34:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 17:34:16,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 17:34:16,465 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 17:34:16,592 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 17:34:16,594 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 17:34:16,715 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 17:34:16,716 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 17:34:16,835 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 17:34:16,836 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-08 17:34:16,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:34:16 BoogieIcfgContainer [2024-09-08 17:34:16,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 17:34:16,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 17:34:16,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 17:34:16,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 17:34:16,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 05:34:13" (1/4) ... [2024-09-08 17:34:16,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744e5d2f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 05:34:16, skipping insertion in model container [2024-09-08 17:34:16,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:34:15" (2/4) ... [2024-09-08 17:34:16,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744e5d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:34:16, skipping insertion in model container [2024-09-08 17:34:16,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:34:16" (3/4) ... [2024-09-08 17:34:16,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744e5d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:34:16, skipping insertion in model container [2024-09-08 17:34:16,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:34:16" (4/4) ... [2024-09-08 17:34:16,843 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-09-08 17:34:16,856 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 17:34:16,856 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-09-08 17:34:16,856 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 17:34:16,884 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-09-08 17:34:16,926 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 17:34:16,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 17:34:16,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 17:34:16,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 17:34:16,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-08 17:34:16,964 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 17:34:16,975 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread_function_dataraceThread1of1ForFork0 ======== [2024-09-08 17:34:16,981 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64dd3e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 17:34:16,981 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-08 17:34:17,051 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thread_function_dataraceErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread_function_dataraceErr0ASSERT_VIOLATIONWITNESS_INVARIANT, thread_function_dataraceErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 17:34:17,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:34:17,058 INFO L85 PathProgramCache]: Analyzing trace with hash -676209024, now seen corresponding path program 1 times [2024-09-08 17:34:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:34:17,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600114595] [2024-09-08 17:34:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:34:17,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:34:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:34:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:17,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:34:17,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600114595] [2024-09-08 17:34:17,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600114595] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:34:17,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:34:17,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-08 17:34:17,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919951408] [2024-09-08 17:34:17,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:34:17,344 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 17:34:17,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:34:17,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 17:34:17,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 17:34:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:17,368 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:34:17,369 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 17:34:17,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:34:17,429 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 17:34:17,430 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thread_function_dataraceErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread_function_dataraceErr0ASSERT_VIOLATIONWITNESS_INVARIANT, thread_function_dataraceErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 17:34:17,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:34:17,432 INFO L85 PathProgramCache]: Analyzing trace with hash -462624451, now seen corresponding path program 1 times [2024-09-08 17:34:17,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:34:17,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35266471] [2024-09-08 17:34:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:34:17,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:34:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:34:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:17,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:34:17,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35266471] [2024-09-08 17:34:17,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35266471] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:34:17,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:34:17,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 17:34:17,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961609702] [2024-09-08 17:34:17,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:34:17,595 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 17:34:17,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:34:17,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 17:34:17,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-08 17:34:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:17,597 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:34:17,598 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 17:34:17,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:34:17,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:17,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:34:17,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 17:34:17,796 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thread_function_dataraceErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 2 remaining) [2024-09-08 17:34:17,797 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thread_function_dataraceErr1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 2 remaining) [2024-09-08 17:34:17,797 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-08 17:34:17,803 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-08 17:34:17,804 INFO L312 ceAbstractionStarter]: Result for error location thread_function_dataraceThread1of1ForFork0 was SAFE,SAFE (1/2) [2024-09-08 17:34:17,811 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 17:34:17,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 17:34:17,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 17:34:17,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 17:34:17,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-09-08 17:34:17,841 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 17:34:17,843 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 17:34:17,843 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64dd3e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 17:34:17,843 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-08 17:34:17,876 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 17:34:17,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:34:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1296803357, now seen corresponding path program 1 times [2024-09-08 17:34:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:34:17,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721915651] [2024-09-08 17:34:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:34:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:34:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:34:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:17,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:34:17,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721915651] [2024-09-08 17:34:17,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721915651] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:34:17,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:34:17,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 17:34:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599317005] [2024-09-08 17:34:17,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:34:17,954 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 17:34:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:34:17,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 17:34:17,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 17:34:17,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:17,955 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:34:17,955 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 17:34:17,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:34:18,015 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-08 17:34:18,015 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 17:34:18,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:34:18,016 INFO L85 PathProgramCache]: Analyzing trace with hash 218512763, now seen corresponding path program 1 times [2024-09-08 17:34:18,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:34:18,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936400039] [2024-09-08 17:34:18,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:34:18,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:34:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:34:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:18,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:34:18,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936400039] [2024-09-08 17:34:18,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936400039] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:34:18,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:34:18,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 17:34:18,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474482776] [2024-09-08 17:34:18,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:34:18,121 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 17:34:18,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:34:18,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 17:34:18,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-08 17:34:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:18,122 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:34:18,125 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 17:34:18,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:34:18,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:34:18,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:34:18,258 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-08 17:34:18,259 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 17:34:18,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:34:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash -271979907, now seen corresponding path program 1 times [2024-09-08 17:34:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:34:18,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857788581] [2024-09-08 17:34:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:34:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:34:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:34:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:34:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857788581] [2024-09-08 17:34:18,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857788581] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 17:34:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6553742] [2024-09-08 17:34:18,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:34:18,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 17:34:18,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 17:34:18,347 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 17:34:18,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-08 17:34:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:34:18,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 17:34:18,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 17:34:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:18,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 17:34:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:18,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6553742] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 17:34:18,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 17:34:18,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-08 17:34:18,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912847412] [2024-09-08 17:34:18,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 17:34:18,513 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 17:34:18,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:34:18,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 17:34:18,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-08 17:34:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:18,515 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:34:18,515 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 17:34:18,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:34:18,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:34:18,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:34:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:34:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:34:18,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-08 17:34:18,823 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 17:34:18,824 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 17:34:18,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:34:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash 37166712, now seen corresponding path program 2 times [2024-09-08 17:34:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:34:18,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002167511] [2024-09-08 17:34:18,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:34:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:34:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:34:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:34:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002167511] [2024-09-08 17:34:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002167511] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 17:34:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279732191] [2024-09-08 17:34:18,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 17:34:18,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 17:34:18,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 17:34:18,969 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 17:34:18,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-08 17:34:19,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 17:34:19,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 17:34:19,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 17:34:19,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 17:34:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:19,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 17:34:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:19,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279732191] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 17:34:19,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 17:34:19,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-08 17:34:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450507789] [2024-09-08 17:34:19,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 17:34:19,243 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-08 17:34:19,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:34:19,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-08 17:34:19,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-08 17:34:19,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:19,244 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:34:19,244 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 17:34:19,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:34:19,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:34:19,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:34:19,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:34:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:34:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:34:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 17:34:19,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-08 17:34:19,632 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 17:34:19,633 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 17:34:19,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:34:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1302592658, now seen corresponding path program 3 times [2024-09-08 17:34:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:34:19,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131582135] [2024-09-08 17:34:19,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:34:19,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:34:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:34:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 10 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:19,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:34:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131582135] [2024-09-08 17:34:19,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131582135] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 17:34:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817350472] [2024-09-08 17:34:19,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-08 17:34:19,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 17:34:19,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 17:34:19,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 17:34:19,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-08 17:34:20,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-09-08 17:34:20,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 17:34:20,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 17:34:20,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 17:34:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 10 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:20,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 17:34:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 10 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:34:20,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817350472] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 17:34:20,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 17:34:20,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2024-09-08 17:34:20,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080706420] [2024-09-08 17:34:20,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 17:34:20,551 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-08 17:34:20,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:34:20,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-08 17:34:20,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-09-08 17:34:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:20,553 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:34:20,553 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.478260869565218) internal successors, (172), 23 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 17:34:20,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:34:20,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:34:20,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:34:20,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 17:34:20,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:34:20,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:34:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:34:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:34:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 17:34:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 17:34:20,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-08 17:34:21,073 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-08 17:34:21,074 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 17:34:21,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:34:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2052043016, now seen corresponding path program 4 times [2024-09-08 17:34:21,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:34:21,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498941330] [2024-09-08 17:34:21,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:34:21,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:34:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 17:34:21,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 17:34:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 17:34:21,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 17:34:21,257 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 17:34:21,258 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-09-08 17:34:21,258 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 3 remaining) [2024-09-08 17:34:21,258 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-09-08 17:34:21,259 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-08 17:34:21,261 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2024-09-08 17:34:21,261 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2024-09-08 17:34:21,433 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-08 17:34:21,433 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-08 17:34:21,437 INFO L469 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-09-08 17:34:21,437 INFO L470 ceAbstractionStarter]: WitnessConsidered=3 [2024-09-08 17:34:21,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 05:34:21 BasicIcfg [2024-09-08 17:34:21,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-08 17:34:21,438 INFO L158 Benchmark]: Toolchain (without parser) took 5902.75ms. Allocated memory was 197.1MB in the beginning and 241.2MB in the end (delta: 44.0MB). Free memory was 122.0MB in the beginning and 186.3MB in the end (delta: -64.3MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. [2024-09-08 17:34:21,439 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 17:34:21,439 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 17:34:21,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 774.52ms. Allocated memory is still 197.1MB. Free memory was 121.7MB in the beginning and 147.5MB in the end (delta: -25.8MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2024-09-08 17:34:21,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.85ms. Allocated memory is still 197.1MB. Free memory was 147.5MB in the beginning and 145.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 17:34:21,440 INFO L158 Benchmark]: Boogie Preprocessor took 28.06ms. Allocated memory is still 197.1MB. Free memory was 145.4MB in the beginning and 143.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 17:34:21,440 INFO L158 Benchmark]: RCFGBuilder took 450.33ms. Allocated memory is still 197.1MB. Free memory was 143.4MB in the beginning and 121.6MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-09-08 17:34:21,440 INFO L158 Benchmark]: TraceAbstraction took 4599.95ms. Allocated memory was 197.1MB in the beginning and 241.2MB in the end (delta: 44.0MB). Free memory was 120.3MB in the beginning and 186.3MB in the end (delta: -66.0MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2024-09-08 17:34:21,442 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 774.52ms. Allocated memory is still 197.1MB. Free memory was 121.7MB in the beginning and 147.5MB in the end (delta: -25.8MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.85ms. Allocated memory is still 197.1MB. Free memory was 147.5MB in the beginning and 145.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.06ms. Allocated memory is still 197.1MB. Free memory was 145.4MB in the beginning and 143.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 450.33ms. Allocated memory is still 197.1MB. Free memory was 143.4MB in the beginning and 121.6MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4599.95ms. Allocated memory was 197.1MB in the beginning and 241.2MB in the end (delta: 44.0MB). Free memory was 120.3MB in the beginning and 186.3MB in the end (delta: -66.0MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 336, independent: 271, independent conditional: 122, independent unconditional: 149, dependent: 65, dependent conditional: 61, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 282, independent: 271, independent conditional: 122, independent unconditional: 149, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 282, independent: 271, independent conditional: 122, independent unconditional: 149, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 292, independent: 271, independent conditional: 122, independent unconditional: 149, dependent: 21, dependent conditional: 17, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 292, independent: 271, independent conditional: 1, independent unconditional: 270, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 292, independent: 271, independent conditional: 1, independent unconditional: 270, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 128, independent: 114, independent conditional: 1, independent unconditional: 113, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 128, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 42, dependent conditional: 28, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 292, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 128, unknown conditional: 10, unknown unconditional: 118] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 114, Positive conditional cache size: 1, Positive unconditional cache size: 113, Negative cache size: 14, Negative conditional cache size: 9, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 129, Maximal queried relation: 2, Independence queries for same thread: 54, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 43, Number of trivial persistent sets: 37, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 336, independent: 271, independent conditional: 122, independent unconditional: 149, dependent: 65, dependent conditional: 61, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 282, independent: 271, independent conditional: 122, independent unconditional: 149, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 282, independent: 271, independent conditional: 122, independent unconditional: 149, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 292, independent: 271, independent conditional: 122, independent unconditional: 149, dependent: 21, dependent conditional: 17, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 292, independent: 271, independent conditional: 1, independent unconditional: 270, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 292, independent: 271, independent conditional: 1, independent unconditional: 270, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 128, independent: 114, independent conditional: 1, independent unconditional: 113, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 128, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 42, dependent conditional: 28, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 292, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 128, unknown conditional: 10, unknown unconditional: 118] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 114, Positive conditional cache size: 1, Positive unconditional cache size: 113, Negative cache size: 14, Negative conditional cache size: 9, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 129, Maximal queried relation: 2, Independence queries for same thread: 54 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1378, independent: 991, independent conditional: 854, independent unconditional: 137, dependent: 387, dependent conditional: 383, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 997, independent: 991, independent conditional: 854, independent unconditional: 137, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 997, independent: 991, independent conditional: 854, independent unconditional: 137, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 999, independent: 991, independent conditional: 854, independent unconditional: 137, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 999, independent: 991, independent conditional: 0, independent unconditional: 991, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 999, independent: 991, independent conditional: 0, independent unconditional: 991, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 113, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 113, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 11, dependent conditional: 4, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 999, independent: 884, independent conditional: 0, independent unconditional: 884, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 113, unknown conditional: 2, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 856, Maximal queried relation: 1, Independence queries for same thread: 381, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 33, Number of trivial persistent sets: 33, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1378, independent: 991, independent conditional: 854, independent unconditional: 137, dependent: 387, dependent conditional: 383, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 997, independent: 991, independent conditional: 854, independent unconditional: 137, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 997, independent: 991, independent conditional: 854, independent unconditional: 137, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 999, independent: 991, independent conditional: 854, independent unconditional: 137, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 999, independent: 991, independent conditional: 0, independent unconditional: 991, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 999, independent: 991, independent conditional: 0, independent unconditional: 991, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 113, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 113, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 11, dependent conditional: 4, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 999, independent: 884, independent conditional: 0, independent unconditional: 884, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 113, unknown conditional: 2, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 6, Negative conditional cache size: 2, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 856, Maximal queried relation: 1, Independence queries for same thread: 381 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=0] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=0, myglobal=0, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=0] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=0, myglobal=0] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=1, myglobal=1] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=1, j=1, myglobal=1, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=1, j=1, myglobal=2, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=1, j=1, myglobal=2, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=2] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=3, myglobal=3] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=2, j=3, myglobal=3, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=2, j=3, myglobal=4, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=2, j=3, myglobal=4, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=4] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=4, myglobal=4] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=5, myglobal=5] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=5, myglobal=5] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=3, j=5, myglobal=5, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=3, j=5, myglobal=6, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, i=3, j=5, myglobal=6, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=5, myglobal=6] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, myglobal=6] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=7, myglobal=7] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=7, myglobal=7] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, i=4, j=7, myglobal=7, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=3, i=4, j=7, myglobal=8, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, i=4, j=7, myglobal=8, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=7, myglobal=8] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=8, myglobal=8] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=9, myglobal=9] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=9, myglobal=9] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, i=5, j=9, myglobal=9, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=4, i=5, j=9, myglobal=10, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, i=5, j=9, myglobal=10, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=9, myglobal=10] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=10, myglobal=10] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=11, myglobal=11] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=11, myglobal=11] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, i=6, j=11, myglobal=11, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=5, i=6, j=11, myglobal=12, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, i=6, j=11, myglobal=12, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=11, myglobal=12] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=12, myglobal=12] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=13, myglobal=13] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=13, myglobal=13] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, i=7, j=13, myglobal=13, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=6, i=7, j=13, myglobal=14, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, i=7, j=13, myglobal=14, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=13, myglobal=14] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=14, myglobal=14] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=15, myglobal=15] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=15, myglobal=15] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, i=8, j=15, myglobal=15, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=7, i=8, j=15, myglobal=16, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, i=8, j=15, myglobal=16, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=15, myglobal=16] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=16, myglobal=16] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=17, myglobal=17] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=17, myglobal=17] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, i=9, j=17, myglobal=17, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=8, i=9, j=17, myglobal=18, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, i=9, j=17, myglobal=18, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=17, myglobal=18] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=18, myglobal=18] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=19, myglobal=19] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=19, myglobal=19] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=9, j=19, myglobal=19, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=9, j=19, myglobal=20, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=10, j=19, myglobal=20, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=19, myglobal=20] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=20, myglobal=20] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=21, myglobal=21] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=21, myglobal=21] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=11, j=21, myglobal=21, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=11, j=21, myglobal=22, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=11, j=21, myglobal=22, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=21, myglobal=22] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=22, myglobal=22] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=23, myglobal=23] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=23, myglobal=23] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=12, j=23, myglobal=23, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=12, j=23, myglobal=24, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=12, j=23, myglobal=24, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=23, myglobal=24] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=24, myglobal=24] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=25, myglobal=25] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=25, myglobal=25] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=13, j=25, myglobal=25, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=13, j=25, myglobal=26, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=13, j=25, myglobal=26, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=25, myglobal=26] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=26, myglobal=26] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=27, myglobal=27] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=27, myglobal=27] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=14, j=27, myglobal=27, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=14, j=27, myglobal=28, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=14, j=27, myglobal=28, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=27, myglobal=28] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=28, myglobal=28] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=29, myglobal=29] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=29, myglobal=29] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=15, j=29, myglobal=29, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=15, j=29, myglobal=30, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=15, j=29, myglobal=30, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=29, myglobal=30] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=30, myglobal=30] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=31, myglobal=31] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=31, myglobal=31] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=16, j=31, myglobal=31, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=16, j=31, myglobal=32, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=16, j=31, myglobal=32, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=31, myglobal=32] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=32, myglobal=32] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=33, myglobal=33] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=33, myglobal=33] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=17, j=33, myglobal=33, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=17, j=33, myglobal=34, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=17, j=33, myglobal=34, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=33, myglobal=34] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=34, myglobal=34] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=35, myglobal=35] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=35, myglobal=35] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=18, j=35, myglobal=35, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=18, j=35, myglobal=36, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=18, j=35, myglobal=36, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=35, myglobal=36] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=36, myglobal=36] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=37, myglobal=37] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=37, myglobal=37] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=19, j=37, myglobal=37, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=19, j=37, myglobal=38, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=19, j=37, myglobal=38, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=37, myglobal=38] [L1328] 1 //@ assert (0 <= myglobal); [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=38, myglobal=38] [L1330] 1 j=j+1 [L1333] 1 //@ assert (0 <= myglobal); [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=39, myglobal=39] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=39, myglobal=39, mythread=-1] [L1355] 0 //@ assert (0 <= myglobal); [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=39, myglobal=40, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=39, myglobal=40, mythread=-1] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=39, myglobal=40, mythread=-1] [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=39, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=39, myglobal=40] [L13] 0 reach_error() VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=39, myglobal=40] - UnprovableResult [Line: 1355]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1342]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread_function_dataraceThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 33 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 33 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 489 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 458 ConstructedInterpolants, 0 QuantifiedInterpolants, 1244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 468 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 45/1314 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-09-08 17:34:21,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-09-08 17:34:21,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-09-08 17:34:21,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE