./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-05-07_14-17-48.files/protection/pthread-demo-datarace-3.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i ./goblint.2024-05-07_14-17-48.files/protection/pthread-demo-datarace-3.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 13:44:37,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 13:44:38,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 13:44:38,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 13:44:38,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 13:44:38,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 13:44:38,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 13:44:38,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 13:44:38,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 13:44:38,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 13:44:38,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 13:44:38,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 13:44:38,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 13:44:38,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 13:44:38,069 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 13:44:38,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 13:44:38,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 13:44:38,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 13:44:38,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 13:44:38,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 13:44:38,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 13:44:38,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 13:44:38,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 13:44:38,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 13:44:38,071 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 13:44:38,071 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 13:44:38,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 13:44:38,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 13:44:38,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 13:44:38,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 13:44:38,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 13:44:38,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 13:44:38,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:44:38,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 13:44:38,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 13:44:38,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 13:44:38,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 13:44:38,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 13:44:38,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 13:44:38,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 13:44:38,075 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 13:44:38,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 13:44:38,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 13:44:38,076 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 13:44:38,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 13:44:38,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 13:44:38,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 13:44:38,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 13:44:38,285 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 13:44:38,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-05-12 13:44:39,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 13:44:39,546 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 13:44:39,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-05-12 13:44:39,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d140b4e95/e6be940068304e848afd778997beb5e7/FLAGec24b271c [2024-05-12 13:44:39,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d140b4e95/e6be940068304e848afd778997beb5e7 [2024-05-12 13:44:39,588 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 13:44:39,589 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 13:44:39,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/pthread-demo-datarace-3.yml/witness.yml [2024-05-12 13:44:39,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 13:44:39,657 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 13:44:39,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 13:44:39,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 13:44:39,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 13:44:39,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:44:39" (1/2) ... [2024-05-12 13:44:39,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@536a7d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:44:39, skipping insertion in model container [2024-05-12 13:44:39,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:44:39" (1/2) ... [2024-05-12 13:44:39,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5d5a7859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:44:39, skipping insertion in model container [2024-05-12 13:44:39,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:44:39" (2/2) ... [2024-05-12 13:44:39,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@536a7d41 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:39, skipping insertion in model container [2024-05-12 13:44:39,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:44:39" (2/2) ... [2024-05-12 13:44:39,667 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 13:44:39,690 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 13:44:39,692 INFO L97 edCorrectnessWitness]: Location invariant before [L1342-L1345] ! multithreaded || 0 <= myglobal [2024-05-12 13:44:39,692 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 13:44:39,692 INFO L106 edCorrectnessWitness]: ghost_update [L1342-L1342] multithreaded = 1; [2024-05-12 13:44:39,732 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 13:44:39,900 WARN L246 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-05-12 13:44:40,172 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:44:40,180 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 13:44:40,210 WARN L246 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 [2024-05-12 13:44:40,266 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:44:40,386 INFO L206 MainTranslator]: Completed translation [2024-05-12 13:44:40,386 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40 WrapperNode [2024-05-12 13:44:40,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 13:44:40,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 13:44:40,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 13:44:40,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 13:44:40,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (1/1) ... [2024-05-12 13:44:40,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (1/1) ... [2024-05-12 13:44:40,440 INFO L138 Inliner]: procedures = 365, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-05-12 13:44:40,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 13:44:40,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 13:44:40,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 13:44:40,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 13:44:40,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (1/1) ... [2024-05-12 13:44:40,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (1/1) ... [2024-05-12 13:44:40,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (1/1) ... [2024-05-12 13:44:40,463 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-05-12 13:44:40,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (1/1) ... [2024-05-12 13:44:40,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (1/1) ... [2024-05-12 13:44:40,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (1/1) ... [2024-05-12 13:44:40,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (1/1) ... [2024-05-12 13:44:40,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (1/1) ... [2024-05-12 13:44:40,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (1/1) ... [2024-05-12 13:44:40,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 13:44:40,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 13:44:40,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 13:44:40,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 13:44:40,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (1/1) ... [2024-05-12 13:44:40,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:44:40,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:44:40,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-05-12 13:44:40,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-05-12 13:44:40,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 13:44:40,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 13:44:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 13:44:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 13:44:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 13:44:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 13:44:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-05-12 13:44:40,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-05-12 13:44:40,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 13:44:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 13:44:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 13:44:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 13:44:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 13:44:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 13:44:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 13:44:40,535 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 13:44:40,645 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 13:44:40,647 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 13:44:40,743 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 13:44:40,743 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 13:44:40,829 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 13:44:40,830 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-12 13:44:40,830 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:44:40 BoogieIcfgContainer [2024-05-12 13:44:40,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 13:44:40,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 13:44:40,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 13:44:40,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 13:44:40,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 01:44:39" (1/4) ... [2024-05-12 13:44:40,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354d92ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:44:40, skipping insertion in model container [2024-05-12 13:44:40,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:44:39" (2/4) ... [2024-05-12 13:44:40,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354d92ee and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:44:40, skipping insertion in model container [2024-05-12 13:44:40,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:44:40" (3/4) ... [2024-05-12 13:44:40,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354d92ee and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:44:40, skipping insertion in model container [2024-05-12 13:44:40,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:44:40" (4/4) ... [2024-05-12 13:44:40,836 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-05-12 13:44:40,859 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 13:44:40,859 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-12 13:44:40,859 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 13:44:40,880 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-05-12 13:44:40,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 59 flow [2024-05-12 13:44:40,923 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-05-12 13:44:40,923 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-05-12 13:44:40,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 25 events. 3/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2024-05-12 13:44:40,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 26 transitions, 59 flow [2024-05-12 13:44:40,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 22 transitions, 50 flow [2024-05-12 13:44:40,935 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 13:44:40,941 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@65c01771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 13:44:40,941 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-12 13:44:40,943 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 13:44:40,943 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-05-12 13:44:40,943 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:44:40,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:44:40,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-05-12 13:44:40,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-12 13:44:40,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:44:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash 8306, now seen corresponding path program 1 times [2024-05-12 13:44:40,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:44:40,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113630231] [2024-05-12 13:44:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:44:40,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:44:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:44:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:44:41,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:44:41,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113630231] [2024-05-12 13:44:41,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113630231] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:44:41,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:44:41,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 13:44:41,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635720542] [2024-05-12 13:44:41,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:44:41,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:44:41,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:44:41,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:44:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:44:41,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 26 [2024-05-12 13:44:41,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:44:41,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:44:41,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 26 [2024-05-12 13:44:41,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:44:41,246 INFO L124 PetriNetUnfolderBase]: 13/42 cut-off events. [2024-05-12 13:44:41,246 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-05-12 13:44:41,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 42 events. 13/42 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 90 event pairs, 6 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 57. Up to 30 conditions per place. [2024-05-12 13:44:41,249 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 11 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2024-05-12 13:44:41,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 74 flow [2024-05-12 13:44:41,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:44:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:44:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-05-12 13:44:41,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2024-05-12 13:44:41,259 INFO L175 Difference]: Start difference. First operand has 24 places, 22 transitions, 50 flow. Second operand 3 states and 44 transitions. [2024-05-12 13:44:41,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 74 flow [2024-05-12 13:44:41,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 21 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:44:41,263 INFO L231 Difference]: Finished difference. Result has 23 places, 21 transitions, 48 flow [2024-05-12 13:44:41,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=23, PETRI_TRANSITIONS=21} [2024-05-12 13:44:41,269 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2024-05-12 13:44:41,269 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 21 transitions, 48 flow [2024-05-12 13:44:41,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:44:41,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:44:41,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:44:41,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 13:44:41,271 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-12 13:44:41,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:44:41,273 INFO L85 PathProgramCache]: Analyzing trace with hash 2044268313, now seen corresponding path program 1 times [2024-05-12 13:44:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:44:41,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879219493] [2024-05-12 13:44:41,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:44:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:44:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:44:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:44:41,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:44:41,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879219493] [2024-05-12 13:44:41,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879219493] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:44:41,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:44:41,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:44:41,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023316421] [2024-05-12 13:44:41,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:44:41,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:44:41,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:44:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:44:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:44:41,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 26 [2024-05-12 13:44:41,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-05-12 13:44:41,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:44:41,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 26 [2024-05-12 13:44:41,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:44:41,422 INFO L124 PetriNetUnfolderBase]: 19/63 cut-off events. [2024-05-12 13:44:41,423 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-05-12 13:44:41,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 63 events. 19/63 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 131 event pairs, 6 based on Foata normal form. 3/62 useless extension candidates. Maximal degree in co-relation 101. Up to 31 conditions per place. [2024-05-12 13:44:41,425 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 16 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2024-05-12 13:44:41,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 94 flow [2024-05-12 13:44:41,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:44:41,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:44:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-05-12 13:44:41,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-05-12 13:44:41,427 INFO L175 Difference]: Start difference. First operand has 23 places, 21 transitions, 48 flow. Second operand 3 states and 52 transitions. [2024-05-12 13:44:41,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 94 flow [2024-05-12 13:44:41,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:44:41,429 INFO L231 Difference]: Finished difference. Result has 24 places, 22 transitions, 56 flow [2024-05-12 13:44:41,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=24, PETRI_TRANSITIONS=22} [2024-05-12 13:44:41,430 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2024-05-12 13:44:41,430 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 22 transitions, 56 flow [2024-05-12 13:44:41,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-05-12 13:44:41,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:44:41,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:44:41,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 13:44:41,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-12 13:44:41,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:44:41,440 INFO L85 PathProgramCache]: Analyzing trace with hash -806153912, now seen corresponding path program 1 times [2024-05-12 13:44:41,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:44:41,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679705074] [2024-05-12 13:44:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:44:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:44:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:44:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:44:41,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:44:41,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679705074] [2024-05-12 13:44:41,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679705074] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:44:41,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:44:41,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:44:41,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510907107] [2024-05-12 13:44:41,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:44:41,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:44:41,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:44:41,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:44:41,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:44:41,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 26 [2024-05-12 13:44:41,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 22 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:44:41,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:44:41,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 26 [2024-05-12 13:44:41,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:44:41,572 INFO L124 PetriNetUnfolderBase]: 25/85 cut-off events. [2024-05-12 13:44:41,573 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-05-12 13:44:41,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 85 events. 25/85 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 236 event pairs, 10 based on Foata normal form. 6/90 useless extension candidates. Maximal degree in co-relation 75. Up to 43 conditions per place. [2024-05-12 13:44:41,574 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 18 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2024-05-12 13:44:41,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 118 flow [2024-05-12 13:44:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:44:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:44:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-05-12 13:44:41,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-05-12 13:44:41,577 INFO L175 Difference]: Start difference. First operand has 24 places, 22 transitions, 56 flow. Second operand 3 states and 52 transitions. [2024-05-12 13:44:41,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 118 flow [2024-05-12 13:44:41,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 13:44:41,579 INFO L231 Difference]: Finished difference. Result has 26 places, 23 transitions, 66 flow [2024-05-12 13:44:41,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=26, PETRI_TRANSITIONS=23} [2024-05-12 13:44:41,580 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2024-05-12 13:44:41,580 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 66 flow [2024-05-12 13:44:41,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:44:41,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:44:41,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:44:41,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 13:44:41,582 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-12 13:44:41,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:44:41,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2055458070, now seen corresponding path program 1 times [2024-05-12 13:44:41,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:44:41,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892752874] [2024-05-12 13:44:41,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:44:41,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:44:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:44:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:44:41,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:44:41,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892752874] [2024-05-12 13:44:41,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892752874] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 13:44:41,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175126795] [2024-05-12 13:44:41,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:44:41,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:44:41,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:44:41,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 13:44:41,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-05-12 13:44:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:44:41,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2024-05-12 13:44:41,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 13:44:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 13:44:41,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 13:44:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 13:44:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175126795] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 13:44:41,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 13:44:41,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-05-12 13:44:41,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611424484] [2024-05-12 13:44:41,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 13:44:41,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:44:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:44:41,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:44:41,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:44:41,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 26 [2024-05-12 13:44:41,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 66 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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-05-12 13:44:41,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:44:41,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 26 [2024-05-12 13:44:41,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:44:41,999 INFO L124 PetriNetUnfolderBase]: 76/217 cut-off events. [2024-05-12 13:44:41,999 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-05-12 13:44:42,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 217 events. 76/217 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 685 event pairs, 4 based on Foata normal form. 30/246 useless extension candidates. Maximal degree in co-relation 194. Up to 61 conditions per place. [2024-05-12 13:44:42,001 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 43 selfloop transitions, 33 changer transitions 0/83 dead transitions. [2024-05-12 13:44:42,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 83 transitions, 416 flow [2024-05-12 13:44:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-12 13:44:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-05-12 13:44:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 250 transitions. [2024-05-12 13:44:42,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6009615384615384 [2024-05-12 13:44:42,003 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 66 flow. Second operand 16 states and 250 transitions. [2024-05-12 13:44:42,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 83 transitions, 416 flow [2024-05-12 13:44:42,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 83 transitions, 406 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 13:44:42,006 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 338 flow [2024-05-12 13:44:42,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=338, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2024-05-12 13:44:42,006 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 29 predicate places. [2024-05-12 13:44:42,007 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 338 flow [2024-05-12 13:44:42,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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-05-12 13:44:42,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:44:42,007 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:44:42,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-05-12 13:44:42,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:44:42,218 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-12 13:44:42,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:44:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1846239227, now seen corresponding path program 2 times [2024-05-12 13:44:42,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:44:42,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668683639] [2024-05-12 13:44:42,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:44:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:44:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:44:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-12 13:44:42,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:44:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668683639] [2024-05-12 13:44:42,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668683639] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 13:44:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089867249] [2024-05-12 13:44:42,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 13:44:42,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:44:42,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:44:42,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 13:44:42,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-12 13:44:42,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 13:44:42,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 13:44:42,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-12 13:44:42,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 13:44:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-12 13:44:42,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 13:44:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-12 13:44:42,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089867249] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 13:44:42,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 13:44:42,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-05-12 13:44:42,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860795731] [2024-05-12 13:44:42,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 13:44:42,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:44:42,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:44:42,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:44:42,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:44:42,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 26 [2024-05-12 13:44:42,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 338 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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-05-12 13:44:42,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:44:42,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 26 [2024-05-12 13:44:42,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:44:42,625 INFO L124 PetriNetUnfolderBase]: 176/513 cut-off events. [2024-05-12 13:44:42,626 INFO L125 PetriNetUnfolderBase]: For 3050/3052 co-relation queries the response was YES. [2024-05-12 13:44:42,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 513 events. 176/513 cut-off events. For 3050/3052 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2368 event pairs, 45 based on Foata normal form. 59/565 useless extension candidates. Maximal degree in co-relation 1589. Up to 126 conditions per place. [2024-05-12 13:44:42,644 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 62 selfloop transitions, 20 changer transitions 0/92 dead transitions. [2024-05-12 13:44:42,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 852 flow [2024-05-12 13:44:42,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:44:42,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:44:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-05-12 13:44:42,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6394230769230769 [2024-05-12 13:44:42,646 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 338 flow. Second operand 8 states and 133 transitions. [2024-05-12 13:44:42,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 852 flow [2024-05-12 13:44:42,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 92 transitions, 776 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-05-12 13:44:42,656 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 408 flow [2024-05-12 13:44:42,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=408, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2024-05-12 13:44:42,658 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 39 predicate places. [2024-05-12 13:44:42,658 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 408 flow [2024-05-12 13:44:42,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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-05-12 13:44:42,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:44:42,658 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:44:42,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-12 13:44:42,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:44:42,870 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-12 13:44:42,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:44:42,871 INFO L85 PathProgramCache]: Analyzing trace with hash -453967109, now seen corresponding path program 3 times [2024-05-12 13:44:42,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:44:42,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56847098] [2024-05-12 13:44:42,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:44:42,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:44:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:44:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-12 13:44:43,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:44:43,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56847098] [2024-05-12 13:44:43,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56847098] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 13:44:43,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755510275] [2024-05-12 13:44:43,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-12 13:44:43,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:44:43,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:44:43,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 13:44:43,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-12 13:44:43,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-05-12 13:44:43,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 13:44:43,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-12 13:44:43,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 13:44:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-12 13:44:43,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 13:44:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-12 13:44:43,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755510275] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 13:44:43,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 13:44:43,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2024-05-12 13:44:43,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151083523] [2024-05-12 13:44:43,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 13:44:43,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-12 13:44:43,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:44:43,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-12 13:44:43,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-05-12 13:44:43,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 26 [2024-05-12 13:44:43,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 408 flow. Second operand has 19 states, 19 states have (on average 12.68421052631579) internal successors, (241), 19 states have internal predecessors, (241), 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-05-12 13:44:43,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:44:43,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 26 [2024-05-12 13:44:43,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:44:44,474 INFO L124 PetriNetUnfolderBase]: 331/937 cut-off events. [2024-05-12 13:44:44,474 INFO L125 PetriNetUnfolderBase]: For 14351/14383 co-relation queries the response was YES. [2024-05-12 13:44:44,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4525 conditions, 937 events. 331/937 cut-off events. For 14351/14383 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4924 event pairs, 4 based on Foata normal form. 95/1031 useless extension candidates. Maximal degree in co-relation 4002. Up to 297 conditions per place. [2024-05-12 13:44:44,481 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 196 selfloop transitions, 202 changer transitions 0/406 dead transitions. [2024-05-12 13:44:44,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 406 transitions, 4192 flow [2024-05-12 13:44:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-05-12 13:44:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2024-05-12 13:44:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 1329 transitions. [2024-05-12 13:44:44,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5743301642178047 [2024-05-12 13:44:44,485 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 408 flow. Second operand 89 states and 1329 transitions. [2024-05-12 13:44:44,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 406 transitions, 4192 flow [2024-05-12 13:44:44,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 406 transitions, 3860 flow, removed 132 selfloop flow, removed 2 redundant places. [2024-05-12 13:44:44,500 INFO L231 Difference]: Finished difference. Result has 209 places, 234 transitions, 2866 flow [2024-05-12 13:44:44,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=89, PETRI_FLOW=2866, PETRI_PLACES=209, PETRI_TRANSITIONS=234} [2024-05-12 13:44:44,501 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 185 predicate places. [2024-05-12 13:44:44,501 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 234 transitions, 2866 flow [2024-05-12 13:44:44,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.68421052631579) internal successors, (241), 19 states have internal predecessors, (241), 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-05-12 13:44:44,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:44:44,502 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:44:44,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-12 13:44:44,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:44:44,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-12 13:44:44,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:44:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1702094623, now seen corresponding path program 4 times [2024-05-12 13:44:44,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:44:44,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704650952] [2024-05-12 13:44:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:44:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:44:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:44:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 10 proven. 70 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-05-12 13:44:44,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:44:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704650952] [2024-05-12 13:44:44,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704650952] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 13:44:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420673393] [2024-05-12 13:44:44,875 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-12 13:44:44,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:44:44,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:44:44,876 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 13:44:44,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-12 13:44:44,968 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-12 13:44:44,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 13:44:44,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-12 13:44:44,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 13:44:45,051 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 10 proven. 70 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-05-12 13:44:45,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 13:44:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 10 proven. 70 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-05-12 13:44:45,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420673393] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 13:44:45,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 13:44:45,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-05-12 13:44:45,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303860244] [2024-05-12 13:44:45,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 13:44:45,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-12 13:44:45,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:44:45,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-12 13:44:45,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2024-05-12 13:44:45,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 26 [2024-05-12 13:44:45,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 234 transitions, 2866 flow. Second operand has 19 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 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-05-12 13:44:45,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:44:45,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 26 [2024-05-12 13:44:45,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:44:45,805 INFO L124 PetriNetUnfolderBase]: 873/2604 cut-off events. [2024-05-12 13:44:45,806 INFO L125 PetriNetUnfolderBase]: For 136055/136057 co-relation queries the response was YES. [2024-05-12 13:44:45,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14270 conditions, 2604 events. 873/2604 cut-off events. For 136055/136057 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 15756 event pairs, 211 based on Foata normal form. 297/2874 useless extension candidates. Maximal degree in co-relation 12529. Up to 559 conditions per place. [2024-05-12 13:44:45,836 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 244 selfloop transitions, 206 changer transitions 0/468 dead transitions. [2024-05-12 13:44:45,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 468 transitions, 8092 flow [2024-05-12 13:44:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-12 13:44:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-05-12 13:44:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 298 transitions. [2024-05-12 13:44:45,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6367521367521367 [2024-05-12 13:44:45,839 INFO L175 Difference]: Start difference. First operand has 209 places, 234 transitions, 2866 flow. Second operand 18 states and 298 transitions. [2024-05-12 13:44:45,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 468 transitions, 8092 flow [2024-05-12 13:44:46,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 468 transitions, 7530 flow, removed 185 selfloop flow, removed 12 redundant places. [2024-05-12 13:44:46,254 INFO L231 Difference]: Finished difference. Result has 224 places, 323 transitions, 4432 flow [2024-05-12 13:44:46,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2358, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4432, PETRI_PLACES=224, PETRI_TRANSITIONS=323} [2024-05-12 13:44:46,255 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 200 predicate places. [2024-05-12 13:44:46,256 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 323 transitions, 4432 flow [2024-05-12 13:44:46,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 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-05-12 13:44:46,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:44:46,256 INFO L208 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:44:46,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-12 13:44:46,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:44:46,467 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-12 13:44:46,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:44:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash -532192741, now seen corresponding path program 5 times [2024-05-12 13:44:46,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:44:46,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874644249] [2024-05-12 13:44:46,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:44:46,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:44:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:44:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-05-12 13:44:46,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:44:46,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874644249] [2024-05-12 13:44:46,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874644249] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 13:44:46,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029037148] [2024-05-12 13:44:46,712 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-12 13:44:46,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:44:46,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:44:46,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 13:44:46,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-12 13:44:46,808 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-05-12 13:44:46,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 13:44:46,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-12 13:44:46,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 13:44:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-05-12 13:44:46,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 13:44:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-05-12 13:44:47,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029037148] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 13:44:47,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 13:44:47,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-12 13:44:47,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310110978] [2024-05-12 13:44:47,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 13:44:47,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-12 13:44:47,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:44:47,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-12 13:44:47,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-05-12 13:44:47,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 26 [2024-05-12 13:44:47,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 323 transitions, 4432 flow. Second operand has 23 states, 23 states have (on average 12.521739130434783) internal successors, (288), 23 states have internal predecessors, (288), 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-05-12 13:44:47,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:44:47,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 26 [2024-05-12 13:44:47,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:44:48,006 INFO L124 PetriNetUnfolderBase]: 1069/3192 cut-off events. [2024-05-12 13:44:48,006 INFO L125 PetriNetUnfolderBase]: For 161384/161386 co-relation queries the response was YES. [2024-05-12 13:44:48,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18497 conditions, 3192 events. 1069/3192 cut-off events. For 161384/161386 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19953 event pairs, 251 based on Foata normal form. 132/3289 useless extension candidates. Maximal degree in co-relation 16143. Up to 620 conditions per place. [2024-05-12 13:44:48,046 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 300 selfloop transitions, 250 changer transitions 0/568 dead transitions. [2024-05-12 13:44:48,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 568 transitions, 10192 flow [2024-05-12 13:44:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-12 13:44:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-05-12 13:44:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 357 transitions. [2024-05-12 13:44:48,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6241258741258742 [2024-05-12 13:44:48,047 INFO L175 Difference]: Start difference. First operand has 224 places, 323 transitions, 4432 flow. Second operand 22 states and 357 transitions. [2024-05-12 13:44:48,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 568 transitions, 10192 flow [2024-05-12 13:44:48,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 568 transitions, 10008 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 13:44:48,619 INFO L231 Difference]: Finished difference. Result has 243 places, 368 transitions, 5766 flow [2024-05-12 13:44:48,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=4248, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5766, PETRI_PLACES=243, PETRI_TRANSITIONS=368} [2024-05-12 13:44:48,621 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 219 predicate places. [2024-05-12 13:44:48,622 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 368 transitions, 5766 flow [2024-05-12 13:44:48,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.521739130434783) internal successors, (288), 23 states have internal predecessors, (288), 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-05-12 13:44:48,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:44:48,623 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:44:48,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-05-12 13:44:48,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:44:48,824 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-12 13:44:48,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:44:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1187929561, now seen corresponding path program 6 times [2024-05-12 13:44:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:44:48,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260713369] [2024-05-12 13:44:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:44:48,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:44:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:44:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-05-12 13:44:49,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:44:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260713369] [2024-05-12 13:44:49,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260713369] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 13:44:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138809903] [2024-05-12 13:44:49,058 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-12 13:44:49,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:44:49,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:44:49,059 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 13:44:49,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-12 13:44:49,146 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-05-12 13:44:49,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 13:44:49,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-12 13:44:49,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 13:44:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-05-12 13:44:49,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 13:44:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-05-12 13:44:49,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138809903] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 13:44:49,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 13:44:49,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2024-05-12 13:44:49,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101298092] [2024-05-12 13:44:49,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 13:44:49,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-12 13:44:49,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:44:49,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-12 13:44:49,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-05-12 13:44:49,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 26 [2024-05-12 13:44:49,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 368 transitions, 5766 flow. Second operand has 23 states, 23 states have (on average 13.217391304347826) internal successors, (304), 23 states have internal predecessors, (304), 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-05-12 13:44:49,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:44:49,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 26 [2024-05-12 13:44:49,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:44:50,716 INFO L124 PetriNetUnfolderBase]: 1390/3869 cut-off events. [2024-05-12 13:44:50,717 INFO L125 PetriNetUnfolderBase]: For 484830/485138 co-relation queries the response was YES. [2024-05-12 13:44:50,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25845 conditions, 3869 events. 1390/3869 cut-off events. For 484830/485138 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27570 event pairs, 60 based on Foata normal form. 238/4072 useless extension candidates. Maximal degree in co-relation 23622. Up to 1323 conditions per place. [2024-05-12 13:44:50,773 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 819 selfloop transitions, 176 changer transitions 0/1005 dead transitions. [2024-05-12 13:44:50,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 1005 transitions, 19208 flow [2024-05-12 13:44:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-12 13:44:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-05-12 13:44:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 362 transitions. [2024-05-12 13:44:50,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6328671328671329 [2024-05-12 13:44:50,775 INFO L175 Difference]: Start difference. First operand has 243 places, 368 transitions, 5766 flow. Second operand 22 states and 362 transitions. [2024-05-12 13:44:50,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 1005 transitions, 19208 flow [2024-05-12 13:44:51,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 1005 transitions, 18248 flow, removed 0 selfloop flow, removed 15 redundant places. [2024-05-12 13:44:51,137 INFO L231 Difference]: Finished difference. Result has 260 places, 456 transitions, 6866 flow [2024-05-12 13:44:51,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=5406, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6866, PETRI_PLACES=260, PETRI_TRANSITIONS=456} [2024-05-12 13:44:51,139 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 236 predicate places. [2024-05-12 13:44:51,139 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 456 transitions, 6866 flow [2024-05-12 13:44:51,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 13.217391304347826) internal successors, (304), 23 states have internal predecessors, (304), 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-05-12 13:44:51,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:44:51,140 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:44:51,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-12 13:44:51,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:44:51,354 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-12 13:44:51,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:44:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash -759298695, now seen corresponding path program 7 times [2024-05-12 13:44:51,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:44:51,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247794778] [2024-05-12 13:44:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:44:51,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:44:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:44:51,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 13:44:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:44:51,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 13:44:51,572 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 13:44:51,572 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-12 13:44:51,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 3 remaining) [2024-05-12 13:44:51,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-12 13:44:51,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 13:44:51,574 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-05-12 13:44:51,582 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 13:44:51,582 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 13:44:51,664 INFO L507 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-05-12 13:44:51,664 INFO L508 ceAbstractionStarter]: WitnessConsidered=1 [2024-05-12 13:44:51,665 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 01:44:51 BasicIcfg [2024-05-12 13:44:51,665 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 13:44:51,665 INFO L158 Benchmark]: Toolchain (without parser) took 12008.83ms. Allocated memory was 165.7MB in the beginning and 664.8MB in the end (delta: 499.1MB). Free memory was 87.7MB in the beginning and 422.6MB in the end (delta: -334.9MB). Peak memory consumption was 337.8MB. Max. memory is 16.1GB. [2024-05-12 13:44:51,666 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:44:51,666 INFO L158 Benchmark]: Witness Parser took 0.41ms. Allocated memory is still 165.7MB. Free memory was 90.3MB in the beginning and 90.1MB in the end (delta: 236.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 13:44:51,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 728.57ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 87.5MB in the beginning and 192.2MB in the end (delta: -104.7MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2024-05-12 13:44:51,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.29ms. Allocated memory is still 243.3MB. Free memory was 192.2MB in the beginning and 190.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 13:44:51,667 INFO L158 Benchmark]: Boogie Preprocessor took 38.34ms. Allocated memory is still 243.3MB. Free memory was 190.1MB in the beginning and 188.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 13:44:51,667 INFO L158 Benchmark]: RCFGBuilder took 350.46ms. Allocated memory is still 243.3MB. Free memory was 188.0MB in the beginning and 165.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-05-12 13:44:51,667 INFO L158 Benchmark]: TraceAbstraction took 10833.71ms. Allocated memory was 243.3MB in the beginning and 664.8MB in the end (delta: 421.5MB). Free memory was 163.9MB in the beginning and 422.6MB in the end (delta: -258.7MB). Peak memory consumption was 334.8MB. Max. memory is 16.1GB. [2024-05-12 13:44:51,668 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.41ms. Allocated memory is still 165.7MB. Free memory was 90.3MB in the beginning and 90.1MB in the end (delta: 236.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 728.57ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 87.5MB in the beginning and 192.2MB in the end (delta: -104.7MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.29ms. Allocated memory is still 243.3MB. Free memory was 192.2MB in the beginning and 190.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.34ms. Allocated memory is still 243.3MB. Free memory was 190.1MB in the beginning and 188.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 350.46ms. Allocated memory is still 243.3MB. Free memory was 188.0MB in the beginning and 165.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10833.71ms. Allocated memory was 243.3MB in the beginning and 664.8MB in the end (delta: 421.5MB). Free memory was 163.9MB in the beginning and 422.6MB in the end (delta: -258.7MB). Peak memory consumption was 334.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [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; VAL [myglobal=0, mythread={3:0}] [L1342] 0 //@ assert (!multithreaded || (0 <= myglobal)); VAL [myglobal=0, mythread={3:0}] [L1342] 0 //@ ghost multithreaded = 1; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread={3:0}] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=0, myglobal=1, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=1, myglobal=2, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=2, myglobal=3, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=3, myglobal=4, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=4, myglobal=5, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=5, myglobal=6, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=6, myglobal=7, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=7, myglobal=8, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=8, myglobal=9, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=9, myglobal=10, mythread={3:0}] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=10] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=10, myglobal=10, mythread={3:0}] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=10] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=10, myglobal=10] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=11, myglobal=11] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=11, myglobal=11] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=11, myglobal=11] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=11, myglobal=11] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=12, myglobal=12] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=12, myglobal=12] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=12, myglobal=12] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=12, myglobal=12] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=13, myglobal=13] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=13, myglobal=13] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=13, myglobal=13] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=13, myglobal=13] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=14, myglobal=14] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=14, myglobal=14] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=14, myglobal=14] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=14, myglobal=14] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=15, myglobal=15] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=15, myglobal=15] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=15, myglobal=15] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=15, myglobal=15] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=16, myglobal=16] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=16, myglobal=16] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=16, myglobal=16] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=16, myglobal=16] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=17, myglobal=17] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=17, myglobal=17] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=17, myglobal=17] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=17, myglobal=17] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=18, myglobal=18] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=18, myglobal=18] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=18, myglobal=18] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=18, myglobal=18] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=19, myglobal=19] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=19, myglobal=19] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=19, myglobal=19] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=19, myglobal=19] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=20, myglobal=20] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=20, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=20, myglobal=20] [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 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] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=21, myglobal=21] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=21, myglobal=21] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=22, myglobal=22] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=22, myglobal=22] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=22, myglobal=22] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=22, myglobal=22] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=23, myglobal=23] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=23, myglobal=23] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=23, myglobal=23] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=23, myglobal=23] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=24, myglobal=24] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=24, myglobal=24] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=24, myglobal=24] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=24, myglobal=24] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=25, myglobal=25] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=25, myglobal=25] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=25, myglobal=25] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=25, myglobal=25] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=26, myglobal=26] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=26, myglobal=26] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=26, myglobal=26] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=26, myglobal=26] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=27, myglobal=27] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=27, myglobal=27] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=27, myglobal=27] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=27, myglobal=27] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=28, myglobal=28] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=28, myglobal=28] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=28, myglobal=28] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=28, myglobal=28] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=29, myglobal=29] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=29, myglobal=29] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=29, myglobal=29] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=29, myglobal=29] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=30, myglobal=30] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=30, myglobal=30] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=30, myglobal=30, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=30, myglobal=31, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=30, myglobal=31, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=30, myglobal=31, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=30, myglobal=32, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=30, myglobal=32, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=30, myglobal=32, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=30, myglobal=33, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=30, myglobal=33, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=30, myglobal=33, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=30, myglobal=34, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=30, myglobal=34, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=30, myglobal=34, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=30, myglobal=35, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=30, myglobal=35, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=30, myglobal=35, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=30, myglobal=36, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=30, myglobal=36, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=30, myglobal=36, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=30, myglobal=37, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=30, myglobal=37, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=30, myglobal=37, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=30, myglobal=38, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=30, myglobal=38, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=30, myglobal=38, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=30, myglobal=39, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=30, myglobal=39, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=30, myglobal=39, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=30, myglobal=40, mythread={3:0}] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=30, myglobal=40, mythread={3:0}] [L1352] COND FALSE 0 !(i<20) [L1358] 0 \read(mythread) VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=30, myglobal=40] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [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=30, myglobal=40, mythread={3:0}] [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=30, 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=30, myglobal=40] - UnprovableResult [Line: 1342]: 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 with 1 thread instances CFG has 3 procedures, 32 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.7s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1041 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1024 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1067 IncrementalHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 5 mSDtfsCounter, 1067 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1069 GetRequests, 883 SyntacticMatches, 16 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2841 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6866occurred in iteration=9, InterpolantAutomatonStates: 184, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1064 NumberOfCodeBlocks, 1058 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1299 ConstructedInterpolants, 0 QuantifiedInterpolants, 3039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1153 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 3422/5602 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-05-12 13:44:51,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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