/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 20:08:50,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 20:08:50,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 20:08:50,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 20:08:50,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 20:08:50,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 20:08:50,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 20:08:50,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 20:08:50,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 20:08:50,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 20:08:50,226 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 20:08:50,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 20:08:50,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 20:08:50,227 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 20:08:50,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 20:08:50,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 20:08:50,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 20:08:50,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 20:08:50,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 20:08:50,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 20:08:50,229 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 20:08:50,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 20:08:50,233 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 20:08:50,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 20:08:50,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 20:08:50,234 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 20:08:50,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 20:08:50,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 20:08:50,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 20:08:50,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 20:08:50,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 20:08:50,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 20:08:50,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 20:08:50,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 20:08:50,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 20:08:50,236 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 20:08:50,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 20:08:50,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 20:08:50,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 20:08:50,600 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 20:08:50,601 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 20:08:50,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-08-25 20:08:51,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 20:08:52,093 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 20:08:52,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-08-25 20:08:52,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284e8221e/1c5d6ce2ba1d4275bfcdf6dde30c6890/FLAG34eeea1f7 [2023-08-25 20:08:52,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284e8221e/1c5d6ce2ba1d4275bfcdf6dde30c6890 [2023-08-25 20:08:52,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 20:08:52,126 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 20:08:52,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 20:08:52,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 20:08:52,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 20:08:52,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0f076f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52, skipping insertion in model container [2023-08-25 20:08:52,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,166 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 20:08:52,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 20:08:52,410 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 20:08:52,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 20:08:52,489 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 20:08:52,489 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 20:08:52,495 INFO L206 MainTranslator]: Completed translation [2023-08-25 20:08:52,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52 WrapperNode [2023-08-25 20:08:52,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 20:08:52,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 20:08:52,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 20:08:52,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 20:08:52,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,570 INFO L138 Inliner]: procedures = 25, calls = 69, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 734 [2023-08-25 20:08:52,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 20:08:52,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 20:08:52,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 20:08:52,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 20:08:52,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 20:08:52,660 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 20:08:52,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 20:08:52,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 20:08:52,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52" (1/1) ... [2023-08-25 20:08:52,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 20:08:52,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:08:52,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 20:08:52,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 20:08:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 20:08:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 20:08:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 20:08:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 20:08:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 20:08:52,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 20:08:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 20:08:52,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 20:08:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 20:08:52,740 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 20:08:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 20:08:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 20:08:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 20:08:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 20:08:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 20:08:52,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 20:08:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 20:08:52,743 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 20:08:52,885 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 20:08:52,887 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 20:08:53,762 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 20:08:54,554 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 20:08:54,554 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-25 20:08:54,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:08:54 BoogieIcfgContainer [2023-08-25 20:08:54,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 20:08:54,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 20:08:54,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 20:08:54,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 20:08:54,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:08:52" (1/3) ... [2023-08-25 20:08:54,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbf644b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:08:54, skipping insertion in model container [2023-08-25 20:08:54,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:52" (2/3) ... [2023-08-25 20:08:54,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbf644b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:08:54, skipping insertion in model container [2023-08-25 20:08:54,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:08:54" (3/3) ... [2023-08-25 20:08:54,564 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2023-08-25 20:08:54,579 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 20:08:54,580 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 117 error locations. [2023-08-25 20:08:54,580 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 20:08:54,777 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-25 20:08:54,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 469 places, 478 transitions, 980 flow [2023-08-25 20:08:55,001 INFO L124 PetriNetUnfolderBase]: 19/475 cut-off events. [2023-08-25 20:08:55,001 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 20:08:55,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 475 events. 19/475 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 720 event pairs, 0 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 395. Up to 2 conditions per place. [2023-08-25 20:08:55,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 469 places, 478 transitions, 980 flow [2023-08-25 20:08:55,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 455 places, 464 transitions, 946 flow [2023-08-25 20:08:55,025 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 20:08:55,037 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 455 places, 464 transitions, 946 flow [2023-08-25 20:08:55,040 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 455 places, 464 transitions, 946 flow [2023-08-25 20:08:55,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 455 places, 464 transitions, 946 flow [2023-08-25 20:08:55,121 INFO L124 PetriNetUnfolderBase]: 19/464 cut-off events. [2023-08-25 20:08:55,121 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 20:08:55,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 464 events. 19/464 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 721 event pairs, 0 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 395. Up to 2 conditions per place. [2023-08-25 20:08:55,131 INFO L119 LiptonReduction]: Number of co-enabled transitions 14832 [2023-08-25 20:09:10,276 INFO L134 LiptonReduction]: Checked pairs total: 108616 [2023-08-25 20:09:10,277 INFO L136 LiptonReduction]: Total number of compositions: 484 [2023-08-25 20:09:10,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 20:09:10,299 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b27f30, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 20:09:10,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 208 error locations. [2023-08-25 20:09:10,301 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 20:09:10,301 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 20:09:10,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 20:09:10,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:10,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 20:09:10,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:10,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:10,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2927, now seen corresponding path program 1 times [2023-08-25 20:09:10,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:10,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540221455] [2023-08-25 20:09:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:10,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:09:10,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:10,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540221455] [2023-08-25 20:09:10,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540221455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:10,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:09:10,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 20:09:10,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980942287] [2023-08-25 20:09:10,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:10,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 20:09:10,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:10,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 20:09:10,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 20:09:10,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 962 [2023-08-25 20:09:10,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 158 transitions, 334 flow. Second operand has 2 states, 2 states have (on average 362.5) internal successors, (725), 2 states have internal predecessors, (725), 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) [2023-08-25 20:09:10,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:10,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 962 [2023-08-25 20:09:10,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:10,670 INFO L124 PetriNetUnfolderBase]: 341/636 cut-off events. [2023-08-25 20:09:10,670 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-08-25 20:09:10,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 636 events. 341/636 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2399 event pairs, 228 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 965. Up to 502 conditions per place. [2023-08-25 20:09:10,675 INFO L140 encePairwiseOnDemand]: 849/962 looper letters, 30 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2023-08-25 20:09:10,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 168 flow [2023-08-25 20:09:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 20:09:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 20:09:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 867 transitions. [2023-08-25 20:09:10,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4506237006237006 [2023-08-25 20:09:10,690 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 867 transitions. [2023-08-25 20:09:10,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 867 transitions. [2023-08-25 20:09:10,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:10,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 867 transitions. [2023-08-25 20:09:10,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 433.5) internal successors, (867), 2 states have internal predecessors, (867), 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) [2023-08-25 20:09:10,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 962.0) internal successors, (2886), 3 states have internal predecessors, (2886), 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) [2023-08-25 20:09:10,706 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 962.0) internal successors, (2886), 3 states have internal predecessors, (2886), 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) [2023-08-25 20:09:10,708 INFO L175 Difference]: Start difference. First operand has 162 places, 158 transitions, 334 flow. Second operand 2 states and 867 transitions. [2023-08-25 20:09:10,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 168 flow [2023-08-25 20:09:10,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 156 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 20:09:10,712 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 96 flow [2023-08-25 20:09:10,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2023-08-25 20:09:10,717 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -118 predicate places. [2023-08-25 20:09:10,717 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 96 flow [2023-08-25 20:09:10,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 362.5) internal successors, (725), 2 states have internal predecessors, (725), 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) [2023-08-25 20:09:10,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:10,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:10,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 20:09:10,718 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:10,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:10,725 INFO L85 PathProgramCache]: Analyzing trace with hash -651209593, now seen corresponding path program 1 times [2023-08-25 20:09:10,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:10,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696499835] [2023-08-25 20:09:10,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:09:11,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:11,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696499835] [2023-08-25 20:09:11,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696499835] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:11,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:09:11,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 20:09:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205781703] [2023-08-25 20:09:11,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:11,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 20:09:11,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:11,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 20:09:11,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 20:09:11,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 962 [2023-08-25 20:09:11,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 322.3333333333333) internal successors, (1934), 6 states have internal predecessors, (1934), 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) [2023-08-25 20:09:11,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:11,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 962 [2023-08-25 20:09:11,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:12,082 INFO L124 PetriNetUnfolderBase]: 986/1386 cut-off events. [2023-08-25 20:09:12,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 20:09:12,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2796 conditions, 1386 events. 986/1386 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4284 event pairs, 104 based on Foata normal form. 0/1070 useless extension candidates. Maximal degree in co-relation 2793. Up to 593 conditions per place. [2023-08-25 20:09:12,088 INFO L140 encePairwiseOnDemand]: 957/962 looper letters, 84 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2023-08-25 20:09:12,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 88 transitions, 358 flow [2023-08-25 20:09:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 20:09:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 20:09:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2009 transitions. [2023-08-25 20:09:12,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3480595980595981 [2023-08-25 20:09:12,095 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2009 transitions. [2023-08-25 20:09:12,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2009 transitions. [2023-08-25 20:09:12,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:12,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2009 transitions. [2023-08-25 20:09:12,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 334.8333333333333) internal successors, (2009), 6 states have internal predecessors, (2009), 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) [2023-08-25 20:09:12,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 962.0) internal successors, (6734), 7 states have internal predecessors, (6734), 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) [2023-08-25 20:09:12,112 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 962.0) internal successors, (6734), 7 states have internal predecessors, (6734), 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) [2023-08-25 20:09:12,112 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 96 flow. Second operand 6 states and 2009 transitions. [2023-08-25 20:09:12,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 88 transitions, 358 flow [2023-08-25 20:09:12,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 88 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 20:09:12,115 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 102 flow [2023-08-25 20:09:12,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2023-08-25 20:09:12,117 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -114 predicate places. [2023-08-25 20:09:12,117 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 102 flow [2023-08-25 20:09:12,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 322.3333333333333) internal successors, (1934), 6 states have internal predecessors, (1934), 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) [2023-08-25 20:09:12,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:12,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:12,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 20:09:12,127 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:12,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1891248647, now seen corresponding path program 1 times [2023-08-25 20:09:12,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192123604] [2023-08-25 20:09:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:09:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192123604] [2023-08-25 20:09:12,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192123604] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:12,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:09:12,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 20:09:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638507262] [2023-08-25 20:09:12,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:12,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 20:09:12,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:12,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 20:09:12,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 20:09:12,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 962 [2023-08-25 20:09:12,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 102 flow. Second operand has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 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) [2023-08-25 20:09:12,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:12,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 962 [2023-08-25 20:09:12,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:13,142 INFO L124 PetriNetUnfolderBase]: 968/1359 cut-off events. [2023-08-25 20:09:13,142 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-08-25 20:09:13,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 1359 events. 968/1359 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4143 event pairs, 596 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 2919. Up to 1181 conditions per place. [2023-08-25 20:09:13,148 INFO L140 encePairwiseOnDemand]: 957/962 looper letters, 63 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-25 20:09:13,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 282 flow [2023-08-25 20:09:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 20:09:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 20:09:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1988 transitions. [2023-08-25 20:09:13,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3444213444213444 [2023-08-25 20:09:13,154 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1988 transitions. [2023-08-25 20:09:13,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1988 transitions. [2023-08-25 20:09:13,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:13,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1988 transitions. [2023-08-25 20:09:13,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 331.3333333333333) internal successors, (1988), 6 states have internal predecessors, (1988), 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) [2023-08-25 20:09:13,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 962.0) internal successors, (6734), 7 states have internal predecessors, (6734), 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) [2023-08-25 20:09:13,171 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 962.0) internal successors, (6734), 7 states have internal predecessors, (6734), 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) [2023-08-25 20:09:13,171 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 102 flow. Second operand 6 states and 1988 transitions. [2023-08-25 20:09:13,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 282 flow [2023-08-25 20:09:13,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 275 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 20:09:13,176 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 101 flow [2023-08-25 20:09:13,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-08-25 20:09:13,177 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -114 predicate places. [2023-08-25 20:09:13,177 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 101 flow [2023-08-25 20:09:13,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 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) [2023-08-25 20:09:13,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:13,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:13,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 20:09:13,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:13,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1287062895, now seen corresponding path program 1 times [2023-08-25 20:09:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:13,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017877843] [2023-08-25 20:09:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:13,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:09:13,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017877843] [2023-08-25 20:09:13,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017877843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:13,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:09:13,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 20:09:13,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675444851] [2023-08-25 20:09:13,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:13,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 20:09:13,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:13,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 20:09:13,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 20:09:13,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 962 [2023-08-25 20:09:13,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 101 flow. Second operand has 6 states, 6 states have (on average 324.6666666666667) internal successors, (1948), 6 states have internal predecessors, (1948), 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) [2023-08-25 20:09:13,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:13,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 962 [2023-08-25 20:09:13,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:14,190 INFO L124 PetriNetUnfolderBase]: 965/1353 cut-off events. [2023-08-25 20:09:14,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 20:09:14,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 1353 events. 965/1353 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4126 event pairs, 658 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 2808. Up to 1322 conditions per place. [2023-08-25 20:09:14,195 INFO L140 encePairwiseOnDemand]: 957/962 looper letters, 50 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-08-25 20:09:14,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 231 flow [2023-08-25 20:09:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 20:09:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 20:09:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1975 transitions. [2023-08-25 20:09:14,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3421690921690922 [2023-08-25 20:09:14,206 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1975 transitions. [2023-08-25 20:09:14,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1975 transitions. [2023-08-25 20:09:14,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:14,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1975 transitions. [2023-08-25 20:09:14,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 329.1666666666667) internal successors, (1975), 6 states have internal predecessors, (1975), 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) [2023-08-25 20:09:14,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 962.0) internal successors, (6734), 7 states have internal predecessors, (6734), 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) [2023-08-25 20:09:14,223 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 962.0) internal successors, (6734), 7 states have internal predecessors, (6734), 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) [2023-08-25 20:09:14,223 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 101 flow. Second operand 6 states and 1975 transitions. [2023-08-25 20:09:14,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 231 flow [2023-08-25 20:09:14,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 20:09:14,227 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 100 flow [2023-08-25 20:09:14,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2023-08-25 20:09:14,228 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -114 predicate places. [2023-08-25 20:09:14,228 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 100 flow [2023-08-25 20:09:14,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.6666666666667) internal successors, (1948), 6 states have internal predecessors, (1948), 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) [2023-08-25 20:09:14,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:14,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:14,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 20:09:14,230 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:14,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash 892642556, now seen corresponding path program 1 times [2023-08-25 20:09:14,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:14,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770904805] [2023-08-25 20:09:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:14,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:09:14,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:14,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770904805] [2023-08-25 20:09:14,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770904805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:14,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:09:14,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 20:09:14,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961242674] [2023-08-25 20:09:14,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:14,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 20:09:14,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:14,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 20:09:14,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 20:09:14,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 962 [2023-08-25 20:09:14,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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) [2023-08-25 20:09:14,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:14,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 962 [2023-08-25 20:09:14,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:14,684 INFO L124 PetriNetUnfolderBase]: 451/718 cut-off events. [2023-08-25 20:09:14,684 INFO L125 PetriNetUnfolderBase]: For 26/29 co-relation queries the response was YES. [2023-08-25 20:09:14,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 718 events. 451/718 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2571 event pairs, 73 based on Foata normal form. 2/540 useless extension candidates. Maximal degree in co-relation 1436. Up to 548 conditions per place. [2023-08-25 20:09:14,688 INFO L140 encePairwiseOnDemand]: 957/962 looper letters, 42 selfloop transitions, 4 changer transitions 1/59 dead transitions. [2023-08-25 20:09:14,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 235 flow [2023-08-25 20:09:14,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 20:09:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 20:09:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1125 transitions. [2023-08-25 20:09:14,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3898128898128898 [2023-08-25 20:09:14,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1125 transitions. [2023-08-25 20:09:14,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1125 transitions. [2023-08-25 20:09:14,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:14,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1125 transitions. [2023-08-25 20:09:14,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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) [2023-08-25 20:09:14,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 962.0) internal successors, (3848), 4 states have internal predecessors, (3848), 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) [2023-08-25 20:09:14,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 962.0) internal successors, (3848), 4 states have internal predecessors, (3848), 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) [2023-08-25 20:09:14,700 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 100 flow. Second operand 3 states and 1125 transitions. [2023-08-25 20:09:14,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 235 flow [2023-08-25 20:09:14,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 226 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 20:09:14,703 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 119 flow [2023-08-25 20:09:14,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-25 20:09:14,704 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -115 predicate places. [2023-08-25 20:09:14,705 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 119 flow [2023-08-25 20:09:14,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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) [2023-08-25 20:09:14,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:14,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:14,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 20:09:14,706 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:14,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:14,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1697532785, now seen corresponding path program 1 times [2023-08-25 20:09:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:14,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995339131] [2023-08-25 20:09:14,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:14,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:09:14,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995339131] [2023-08-25 20:09:14,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995339131] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:14,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:09:14,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 20:09:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268777929] [2023-08-25 20:09:14,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:14,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 20:09:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:14,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 20:09:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 20:09:14,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 962 [2023-08-25 20:09:14,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 310.25) internal successors, (1241), 4 states have internal predecessors, (1241), 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) [2023-08-25 20:09:14,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:14,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 962 [2023-08-25 20:09:14,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:15,196 INFO L124 PetriNetUnfolderBase]: 516/1010 cut-off events. [2023-08-25 20:09:15,196 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-08-25 20:09:15,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2151 conditions, 1010 events. 516/1010 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4516 event pairs, 359 based on Foata normal form. 36/973 useless extension candidates. Maximal degree in co-relation 2146. Up to 667 conditions per place. [2023-08-25 20:09:15,201 INFO L140 encePairwiseOnDemand]: 952/962 looper letters, 32 selfloop transitions, 2 changer transitions 24/70 dead transitions. [2023-08-25 20:09:15,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 294 flow [2023-08-25 20:09:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 20:09:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 20:09:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1583 transitions. [2023-08-25 20:09:15,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3291060291060291 [2023-08-25 20:09:15,206 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1583 transitions. [2023-08-25 20:09:15,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1583 transitions. [2023-08-25 20:09:15,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:15,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1583 transitions. [2023-08-25 20:09:15,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 316.6) internal successors, (1583), 5 states have internal predecessors, (1583), 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) [2023-08-25 20:09:15,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 962.0) internal successors, (5772), 6 states have internal predecessors, (5772), 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) [2023-08-25 20:09:15,217 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 962.0) internal successors, (5772), 6 states have internal predecessors, (5772), 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) [2023-08-25 20:09:15,217 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 119 flow. Second operand 5 states and 1583 transitions. [2023-08-25 20:09:15,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 294 flow [2023-08-25 20:09:15,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 20:09:15,219 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 143 flow [2023-08-25 20:09:15,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-25 20:09:15,220 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -109 predicate places. [2023-08-25 20:09:15,220 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 143 flow [2023-08-25 20:09:15,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 310.25) internal successors, (1241), 4 states have internal predecessors, (1241), 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) [2023-08-25 20:09:15,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:15,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:15,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 20:09:15,221 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:15,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:15,221 INFO L85 PathProgramCache]: Analyzing trace with hash 42097098, now seen corresponding path program 1 times [2023-08-25 20:09:15,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:15,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902571240] [2023-08-25 20:09:15,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:15,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 20:09:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:15,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902571240] [2023-08-25 20:09:15,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902571240] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:15,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:09:15,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 20:09:15,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084883134] [2023-08-25 20:09:15,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:15,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 20:09:15,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:15,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 20:09:15,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 20:09:15,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 962 [2023-08-25 20:09:15,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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) [2023-08-25 20:09:15,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:15,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 962 [2023-08-25 20:09:15,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:15,546 INFO L124 PetriNetUnfolderBase]: 533/955 cut-off events. [2023-08-25 20:09:15,547 INFO L125 PetriNetUnfolderBase]: For 290/323 co-relation queries the response was YES. [2023-08-25 20:09:15,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 955 events. 533/955 cut-off events. For 290/323 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4010 event pairs, 183 based on Foata normal form. 50/993 useless extension candidates. Maximal degree in co-relation 2188. Up to 512 conditions per place. [2023-08-25 20:09:15,552 INFO L140 encePairwiseOnDemand]: 959/962 looper letters, 49 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-25 20:09:15,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 292 flow [2023-08-25 20:09:15,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 20:09:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 20:09:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1123 transitions. [2023-08-25 20:09:15,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3891198891198891 [2023-08-25 20:09:15,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1123 transitions. [2023-08-25 20:09:15,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1123 transitions. [2023-08-25 20:09:15,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:15,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1123 transitions. [2023-08-25 20:09:15,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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) [2023-08-25 20:09:15,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 962.0) internal successors, (3848), 4 states have internal predecessors, (3848), 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) [2023-08-25 20:09:15,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 962.0) internal successors, (3848), 4 states have internal predecessors, (3848), 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) [2023-08-25 20:09:15,564 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 143 flow. Second operand 3 states and 1123 transitions. [2023-08-25 20:09:15,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 292 flow [2023-08-25 20:09:15,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 280 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-25 20:09:15,566 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 139 flow [2023-08-25 20:09:15,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-08-25 20:09:15,567 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -110 predicate places. [2023-08-25 20:09:15,567 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 139 flow [2023-08-25 20:09:15,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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) [2023-08-25 20:09:15,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:15,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:15,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 20:09:15,568 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:15,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1095773221, now seen corresponding path program 1 times [2023-08-25 20:09:15,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:15,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667725127] [2023-08-25 20:09:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 20:09:16,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667725127] [2023-08-25 20:09:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667725127] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:16,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:09:16,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 20:09:16,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400649214] [2023-08-25 20:09:16,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:16,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 20:09:16,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:16,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 20:09:16,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-25 20:09:16,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 962 [2023-08-25 20:09:16,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 360.5) internal successors, (1442), 4 states have internal predecessors, (1442), 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) [2023-08-25 20:09:16,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:16,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 962 [2023-08-25 20:09:16,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:16,452 INFO L124 PetriNetUnfolderBase]: 447/781 cut-off events. [2023-08-25 20:09:16,452 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2023-08-25 20:09:16,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 781 events. 447/781 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3078 event pairs, 95 based on Foata normal form. 14/788 useless extension candidates. Maximal degree in co-relation 1909. Up to 562 conditions per place. [2023-08-25 20:09:16,456 INFO L140 encePairwiseOnDemand]: 959/962 looper letters, 39 selfloop transitions, 2 changer transitions 6/59 dead transitions. [2023-08-25 20:09:16,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 264 flow [2023-08-25 20:09:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 20:09:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 20:09:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1111 transitions. [2023-08-25 20:09:16,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38496188496188494 [2023-08-25 20:09:16,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1111 transitions. [2023-08-25 20:09:16,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1111 transitions. [2023-08-25 20:09:16,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:16,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1111 transitions. [2023-08-25 20:09:16,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 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) [2023-08-25 20:09:16,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 962.0) internal successors, (3848), 4 states have internal predecessors, (3848), 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) [2023-08-25 20:09:16,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 962.0) internal successors, (3848), 4 states have internal predecessors, (3848), 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) [2023-08-25 20:09:16,468 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 139 flow. Second operand 3 states and 1111 transitions. [2023-08-25 20:09:16,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 264 flow [2023-08-25 20:09:16,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 20:09:16,470 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 137 flow [2023-08-25 20:09:16,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-25 20:09:16,472 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -109 predicate places. [2023-08-25 20:09:16,472 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 137 flow [2023-08-25 20:09:16,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 360.5) internal successors, (1442), 4 states have internal predecessors, (1442), 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) [2023-08-25 20:09:16,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:16,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:16,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 20:09:16,473 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:16,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1676626478, now seen corresponding path program 1 times [2023-08-25 20:09:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:16,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943302548] [2023-08-25 20:09:16,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:16,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 20:09:16,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:16,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943302548] [2023-08-25 20:09:16,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943302548] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:16,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:09:16,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 20:09:16,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038751805] [2023-08-25 20:09:16,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:16,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 20:09:16,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:16,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 20:09:16,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 20:09:16,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 962 [2023-08-25 20:09:16,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 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) [2023-08-25 20:09:16,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:16,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 962 [2023-08-25 20:09:16,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:16,772 INFO L124 PetriNetUnfolderBase]: 355/631 cut-off events. [2023-08-25 20:09:16,772 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2023-08-25 20:09:16,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 631 events. 355/631 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2153 event pairs, 143 based on Foata normal form. 14/640 useless extension candidates. Maximal degree in co-relation 1494. Up to 458 conditions per place. [2023-08-25 20:09:16,776 INFO L140 encePairwiseOnDemand]: 959/962 looper letters, 34 selfloop transitions, 2 changer transitions 7/55 dead transitions. [2023-08-25 20:09:16,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 248 flow [2023-08-25 20:09:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 20:09:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 20:09:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2023-08-25 20:09:16,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38634788634788636 [2023-08-25 20:09:16,779 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1115 transitions. [2023-08-25 20:09:16,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1115 transitions. [2023-08-25 20:09:16,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:16,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1115 transitions. [2023-08-25 20:09:16,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 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) [2023-08-25 20:09:16,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 962.0) internal successors, (3848), 4 states have internal predecessors, (3848), 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) [2023-08-25 20:09:16,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 962.0) internal successors, (3848), 4 states have internal predecessors, (3848), 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) [2023-08-25 20:09:16,786 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 137 flow. Second operand 3 states and 1115 transitions. [2023-08-25 20:09:16,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 248 flow [2023-08-25 20:09:16,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 20:09:16,790 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 147 flow [2023-08-25 20:09:16,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-08-25 20:09:16,791 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -108 predicate places. [2023-08-25 20:09:16,791 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 147 flow [2023-08-25 20:09:16,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 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) [2023-08-25 20:09:16,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:16,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:16,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 20:09:16,792 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:16,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1190259519, now seen corresponding path program 1 times [2023-08-25 20:09:16,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:16,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216908955] [2023-08-25 20:09:16,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:16,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 20:09:17,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:17,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216908955] [2023-08-25 20:09:17,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216908955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:17,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:09:17,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 20:09:17,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001060900] [2023-08-25 20:09:17,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:17,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 20:09:17,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:17,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 20:09:17,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 20:09:17,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 962 [2023-08-25 20:09:17,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 311.5) internal successors, (1246), 4 states have internal predecessors, (1246), 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) [2023-08-25 20:09:17,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:17,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 962 [2023-08-25 20:09:17,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:17,530 INFO L124 PetriNetUnfolderBase]: 428/869 cut-off events. [2023-08-25 20:09:17,531 INFO L125 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2023-08-25 20:09:17,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 869 events. 428/869 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3776 event pairs, 325 based on Foata normal form. 12/873 useless extension candidates. Maximal degree in co-relation 2041. Up to 539 conditions per place. [2023-08-25 20:09:17,535 INFO L140 encePairwiseOnDemand]: 957/962 looper letters, 32 selfloop transitions, 3 changer transitions 19/66 dead transitions. [2023-08-25 20:09:17,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 318 flow [2023-08-25 20:09:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 20:09:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 20:09:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1270 transitions. [2023-08-25 20:09:17,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33004158004158 [2023-08-25 20:09:17,539 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1270 transitions. [2023-08-25 20:09:17,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1270 transitions. [2023-08-25 20:09:17,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:17,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1270 transitions. [2023-08-25 20:09:17,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 317.5) internal successors, (1270), 4 states have internal predecessors, (1270), 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) [2023-08-25 20:09:17,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 962.0) internal successors, (4810), 5 states have internal predecessors, (4810), 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) [2023-08-25 20:09:17,547 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 962.0) internal successors, (4810), 5 states have internal predecessors, (4810), 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) [2023-08-25 20:09:17,547 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 147 flow. Second operand 4 states and 1270 transitions. [2023-08-25 20:09:17,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 318 flow [2023-08-25 20:09:17,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 311 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-25 20:09:17,550 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 161 flow [2023-08-25 20:09:17,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-08-25 20:09:17,551 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -104 predicate places. [2023-08-25 20:09:17,551 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 161 flow [2023-08-25 20:09:17,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.5) internal successors, (1246), 4 states have internal predecessors, (1246), 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) [2023-08-25 20:09:17,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:17,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:17,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 20:09:17,552 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:17,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:17,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1621686559, now seen corresponding path program 1 times [2023-08-25 20:09:17,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:17,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553622652] [2023-08-25 20:09:17,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:17,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 20:09:18,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:18,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553622652] [2023-08-25 20:09:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553622652] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 20:09:18,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230170759] [2023-08-25 20:09:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:18,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:09:18,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:09:18,135 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) [2023-08-25 20:09:18,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 20:09:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:18,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-25 20:09:18,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 20:09:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 20:09:18,567 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 20:09:18,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230170759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:18,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 20:09:18,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2023-08-25 20:09:18,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476917449] [2023-08-25 20:09:18,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:18,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 20:09:18,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:18,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 20:09:18,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-25 20:09:18,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 962 [2023-08-25 20:09:18,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 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) [2023-08-25 20:09:18,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:18,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 962 [2023-08-25 20:09:18,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:18,846 INFO L124 PetriNetUnfolderBase]: 433/881 cut-off events. [2023-08-25 20:09:18,846 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2023-08-25 20:09:18,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 881 events. 433/881 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3829 event pairs, 329 based on Foata normal form. 22/896 useless extension candidates. Maximal degree in co-relation 2042. Up to 542 conditions per place. [2023-08-25 20:09:18,851 INFO L140 encePairwiseOnDemand]: 954/962 looper letters, 32 selfloop transitions, 4 changer transitions 24/72 dead transitions. [2023-08-25 20:09:18,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 366 flow [2023-08-25 20:09:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 20:09:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 20:09:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1583 transitions. [2023-08-25 20:09:18,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3291060291060291 [2023-08-25 20:09:18,857 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1583 transitions. [2023-08-25 20:09:18,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1583 transitions. [2023-08-25 20:09:18,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:18,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1583 transitions. [2023-08-25 20:09:18,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 316.6) internal successors, (1583), 5 states have internal predecessors, (1583), 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) [2023-08-25 20:09:18,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 962.0) internal successors, (5772), 6 states have internal predecessors, (5772), 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) [2023-08-25 20:09:18,867 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 962.0) internal successors, (5772), 6 states have internal predecessors, (5772), 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) [2023-08-25 20:09:18,867 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 161 flow. Second operand 5 states and 1583 transitions. [2023-08-25 20:09:18,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 366 flow [2023-08-25 20:09:18,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 345 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-25 20:09:18,869 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 175 flow [2023-08-25 20:09:18,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-08-25 20:09:18,870 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -100 predicate places. [2023-08-25 20:09:18,870 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 175 flow [2023-08-25 20:09:18,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 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) [2023-08-25 20:09:18,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:18,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:18,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-25 20:09:19,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-25 20:09:19,082 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:19,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash 861439426, now seen corresponding path program 1 times [2023-08-25 20:09:19,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:19,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695423587] [2023-08-25 20:09:19,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:19,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 20:09:19,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:19,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695423587] [2023-08-25 20:09:19,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695423587] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 20:09:19,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996741265] [2023-08-25 20:09:19,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:19,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:09:19,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:09:19,664 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) [2023-08-25 20:09:19,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 20:09:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:20,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-25 20:09:20,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 20:09:20,263 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 156 [2023-08-25 20:09:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 20:09:20,372 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 20:09:20,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996741265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:20,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 20:09:20,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-25 20:09:20,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834467615] [2023-08-25 20:09:20,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:20,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 20:09:20,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:20,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 20:09:20,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 20:09:20,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 962 [2023-08-25 20:09:20,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 354.6) internal successors, (1773), 5 states have internal predecessors, (1773), 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) [2023-08-25 20:09:20,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:20,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 962 [2023-08-25 20:09:20,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:20,834 INFO L124 PetriNetUnfolderBase]: 901/1543 cut-off events. [2023-08-25 20:09:20,834 INFO L125 PetriNetUnfolderBase]: For 1011/1011 co-relation queries the response was YES. [2023-08-25 20:09:20,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4047 conditions, 1543 events. 901/1543 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6452 event pairs, 183 based on Foata normal form. 36/1576 useless extension candidates. Maximal degree in co-relation 4034. Up to 498 conditions per place. [2023-08-25 20:09:20,844 INFO L140 encePairwiseOnDemand]: 957/962 looper letters, 65 selfloop transitions, 9 changer transitions 7/93 dead transitions. [2023-08-25 20:09:20,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 484 flow [2023-08-25 20:09:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 20:09:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 20:09:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1821 transitions. [2023-08-25 20:09:20,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3785862785862786 [2023-08-25 20:09:20,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1821 transitions. [2023-08-25 20:09:20,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1821 transitions. [2023-08-25 20:09:20,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:20,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1821 transitions. [2023-08-25 20:09:20,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 364.2) internal successors, (1821), 5 states have internal predecessors, (1821), 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) [2023-08-25 20:09:20,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 962.0) internal successors, (5772), 6 states have internal predecessors, (5772), 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) [2023-08-25 20:09:20,860 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 962.0) internal successors, (5772), 6 states have internal predecessors, (5772), 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) [2023-08-25 20:09:20,860 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 175 flow. Second operand 5 states and 1821 transitions. [2023-08-25 20:09:20,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 484 flow [2023-08-25 20:09:20,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 474 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-25 20:09:20,864 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 236 flow [2023-08-25 20:09:20,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-08-25 20:09:20,865 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -97 predicate places. [2023-08-25 20:09:20,865 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 236 flow [2023-08-25 20:09:20,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 354.6) internal successors, (1773), 5 states have internal predecessors, (1773), 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) [2023-08-25 20:09:20,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:20,866 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:20,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 20:09:21,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-25 20:09:21,073 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:21,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:21,073 INFO L85 PathProgramCache]: Analyzing trace with hash 895244463, now seen corresponding path program 2 times [2023-08-25 20:09:21,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:21,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037385079] [2023-08-25 20:09:21,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:21,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 20:09:21,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:21,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037385079] [2023-08-25 20:09:21,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037385079] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 20:09:21,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194475764] [2023-08-25 20:09:21,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 20:09:21,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:09:21,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:09:21,338 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) [2023-08-25 20:09:21,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 20:09:21,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 20:09:21,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 20:09:21,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-25 20:09:21,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 20:09:22,221 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 150 [2023-08-25 20:09:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 20:09:22,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 20:09:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 20:09:22,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194475764] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 20:09:22,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 20:09:22,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2023-08-25 20:09:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739030750] [2023-08-25 20:09:22,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 20:09:22,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 20:09:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 20:09:22,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-08-25 20:09:22,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 962 [2023-08-25 20:09:22,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 236 flow. Second operand has 15 states, 15 states have (on average 305.3333333333333) internal successors, (4580), 15 states have internal predecessors, (4580), 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) [2023-08-25 20:09:22,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:22,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 962 [2023-08-25 20:09:22,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:23,209 INFO L124 PetriNetUnfolderBase]: 999/1784 cut-off events. [2023-08-25 20:09:23,209 INFO L125 PetriNetUnfolderBase]: For 2206/2206 co-relation queries the response was YES. [2023-08-25 20:09:23,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5147 conditions, 1784 events. 999/1784 cut-off events. For 2206/2206 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8113 event pairs, 412 based on Foata normal form. 16/1794 useless extension candidates. Maximal degree in co-relation 5133. Up to 1260 conditions per place. [2023-08-25 20:09:23,219 INFO L140 encePairwiseOnDemand]: 955/962 looper letters, 41 selfloop transitions, 4 changer transitions 43/100 dead transitions. [2023-08-25 20:09:23,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 556 flow [2023-08-25 20:09:23,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 20:09:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 20:09:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2787 transitions. [2023-08-25 20:09:23,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3218988218988219 [2023-08-25 20:09:23,225 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2787 transitions. [2023-08-25 20:09:23,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2787 transitions. [2023-08-25 20:09:23,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:23,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2787 transitions. [2023-08-25 20:09:23,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 309.6666666666667) internal successors, (2787), 9 states have internal predecessors, (2787), 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) [2023-08-25 20:09:23,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 962.0) internal successors, (9620), 10 states have internal predecessors, (9620), 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) [2023-08-25 20:09:23,239 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 962.0) internal successors, (9620), 10 states have internal predecessors, (9620), 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) [2023-08-25 20:09:23,239 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 236 flow. Second operand 9 states and 2787 transitions. [2023-08-25 20:09:23,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 556 flow [2023-08-25 20:09:23,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 530 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-25 20:09:23,243 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 240 flow [2023-08-25 20:09:23,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2023-08-25 20:09:23,244 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -87 predicate places. [2023-08-25 20:09:23,244 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 240 flow [2023-08-25 20:09:23,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 305.3333333333333) internal successors, (4580), 15 states have internal predecessors, (4580), 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) [2023-08-25 20:09:23,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:23,246 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:23,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-25 20:09:23,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:09:23,453 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:23,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:23,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1223798325, now seen corresponding path program 3 times [2023-08-25 20:09:23,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:23,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978380081] [2023-08-25 20:09:23,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:23,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 20:09:24,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:24,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978380081] [2023-08-25 20:09:24,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978380081] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:09:24,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:09:24,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 20:09:24,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090271348] [2023-08-25 20:09:24,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:09:24,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 20:09:24,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:24,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 20:09:24,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 20:09:24,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 962 [2023-08-25 20:09:24,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 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) [2023-08-25 20:09:24,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:24,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 962 [2023-08-25 20:09:24,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:24,603 INFO L124 PetriNetUnfolderBase]: 881/1528 cut-off events. [2023-08-25 20:09:24,604 INFO L125 PetriNetUnfolderBase]: For 1568/1568 co-relation queries the response was YES. [2023-08-25 20:09:24,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4369 conditions, 1528 events. 881/1528 cut-off events. For 1568/1568 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6512 event pairs, 277 based on Foata normal form. 40/1564 useless extension candidates. Maximal degree in co-relation 4351. Up to 1132 conditions per place. [2023-08-25 20:09:24,614 INFO L140 encePairwiseOnDemand]: 959/962 looper letters, 50 selfloop transitions, 2 changer transitions 7/71 dead transitions. [2023-08-25 20:09:24,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 71 transitions, 420 flow [2023-08-25 20:09:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 20:09:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 20:09:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1121 transitions. [2023-08-25 20:09:24,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38842688842688844 [2023-08-25 20:09:24,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1121 transitions. [2023-08-25 20:09:24,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1121 transitions. [2023-08-25 20:09:24,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:24,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1121 transitions. [2023-08-25 20:09:24,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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) [2023-08-25 20:09:24,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 962.0) internal successors, (3848), 4 states have internal predecessors, (3848), 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) [2023-08-25 20:09:24,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 962.0) internal successors, (3848), 4 states have internal predecessors, (3848), 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) [2023-08-25 20:09:24,622 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 240 flow. Second operand 3 states and 1121 transitions. [2023-08-25 20:09:24,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 71 transitions, 420 flow [2023-08-25 20:09:24,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 400 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-25 20:09:24,625 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 236 flow [2023-08-25 20:09:24,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2023-08-25 20:09:24,626 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -94 predicate places. [2023-08-25 20:09:24,626 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 236 flow [2023-08-25 20:09:24,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 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) [2023-08-25 20:09:24,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:24,626 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:24,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-25 20:09:24,627 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:24,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1875886954, now seen corresponding path program 1 times [2023-08-25 20:09:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472485065] [2023-08-25 20:09:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 20:09:25,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472485065] [2023-08-25 20:09:25,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472485065] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 20:09:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901524361] [2023-08-25 20:09:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:25,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:09:25,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:09:25,667 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) [2023-08-25 20:09:25,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 20:09:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:26,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-25 20:09:26,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 20:09:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 20:09:26,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 20:09:26,573 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-08-25 20:09:26,580 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:09:26,580 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2023-08-25 20:09:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 20:09:26,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901524361] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 20:09:26,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 20:09:26,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-25 20:09:26,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045574961] [2023-08-25 20:09:26,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 20:09:26,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-25 20:09:26,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:09:26,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-25 20:09:26,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-08-25 20:09:26,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 962 [2023-08-25 20:09:26,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 236 flow. Second operand has 14 states, 14 states have (on average 306.14285714285717) internal successors, (4286), 14 states have internal predecessors, (4286), 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) [2023-08-25 20:09:26,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:09:26,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 962 [2023-08-25 20:09:26,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:09:27,457 INFO L124 PetriNetUnfolderBase]: 1136/2096 cut-off events. [2023-08-25 20:09:27,457 INFO L125 PetriNetUnfolderBase]: For 2577/2577 co-relation queries the response was YES. [2023-08-25 20:09:27,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5964 conditions, 2096 events. 1136/2096 cut-off events. For 2577/2577 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10393 event pairs, 376 based on Foata normal form. 114/2200 useless extension candidates. Maximal degree in co-relation 5948. Up to 1132 conditions per place. [2023-08-25 20:09:27,477 INFO L140 encePairwiseOnDemand]: 955/962 looper letters, 46 selfloop transitions, 7 changer transitions 52/117 dead transitions. [2023-08-25 20:09:27,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 117 transitions, 694 flow [2023-08-25 20:09:27,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 20:09:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 20:09:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2797 transitions. [2023-08-25 20:09:27,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3230538230538231 [2023-08-25 20:09:27,484 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2797 transitions. [2023-08-25 20:09:27,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2797 transitions. [2023-08-25 20:09:27,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:09:27,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2797 transitions. [2023-08-25 20:09:27,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 310.77777777777777) internal successors, (2797), 9 states have internal predecessors, (2797), 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) [2023-08-25 20:09:27,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 962.0) internal successors, (9620), 10 states have internal predecessors, (9620), 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) [2023-08-25 20:09:27,497 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 962.0) internal successors, (9620), 10 states have internal predecessors, (9620), 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) [2023-08-25 20:09:27,497 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 236 flow. Second operand 9 states and 2797 transitions. [2023-08-25 20:09:27,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 117 transitions, 694 flow [2023-08-25 20:09:27,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 117 transitions, 685 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-25 20:09:27,502 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 256 flow [2023-08-25 20:09:27,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=962, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=256, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2023-08-25 20:09:27,503 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -85 predicate places. [2023-08-25 20:09:27,503 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 256 flow [2023-08-25 20:09:27,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 306.14285714285717) internal successors, (4286), 14 states have internal predecessors, (4286), 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) [2023-08-25 20:09:27,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:09:27,504 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:27,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 20:09:27,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-25 20:09:27,712 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 204 more)] === [2023-08-25 20:09:27,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:09:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash -688041919, now seen corresponding path program 2 times [2023-08-25 20:09:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:09:27,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846107220] [2023-08-25 20:09:27,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:09:27,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:09:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:09:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 20:09:32,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:09:32,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846107220] [2023-08-25 20:09:32,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846107220] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 20:09:32,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526249703] [2023-08-25 20:09:32,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 20:09:32,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:09:32,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:09:32,586 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) [2023-08-25 20:09:32,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 20:09:33,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 20:09:33,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 20:09:33,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-25 20:09:33,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 20:09:33,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 20:09:34,094 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 20:09:34,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2023-08-25 20:09:34,105 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-08-25 20:09:42,293 WARN L234 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 20:09:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 20:09:42,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 20:09:42,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2023-08-25 20:09:43,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2023-08-25 20:09:55,570 WARN L234 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 20:10:34,208 WARN L234 SmtUtils]: Spent 38.28s on a formula simplification. DAG size of input: 63 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 20:10:52,423 WARN L234 SmtUtils]: Spent 18.08s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 20:12:21,330 WARN L234 SmtUtils]: Spent 1.44m on a formula simplification. DAG size of input: 80 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 20:12:21,457 INFO L322 Elim1Store]: treesize reduction 39, result has 60.2 percent of original size [2023-08-25 20:12:21,457 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 67 [2023-08-25 20:12:21,555 INFO L322 Elim1Store]: treesize reduction 58, result has 62.3 percent of original size [2023-08-25 20:12:21,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 107 [2023-08-25 20:12:21,614 INFO L322 Elim1Store]: treesize reduction 155, result has 0.6 percent of original size [2023-08-25 20:12:21,614 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 1 [2023-08-25 20:12:21,691 INFO L322 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-08-25 20:12:21,692 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 127 [2023-08-25 20:12:21,801 INFO L322 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-08-25 20:12:21,801 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 127 [2023-08-25 20:12:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 20:12:22,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526249703] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 20:12:22,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 20:12:22,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 41 [2023-08-25 20:12:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476256894] [2023-08-25 20:12:22,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 20:12:22,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-08-25 20:12:22,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:12:22,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-08-25 20:12:22,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1505, Unknown=1, NotChecked=0, Total=1806 [2023-08-25 20:12:22,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 962 [2023-08-25 20:12:22,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 256 flow. Second operand has 43 states, 43 states have (on average 230.0) internal successors, (9890), 43 states have internal predecessors, (9890), 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) [2023-08-25 20:12:22,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:12:22,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 962 [2023-08-25 20:12:22,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:12:35,700 WARN L234 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 119 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 20:12:39,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:13:26,461 WARN L234 SmtUtils]: Spent 46.46s on a formula simplification. DAG size of input: 121 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 20:13:27,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:14:25,352 WARN L234 SmtUtils]: Spent 56.23s on a formula simplification. DAG size of input: 83 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 20:14:27,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:14:29,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:14:31,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:14:33,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:14:37,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:14:39,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:14:41,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:14:44,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:14:46,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:14:48,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:14:50,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:14:52,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:15:00,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:15:02,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:15:04,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:15:06,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:15:08,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:15:10,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:15:12,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:15:14,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:15:16,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:17:47,996 WARN L234 SmtUtils]: Spent 2.51m on a formula simplification. DAG size of input: 157 DAG size of output: 138 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 20:17:50,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:17:52,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:17:54,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:17:56,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:17:58,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:18:00,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 20:18:02,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 20:18:04,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 20:18:06,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 20:18:08,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 20:18:10,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 20:18:12,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 20:19:03,018 WARN L234 SmtUtils]: Spent 50.26s on a formula simplification. DAG size of input: 71 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 20:20:11,785 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-08-25 20:20:11,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-25 20:20:11,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-08-25 20:20:11,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-25 20:20:11,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-25 20:20:11,988 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:196) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 62 more [2023-08-25 20:20:11,990 INFO L158 Benchmark]: Toolchain (without parser) took 679864.71ms. Allocated memory was 381.7MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 358.3MB in the beginning and 1.4GB in the end (delta: -1.0GB). Peak memory consumption was 157.0MB. Max. memory is 16.0GB. [2023-08-25 20:20:11,991 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 381.7MB. Free memory is still 358.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 20:20:11,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.74ms. Allocated memory is still 381.7MB. Free memory was 358.3MB in the beginning and 343.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-25 20:20:11,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.09ms. Allocated memory is still 381.7MB. Free memory was 343.7MB in the beginning and 339.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 20:20:11,991 INFO L158 Benchmark]: Boogie Preprocessor took 88.46ms. Allocated memory is still 381.7MB. Free memory was 339.0MB in the beginning and 334.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 20:20:11,992 INFO L158 Benchmark]: RCFGBuilder took 1897.88ms. Allocated memory was 381.7MB in the beginning and 507.5MB in the end (delta: 125.8MB). Free memory was 334.8MB in the beginning and 411.5MB in the end (delta: -76.7MB). Peak memory consumption was 78.9MB. Max. memory is 16.0GB. [2023-08-25 20:20:11,992 INFO L158 Benchmark]: TraceAbstraction took 677430.67ms. Allocated memory was 507.5MB in the beginning and 1.6GB in the end (delta: 1.1GB). Free memory was 410.5MB in the beginning and 1.4GB in the end (delta: -990.4MB). Peak memory consumption was 82.3MB. Max. memory is 16.0GB. [2023-08-25 20:20:11,993 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 381.7MB. Free memory is still 358.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 365.74ms. Allocated memory is still 381.7MB. Free memory was 358.3MB in the beginning and 343.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 74.09ms. Allocated memory is still 381.7MB. Free memory was 343.7MB in the beginning and 339.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 88.46ms. Allocated memory is still 381.7MB. Free memory was 339.0MB in the beginning and 334.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1897.88ms. Allocated memory was 381.7MB in the beginning and 507.5MB in the end (delta: 125.8MB). Free memory was 334.8MB in the beginning and 411.5MB in the end (delta: -76.7MB). Peak memory consumption was 78.9MB. Max. memory is 16.0GB. * TraceAbstraction took 677430.67ms. Allocated memory was 507.5MB in the beginning and 1.6GB in the end (delta: 1.1GB). Free memory was 410.5MB in the beginning and 1.4GB in the end (delta: -990.4MB). Peak memory consumption was 82.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.2s, 455 PlacesBefore, 162 PlacesAfterwards, 464 TransitionsBefore, 158 TransitionsAfterwards, 14832 CoEnabledTransitionPairs, 8 FixpointIterations, 340 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 11 ConcurrentYvCompositions, 13 ChoiceCompositions, 484 TotalNumberOfCompositions, 108616 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25840, independent: 24527, independent conditional: 0, independent unconditional: 24527, dependent: 1313, dependent conditional: 0, dependent unconditional: 1313, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5288, independent: 5113, independent conditional: 0, independent unconditional: 5113, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25840, independent: 19414, independent conditional: 0, independent unconditional: 19414, dependent: 1138, dependent conditional: 0, dependent unconditional: 1138, unknown: 5288, unknown conditional: 0, unknown unconditional: 5288] , Statistics on independence cache: Total cache size (in pairs): 1818, Positive cache size: 1739, Positive conditional cache size: 0, Positive unconditional cache size: 1739, Negative cache size: 79, Negative conditional cache size: 0, Negative unconditional cache size: 79, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...