./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-06-19_11-23-25.files/mutex-meet-nonrel/pthread-demo-datarace-3.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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-06-19_11-23-25.files/mutex-meet-nonrel/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-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:14:37,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:14:38,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:14:38,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:14:38,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:14:38,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:14:38,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:14:38,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:14:38,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:14:38,080 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:14:38,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:14:38,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:14:38,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:14:38,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:14:38,083 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:14:38,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:14:38,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:14:38,084 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:14:38,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:14:38,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:14:38,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:14:38,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:14:38,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:14:38,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:14:38,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:14:38,086 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:14:38,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:14:38,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:14:38,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:14:38,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:14:38,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:14:38,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:14:38,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:14:38,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:14:38,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:14:38,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:14:38,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:14:38,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:14:38,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:14:38,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:14:38,091 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:14:38,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:14:38,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:14:38,092 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-06-28 02:14:38,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:14:38,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:14:38,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:14:38,383 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:14:38,384 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:14:38,385 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-06-28 02:14:39,554 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:14:39,823 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:14:39,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-06-28 02:14:39,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149e209bf/1865684f599b46688c3a7add12d64dea/FLAG5367ccdf3 [2024-06-28 02:14:39,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149e209bf/1865684f599b46688c3a7add12d64dea [2024-06-28 02:14:39,874 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:14:39,875 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:14:39,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/pthread-demo-datarace-3.yml/witness.yml [2024-06-28 02:14:39,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:14:39,968 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:14:39,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:14:39,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:14:39,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:14:39,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:14:39" (1/2) ... [2024-06-28 02:14:39,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2557bf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:14:39, skipping insertion in model container [2024-06-28 02:14:39,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:14:39" (1/2) ... [2024-06-28 02:14:39,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@db6b7f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:14:39, skipping insertion in model container [2024-06-28 02:14:39,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:14:39" (2/2) ... [2024-06-28 02:14:39,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2557bf41 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:39, skipping insertion in model container [2024-06-28 02:14:39,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:14:39" (2/2) ... [2024-06-28 02:14:39,981 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:14:40,034 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:14:40,035 INFO L97 edCorrectnessWitness]: Location invariant before [L1342-L1345] (! multithreaded || 0 <= myglobal) && (! multithreaded || 0 <= myglobal) [2024-06-28 02:14:40,035 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:14:40,035 INFO L106 edCorrectnessWitness]: ghost_update [L1342-L1342] multithreaded = 1; [2024-06-28 02:14:40,082 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:14:40,295 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-06-28 02:14:40,569 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:14:40,578 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 02:14:40,611 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] Start Parsing Local Start Parsing Local [2024-06-28 02:14:40,659 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:14:40,724 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:14:40,725 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:40 WrapperNode [2024-06-28 02:14:40,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:14:40,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:14:40,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:14:40,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:14:40,734 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 28.06 02:14:40" (1/1) ... [2024-06-28 02:14:40,757 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 28.06 02:14:40" (1/1) ... [2024-06-28 02:14:40,775 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2024-06-28 02:14:40,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:14:40,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:14:40,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:14:40,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:14:40,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:40" (1/1) ... [2024-06-28 02:14:40,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:40" (1/1) ... [2024-06-28 02:14:40,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:40" (1/1) ... [2024-06-28 02:14:40,800 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-28 02:14:40,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:40" (1/1) ... [2024-06-28 02:14:40,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:40" (1/1) ... [2024-06-28 02:14:40,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:40" (1/1) ... [2024-06-28 02:14:40,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:40" (1/1) ... [2024-06-28 02:14:40,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:40" (1/1) ... [2024-06-28 02:14:40,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:40" (1/1) ... [2024-06-28 02:14:40,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:14:40,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:14:40,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:14:40,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:14:40,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:40" (1/1) ... [2024-06-28 02:14:40,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:14:40,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:14:40,843 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-06-28 02:14:40,846 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-06-28 02:14:40,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:14:40,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:14:40,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-06-28 02:14:40,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-06-28 02:14:40,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:14:40,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:14:40,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:14:40,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:14:40,879 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:14:40,995 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:14:40,997 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:14:41,139 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:14:41,139 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:14:41,252 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:14:41,253 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-28 02:14:41,253 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:14:41 BoogieIcfgContainer [2024-06-28 02:14:41,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:14:41,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:14:41,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:14:41,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:14:41,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:14:39" (1/4) ... [2024-06-28 02:14:41,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699a2dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:14:41, skipping insertion in model container [2024-06-28 02:14:41,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:14:39" (2/4) ... [2024-06-28 02:14:41,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699a2dab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:14:41, skipping insertion in model container [2024-06-28 02:14:41,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:14:40" (3/4) ... [2024-06-28 02:14:41,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699a2dab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:14:41, skipping insertion in model container [2024-06-28 02:14:41,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:14:41" (4/4) ... [2024-06-28 02:14:41,268 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-06-28 02:14:41,281 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:14:41,281 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-28 02:14:41,281 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:14:41,320 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-06-28 02:14:41,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 25 transitions, 57 flow [2024-06-28 02:14:41,385 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2024-06-28 02:14:41,385 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-28 02:14:41,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 24 events. 3/24 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2024-06-28 02:14:41,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 25 transitions, 57 flow [2024-06-28 02:14:41,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 21 transitions, 48 flow [2024-06-28 02:14:41,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:14:41,407 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;@10ea987a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:14:41,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-28 02:14:41,410 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:14:41,410 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-06-28 02:14:41,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:14:41,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:41,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-06-28 02:14:41,412 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-28 02:14:41,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:41,417 INFO L85 PathProgramCache]: Analyzing trace with hash 7988, now seen corresponding path program 1 times [2024-06-28 02:14:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:41,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511456865] [2024-06-28 02:14:41,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:41,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:14:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:41,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511456865] [2024-06-28 02:14:41,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511456865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:14:41,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:14:41,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:14:41,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310375084] [2024-06-28 02:14:41,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:14:41,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:14:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:41,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:14:41,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:14:41,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 25 [2024-06-28 02:14:41,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-06-28 02:14:41,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:41,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 25 [2024-06-28 02:14:41,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:41,786 INFO L124 PetriNetUnfolderBase]: 13/40 cut-off events. [2024-06-28 02:14:41,786 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-28 02:14:41,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 40 events. 13/40 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 76 event pairs, 6 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 56. Up to 29 conditions per place. [2024-06-28 02:14:41,789 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 11 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2024-06-28 02:14:41,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 20 transitions, 72 flow [2024-06-28 02:14:41,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:14:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:14:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-06-28 02:14:41,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2024-06-28 02:14:41,802 INFO L175 Difference]: Start difference. First operand has 23 places, 21 transitions, 48 flow. Second operand 3 states and 41 transitions. [2024-06-28 02:14:41,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 20 transitions, 72 flow [2024-06-28 02:14:41,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 20 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:14:41,807 INFO L231 Difference]: Finished difference. Result has 22 places, 20 transitions, 46 flow [2024-06-28 02:14:41,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=22, PETRI_TRANSITIONS=20} [2024-06-28 02:14:41,813 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2024-06-28 02:14:41,813 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 20 transitions, 46 flow [2024-06-28 02:14:41,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-06-28 02:14:41,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:41,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:41,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:14:41,815 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-28 02:14:41,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:41,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1220019524, now seen corresponding path program 1 times [2024-06-28 02:14:41,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:41,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831990326] [2024-06-28 02:14:41,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:41,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:14:41,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:41,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831990326] [2024-06-28 02:14:41,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831990326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:14:41,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:14:41,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:14:41,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987300458] [2024-06-28 02:14:41,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:14:41,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:14:41,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:41,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:14:41,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:14:41,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 25 [2024-06-28 02:14:41,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-06-28 02:14:41,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:41,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 25 [2024-06-28 02:14:41,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:42,025 INFO L124 PetriNetUnfolderBase]: 17/56 cut-off events. [2024-06-28 02:14:42,027 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:14:42,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 56 events. 17/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 4 based on Foata normal form. 4/57 useless extension candidates. Maximal degree in co-relation 89. Up to 30 conditions per place. [2024-06-28 02:14:42,028 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 15 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2024-06-28 02:14:42,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 25 transitions, 90 flow [2024-06-28 02:14:42,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:14:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:14:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2024-06-28 02:14:42,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-06-28 02:14:42,031 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 46 flow. Second operand 3 states and 51 transitions. [2024-06-28 02:14:42,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 25 transitions, 90 flow [2024-06-28 02:14:42,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 25 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:14:42,033 INFO L231 Difference]: Finished difference. Result has 23 places, 21 transitions, 54 flow [2024-06-28 02:14:42,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=23, PETRI_TRANSITIONS=21} [2024-06-28 02:14:42,034 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2024-06-28 02:14:42,034 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 21 transitions, 54 flow [2024-06-28 02:14:42,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-06-28 02:14:42,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:42,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:42,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:14:42,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-28 02:14:42,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:42,042 INFO L85 PathProgramCache]: Analyzing trace with hash -290827500, now seen corresponding path program 1 times [2024-06-28 02:14:42,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:42,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154824755] [2024-06-28 02:14:42,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:42,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:14:42,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:42,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154824755] [2024-06-28 02:14:42,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154824755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:14:42,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:14:42,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:14:42,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273677235] [2024-06-28 02:14:42,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:14:42,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:14:42,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:42,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:14:42,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:14:42,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 25 [2024-06-28 02:14:42,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 54 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-06-28 02:14:42,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:42,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 25 [2024-06-28 02:14:42,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:42,190 INFO L124 PetriNetUnfolderBase]: 25/80 cut-off events. [2024-06-28 02:14:42,190 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-06-28 02:14:42,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 80 events. 25/80 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 203 event pairs, 7 based on Foata normal form. 4/80 useless extension candidates. Maximal degree in co-relation 52. Up to 38 conditions per place. [2024-06-28 02:14:42,193 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 17 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2024-06-28 02:14:42,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 27 transitions, 114 flow [2024-06-28 02:14:42,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:14:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:14:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2024-06-28 02:14:42,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-06-28 02:14:42,196 INFO L175 Difference]: Start difference. First operand has 23 places, 21 transitions, 54 flow. Second operand 3 states and 51 transitions. [2024-06-28 02:14:42,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 27 transitions, 114 flow [2024-06-28 02:14:42,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:14:42,203 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 64 flow [2024-06-28 02:14:42,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=22, 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=64, PETRI_PLACES=25, PETRI_TRANSITIONS=22} [2024-06-28 02:14:42,205 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2024-06-28 02:14:42,205 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 64 flow [2024-06-28 02:14:42,205 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-06-28 02:14:42,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:42,206 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] [2024-06-28 02:14:42,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:14:42,207 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-28 02:14:42,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1859278575, now seen corresponding path program 1 times [2024-06-28 02:14:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:42,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859861265] [2024-06-28 02:14:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:42,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:14:42,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:42,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859861265] [2024-06-28 02:14:42,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859861265] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 02:14:42,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478953665] [2024-06-28 02:14:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:42,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:14:42,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:14:42,308 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-06-28 02:14:42,330 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-06-28 02:14:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:42,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-28 02:14:42,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 02:14:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:14:42,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 02:14:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:14:42,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478953665] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 02:14:42,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 02:14:42,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-06-28 02:14:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662218974] [2024-06-28 02:14:42,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 02:14:42,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:14:42,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:42,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:14:42,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:14:42,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 25 [2024-06-28 02:14:42,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 64 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-28 02:14:42,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:42,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 25 [2024-06-28 02:14:42,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:42,658 INFO L124 PetriNetUnfolderBase]: 67/170 cut-off events. [2024-06-28 02:14:42,659 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2024-06-28 02:14:42,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 170 events. 67/170 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 581 event pairs, 10 based on Foata normal form. 18/186 useless extension candidates. Maximal degree in co-relation 193. Up to 36 conditions per place. [2024-06-28 02:14:42,663 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 35 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2024-06-28 02:14:42,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 48 transitions, 242 flow [2024-06-28 02:14:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:14:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:14:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-28 02:14:42,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66 [2024-06-28 02:14:42,667 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 64 flow. Second operand 6 states and 99 transitions. [2024-06-28 02:14:42,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 48 transitions, 242 flow [2024-06-28 02:14:42,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 48 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:14:42,670 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 102 flow [2024-06-28 02:14:42,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2024-06-28 02:14:42,672 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2024-06-28 02:14:42,672 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 102 flow [2024-06-28 02:14:42,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-06-28 02:14:42,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:42,673 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:42,693 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-06-28 02:14:42,888 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-06-28 02:14:42,889 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-28 02:14:42,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 693286975, now seen corresponding path program 2 times [2024-06-28 02:14:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:42,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545409453] [2024-06-28 02:14:42,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:42,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-06-28 02:14:42,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:42,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545409453] [2024-06-28 02:14:42,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545409453] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 02:14:42,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469288214] [2024-06-28 02:14:42,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 02:14:42,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:14:42,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:14:43,000 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-06-28 02:14:43,015 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-06-28 02:14:43,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 02:14:43,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 02:14:43,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-28 02:14:43,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 02:14:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-06-28 02:14:43,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 02:14:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-06-28 02:14:43,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469288214] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 02:14:43,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 02:14:43,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-06-28 02:14:43,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814479433] [2024-06-28 02:14:43,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 02:14:43,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:14:43,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:43,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:14:43,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:14:43,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 25 [2024-06-28 02:14:43,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-06-28 02:14:43,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:43,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 25 [2024-06-28 02:14:43,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:43,326 INFO L124 PetriNetUnfolderBase]: 92/268 cut-off events. [2024-06-28 02:14:43,326 INFO L125 PetriNetUnfolderBase]: For 603/615 co-relation queries the response was YES. [2024-06-28 02:14:43,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 268 events. 92/268 cut-off events. For 603/615 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1113 event pairs, 12 based on Foata normal form. 21/285 useless extension candidates. Maximal degree in co-relation 403. Up to 76 conditions per place. [2024-06-28 02:14:43,332 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 44 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2024-06-28 02:14:43,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 58 transitions, 416 flow [2024-06-28 02:14:43,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:14:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:14:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-28 02:14:43,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2024-06-28 02:14:43,336 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 102 flow. Second operand 6 states and 98 transitions. [2024-06-28 02:14:43,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 58 transitions, 416 flow [2024-06-28 02:14:43,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 376 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-06-28 02:14:43,343 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 134 flow [2024-06-28 02:14:43,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2024-06-28 02:14:43,345 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 18 predicate places. [2024-06-28 02:14:43,345 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 134 flow [2024-06-28 02:14:43,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-06-28 02:14:43,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:43,345 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:43,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-28 02:14:43,560 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-06-28 02:14:43,561 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-28 02:14:43,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1272523132, now seen corresponding path program 3 times [2024-06-28 02:14:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718754848] [2024-06-28 02:14:43,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:43,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-06-28 02:14:43,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:43,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718754848] [2024-06-28 02:14:43,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718754848] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 02:14:43,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167181020] [2024-06-28 02:14:43,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-28 02:14:43,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:14:43,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:14:43,798 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-06-28 02:14:43,807 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-06-28 02:14:43,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-06-28 02:14:43,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 02:14:43,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-28 02:14:43,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 02:14:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-06-28 02:14:43,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 02:14:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-06-28 02:14:44,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167181020] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 02:14:44,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 02:14:44,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-06-28 02:14:44,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475573182] [2024-06-28 02:14:44,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 02:14:44,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-28 02:14:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:44,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-28 02:14:44,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2024-06-28 02:14:44,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 25 [2024-06-28 02:14:44,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 134 flow. Second operand has 17 states, 17 states have (on average 12.823529411764707) internal successors, (218), 17 states have internal predecessors, (218), 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-06-28 02:14:44,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:44,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 25 [2024-06-28 02:14:44,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:45,155 INFO L124 PetriNetUnfolderBase]: 265/749 cut-off events. [2024-06-28 02:14:45,156 INFO L125 PetriNetUnfolderBase]: For 1942/1969 co-relation queries the response was YES. [2024-06-28 02:14:45,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2360 conditions, 749 events. 265/749 cut-off events. For 1942/1969 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3438 event pairs, 4 based on Foata normal form. 81/828 useless extension candidates. Maximal degree in co-relation 1010. Up to 231 conditions per place. [2024-06-28 02:14:45,165 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 153 selfloop transitions, 138 changer transitions 0/299 dead transitions. [2024-06-28 02:14:45,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 299 transitions, 2232 flow [2024-06-28 02:14:45,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-06-28 02:14:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2024-06-28 02:14:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 1008 transitions. [2024-06-28 02:14:45,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6017910447761194 [2024-06-28 02:14:45,171 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 134 flow. Second operand 67 states and 1008 transitions. [2024-06-28 02:14:45,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 299 transitions, 2232 flow [2024-06-28 02:14:45,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 299 transitions, 2112 flow, removed 54 selfloop flow, removed 1 redundant places. [2024-06-28 02:14:45,185 INFO L231 Difference]: Finished difference. Result has 152 places, 167 transitions, 1560 flow [2024-06-28 02:14:45,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=1560, PETRI_PLACES=152, PETRI_TRANSITIONS=167} [2024-06-28 02:14:45,188 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 129 predicate places. [2024-06-28 02:14:45,188 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 167 transitions, 1560 flow [2024-06-28 02:14:45,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.823529411764707) internal successors, (218), 17 states have internal predecessors, (218), 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-06-28 02:14:45,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:45,189 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:45,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-28 02:14:45,405 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-06-28 02:14:45,406 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-28 02:14:45,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash -878400880, now seen corresponding path program 4 times [2024-06-28 02:14:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:45,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216590842] [2024-06-28 02:14:45,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:45,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-06-28 02:14:45,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:45,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216590842] [2024-06-28 02:14:45,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216590842] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 02:14:45,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044066065] [2024-06-28 02:14:45,710 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-28 02:14:45,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:14:45,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:14:45,711 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-06-28 02:14:45,731 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-06-28 02:14:45,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-28 02:14:45,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 02:14:45,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-28 02:14:45,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 02:14:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-06-28 02:14:45,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 02:14:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-06-28 02:14:46,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044066065] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 02:14:46,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 02:14:46,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2024-06-28 02:14:46,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195846024] [2024-06-28 02:14:46,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 02:14:46,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-06-28 02:14:46,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:46,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-06-28 02:14:46,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-06-28 02:14:46,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 25 [2024-06-28 02:14:46,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 167 transitions, 1560 flow. Second operand has 23 states, 23 states have (on average 13.304347826086957) internal successors, (306), 23 states have internal predecessors, (306), 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-06-28 02:14:46,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:46,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 25 [2024-06-28 02:14:46,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:46,638 INFO L124 PetriNetUnfolderBase]: 505/1380 cut-off events. [2024-06-28 02:14:46,638 INFO L125 PetriNetUnfolderBase]: For 75345/75407 co-relation queries the response was YES. [2024-06-28 02:14:46,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6804 conditions, 1380 events. 505/1380 cut-off events. For 75345/75407 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6642 event pairs, 19 based on Foata normal form. 82/1454 useless extension candidates. Maximal degree in co-relation 5906. Up to 441 conditions per place. [2024-06-28 02:14:46,659 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 334 selfloop transitions, 132 changer transitions 0/474 dead transitions. [2024-06-28 02:14:46,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 474 transitions, 5832 flow [2024-06-28 02:14:46,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-28 02:14:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-28 02:14:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 361 transitions. [2024-06-28 02:14:46,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6563636363636364 [2024-06-28 02:14:46,662 INFO L175 Difference]: Start difference. First operand has 152 places, 167 transitions, 1560 flow. Second operand 22 states and 361 transitions. [2024-06-28 02:14:46,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 474 transitions, 5832 flow [2024-06-28 02:14:46,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 474 transitions, 5610 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-28 02:14:46,797 INFO L231 Difference]: Finished difference. Result has 178 places, 233 transitions, 2558 flow [2024-06-28 02:14:46,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2558, PETRI_PLACES=178, PETRI_TRANSITIONS=233} [2024-06-28 02:14:46,798 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 155 predicate places. [2024-06-28 02:14:46,798 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 233 transitions, 2558 flow [2024-06-28 02:14:46,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 13.304347826086957) internal successors, (306), 23 states have internal predecessors, (306), 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-06-28 02:14:46,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:46,799 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:46,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-28 02:14:47,012 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-06-28 02:14:47,013 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-28 02:14:47,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash 895448624, now seen corresponding path program 5 times [2024-06-28 02:14:47,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:47,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155247647] [2024-06-28 02:14:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-06-28 02:14:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155247647] [2024-06-28 02:14:47,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155247647] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 02:14:47,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160143145] [2024-06-28 02:14:47,235 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-28 02:14:47,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:14:47,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:14:47,237 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-06-28 02:14:47,258 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-06-28 02:14:47,328 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2024-06-28 02:14:47,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 02:14:47,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-28 02:14:47,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 02:14:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-06-28 02:14:47,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 02:14:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-06-28 02:14:47,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160143145] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 02:14:47,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 02:14:47,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-06-28 02:14:47,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543741260] [2024-06-28 02:14:47,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 02:14:47,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-28 02:14:47,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:47,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-28 02:14:47,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2024-06-28 02:14:47,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 25 [2024-06-28 02:14:47,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 233 transitions, 2558 flow. Second operand has 15 states, 15 states have (on average 12.4) internal successors, (186), 15 states have internal predecessors, (186), 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-06-28 02:14:47,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:47,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 25 [2024-06-28 02:14:47,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:48,374 INFO L124 PetriNetUnfolderBase]: 1285/3678 cut-off events. [2024-06-28 02:14:48,374 INFO L125 PetriNetUnfolderBase]: For 90072/90074 co-relation queries the response was YES. [2024-06-28 02:14:48,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16512 conditions, 3678 events. 1285/3678 cut-off events. For 90072/90074 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 22920 event pairs, 187 based on Foata normal form. 345/3879 useless extension candidates. Maximal degree in co-relation 14949. Up to 689 conditions per place. [2024-06-28 02:14:48,418 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 317 selfloop transitions, 144 changer transitions 0/481 dead transitions. [2024-06-28 02:14:48,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 481 transitions, 7136 flow [2024-06-28 02:14:48,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 02:14:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 02:14:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 231 transitions. [2024-06-28 02:14:48,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66 [2024-06-28 02:14:48,420 INFO L175 Difference]: Start difference. First operand has 178 places, 233 transitions, 2558 flow. Second operand 14 states and 231 transitions. [2024-06-28 02:14:48,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 481 transitions, 7136 flow [2024-06-28 02:14:48,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 481 transitions, 6902 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 02:14:48,656 INFO L231 Difference]: Finished difference. Result has 190 places, 300 transitions, 3466 flow [2024-06-28 02:14:48,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2450, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3466, PETRI_PLACES=190, PETRI_TRANSITIONS=300} [2024-06-28 02:14:48,657 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 167 predicate places. [2024-06-28 02:14:48,657 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 300 transitions, 3466 flow [2024-06-28 02:14:48,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.4) internal successors, (186), 15 states have internal predecessors, (186), 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-06-28 02:14:48,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:48,658 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:14:48,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-06-28 02:14:48,927 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-06-28 02:14:48,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-28 02:14:48,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1055218262, now seen corresponding path program 6 times [2024-06-28 02:14:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:48,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007483780] [2024-06-28 02:14:48,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:14:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 520 proven. 210 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-06-28 02:14:49,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:14:49,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007483780] [2024-06-28 02:14:49,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007483780] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 02:14:49,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929608507] [2024-06-28 02:14:49,238 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-28 02:14:49,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:14:49,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:14:49,239 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-06-28 02:14:49,258 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-06-28 02:14:49,349 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2024-06-28 02:14:49,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 02:14:49,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-28 02:14:49,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 02:14:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 520 proven. 210 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-06-28 02:14:49,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 02:14:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 520 proven. 210 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-06-28 02:14:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929608507] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 02:14:49,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 02:14:49,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2024-06-28 02:14:49,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353898377] [2024-06-28 02:14:49,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 02:14:49,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-06-28 02:14:49,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:14:49,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-06-28 02:14:49,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-06-28 02:14:49,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 25 [2024-06-28 02:14:49,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 300 transitions, 3466 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-06-28 02:14:49,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:14:49,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 25 [2024-06-28 02:14:49,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:14:51,479 INFO L124 PetriNetUnfolderBase]: 2045/5846 cut-off events. [2024-06-28 02:14:51,479 INFO L125 PetriNetUnfolderBase]: For 182732/182744 co-relation queries the response was YES. [2024-06-28 02:14:51,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28931 conditions, 5846 events. 2045/5846 cut-off events. For 182732/182744 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 40425 event pairs, 259 based on Foata normal form. 404/6026 useless extension candidates. Maximal degree in co-relation 26634. Up to 1113 conditions per place. [2024-06-28 02:14:51,573 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 509 selfloop transitions, 232 changer transitions 0/761 dead transitions. [2024-06-28 02:14:51,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 761 transitions, 11862 flow [2024-06-28 02:14:51,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-28 02:14:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-28 02:14:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 360 transitions. [2024-06-28 02:14:51,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-06-28 02:14:51,577 INFO L175 Difference]: Start difference. First operand has 190 places, 300 transitions, 3466 flow. Second operand 22 states and 360 transitions. [2024-06-28 02:14:51,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 761 transitions, 11862 flow [2024-06-28 02:14:51,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 761 transitions, 11752 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-28 02:14:51,930 INFO L231 Difference]: Finished difference. Result has 215 places, 389 transitions, 5104 flow [2024-06-28 02:14:51,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3356, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5104, PETRI_PLACES=215, PETRI_TRANSITIONS=389} [2024-06-28 02:14:51,931 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 192 predicate places. [2024-06-28 02:14:51,931 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 389 transitions, 5104 flow [2024-06-28 02:14:51,931 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-06-28 02:14:51,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:14:51,931 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] [2024-06-28 02:14:51,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-06-28 02:14:52,132 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-06-28 02:14:52,133 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-28 02:14:52,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:14:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1028587862, now seen corresponding path program 7 times [2024-06-28 02:14:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:14:52,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126208287] [2024-06-28 02:14:52,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:14:52,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:14:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 02:14:52,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 02:14:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 02:14:52,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 02:14:52,351 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 02:14:52,352 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-06-28 02:14:52,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 3 remaining) [2024-06-28 02:14:52,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-06-28 02:14:52,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:14:52,355 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-06-28 02:14:52,361 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 02:14:52,362 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 02:14:52,535 INFO L507 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-06-28 02:14:52,535 INFO L508 ceAbstractionStarter]: WitnessConsidered=1 [2024-06-28 02:14:52,536 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 02:14:52 BasicIcfg [2024-06-28 02:14:52,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 02:14:52,536 INFO L158 Benchmark]: Toolchain (without parser) took 12568.15ms. Allocated memory was 153.1MB in the beginning and 769.7MB in the end (delta: 616.6MB). Free memory was 78.0MB in the beginning and 558.9MB in the end (delta: -480.9MB). Peak memory consumption was 248.5MB. Max. memory is 16.1GB. [2024-06-28 02:14:52,537 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 02:14:52,537 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 153.1MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 02:14:52,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 756.21ms. Allocated memory is still 153.1MB. Free memory was 77.9MB in the beginning and 82.5MB in the end (delta: -4.6MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-06-28 02:14:52,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.00ms. Allocated memory is still 153.1MB. Free memory was 82.5MB in the beginning and 80.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 02:14:52,538 INFO L158 Benchmark]: Boogie Preprocessor took 35.97ms. Allocated memory is still 153.1MB. Free memory was 80.1MB in the beginning and 77.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 02:14:52,538 INFO L158 Benchmark]: RCFGBuilder took 440.39ms. Allocated memory is still 153.1MB. Free memory was 77.6MB in the beginning and 117.4MB in the end (delta: -39.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-06-28 02:14:52,539 INFO L158 Benchmark]: TraceAbstraction took 11277.01ms. Allocated memory was 153.1MB in the beginning and 769.7MB in the end (delta: 616.6MB). Free memory was 117.4MB in the beginning and 558.9MB in the end (delta: -441.5MB). Peak memory consumption was 286.0MB. Max. memory is 16.1GB. [2024-06-28 02:14:52,540 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.18ms. Allocated memory is still 153.1MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 153.1MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 756.21ms. Allocated memory is still 153.1MB. Free memory was 77.9MB in the beginning and 82.5MB in the end (delta: -4.6MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.00ms. Allocated memory is still 153.1MB. Free memory was 82.5MB in the beginning and 80.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.97ms. Allocated memory is still 153.1MB. Free memory was 80.1MB in the beginning and 77.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 440.39ms. Allocated memory is still 153.1MB. Free memory was 77.6MB in the beginning and 117.4MB in the end (delta: -39.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11277.01ms. Allocated memory was 153.1MB in the beginning and 769.7MB in the end (delta: 616.6MB). Free memory was 117.4MB in the beginning and 558.9MB in the end (delta: -441.5MB). Peak memory consumption was 286.0MB. 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] [L1342] 0 //@ assert ((!multithreaded || (0 <= myglobal)) && (!multithreaded || (0 <= myglobal))); [L1342] 0 //@ ghost multithreaded = 1; VAL [myglobal=0, mythread=-1] [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=0] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=0] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=0, myglobal=0] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=1, myglobal=1] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=4, myglobal=4] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=5, myglobal=5] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=6, myglobal=6] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=7, myglobal=7] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=8, myglobal=8] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=9, myglobal=9] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=10, myglobal=10] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=10, j=10, myglobal=10, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=10, j=10, myglobal=10, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=10, j=10, myglobal=11, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=10, j=10, myglobal=11, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=10, j=10, myglobal=11, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=10, j=10, myglobal=12, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=2, j=10, myglobal=12, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=2, j=10, myglobal=12, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=2, j=10, myglobal=13, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=3, j=10, myglobal=13, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=3, j=10, myglobal=13, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=3, j=10, myglobal=14, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=4, j=10, myglobal=14, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=4, j=10, myglobal=14, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=4, j=10, myglobal=15, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=5, j=10, myglobal=15, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=5, j=10, myglobal=15, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=5, j=10, myglobal=16, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=6, j=10, myglobal=16, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=6, j=10, myglobal=16, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=6, j=10, myglobal=17, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=7, j=10, myglobal=17, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=7, j=10, myglobal=17, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=7, j=10, myglobal=18, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=8, j=10, myglobal=18, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=8, j=10, myglobal=18, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=8, j=10, myglobal=19, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=9, j=10, myglobal=19, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=9, j=10, myglobal=19, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=9, j=10, myglobal=20, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=10, j=10, myglobal=20, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=10, j=10, myglobal=20, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=10, j=10, myglobal=21, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=11, j=10, myglobal=21, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=11, j=10, myglobal=21, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=11, j=10, myglobal=22, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=12, j=10, myglobal=22, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=12, j=10, myglobal=22, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=12, j=10, myglobal=23, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=13, j=10, myglobal=23, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=13, j=10, myglobal=23, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=13, j=10, myglobal=24, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=14, j=10, myglobal=24, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=14, j=10, myglobal=24, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=14, j=10, myglobal=25, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=15, j=10, myglobal=25, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=15, j=10, myglobal=25, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=15, j=10, myglobal=26, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=16, j=10, myglobal=26, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=16, j=10, myglobal=26, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=16, j=10, myglobal=27, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=17, j=10, myglobal=27, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=17, j=10, myglobal=27, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=17, j=10, myglobal=28, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=18, j=10, myglobal=28, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=18, j=10, myglobal=28, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=18, j=10, myglobal=29, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=19, j=10, myglobal=29, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=19, j=10, myglobal=29, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=19, j=10, myglobal=30, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=10, myglobal=30, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=10, myglobal=30] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=31, myglobal=31] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=32, myglobal=32] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=33, myglobal=33] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=34, myglobal=34] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=35, myglobal=35] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=36, myglobal=36] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=37, myglobal=37] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=38, myglobal=38] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=39, myglobal=39] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=40, myglobal=40] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [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=40, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=40, 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=40, 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, 31 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: 11.0s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 897 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 883 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 880 IncrementalHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2 mSDtfsCounter, 880 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1036 GetRequests, 895 SyntacticMatches, 8 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5104occurred in iteration=9, InterpolantAutomatonStates: 146, 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.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1091 NumberOfCodeBlocks, 1076 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1343 ConstructedInterpolants, 0 QuantifiedInterpolants, 2707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1037 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 6073/7609 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-06-28 02:14:52,572 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