/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 01:52:12,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 01:52:12,307 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-NoLbe.epf [2023-11-30 01:52:12,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 01:52:12,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 01:52:12,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 01:52:12,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 01:52:12,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 01:52:12,334 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 01:52:12,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 01:52:12,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 01:52:12,337 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 01:52:12,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 01:52:12,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 01:52:12,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 01:52:12,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 01:52:12,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 01:52:12,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 01:52:12,339 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 01:52:12,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 01:52:12,340 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 01:52:12,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 01:52:12,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 01:52:12,340 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 01:52:12,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 01:52:12,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 01:52:12,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 01:52:12,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 01:52:12,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 01:52:12,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 01:52:12,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 01:52:12,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 01:52:12,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 01:52:12,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 01:52:12,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 01:52:12,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 01:52:12,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 01:52:12,566 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 01:52:12,566 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 01:52:12,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.i [2023-11-30 01:52:13,604 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 01:52:13,822 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 01:52:13,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.i [2023-11-30 01:52:13,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d4df9e9d/4173245d4fee4b578e6ce009b0296f59/FLAG09132115f [2023-11-30 01:52:13,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d4df9e9d/4173245d4fee4b578e6ce009b0296f59 [2023-11-30 01:52:13,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 01:52:13,854 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 01:52:13,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 01:52:13,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 01:52:13,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 01:52:13,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:52:13" (1/1) ... [2023-11-30 01:52:13,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f572474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:13, skipping insertion in model container [2023-11-30 01:52:13,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:52:13" (1/1) ... [2023-11-30 01:52:13,910 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 01:52:14,233 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 01:52:14,249 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 01:52:14,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 01:52:14,335 INFO L206 MainTranslator]: Completed translation [2023-11-30 01:52:14,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14 WrapperNode [2023-11-30 01:52:14,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 01:52:14,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 01:52:14,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 01:52:14,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 01:52:14,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14" (1/1) ... [2023-11-30 01:52:14,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14" (1/1) ... [2023-11-30 01:52:14,401 INFO L138 Inliner]: procedures = 371, calls = 39, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 362 [2023-11-30 01:52:14,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 01:52:14,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 01:52:14,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 01:52:14,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 01:52:14,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14" (1/1) ... [2023-11-30 01:52:14,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14" (1/1) ... [2023-11-30 01:52:14,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14" (1/1) ... [2023-11-30 01:52:14,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14" (1/1) ... [2023-11-30 01:52:14,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14" (1/1) ... [2023-11-30 01:52:14,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14" (1/1) ... [2023-11-30 01:52:14,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14" (1/1) ... [2023-11-30 01:52:14,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14" (1/1) ... [2023-11-30 01:52:14,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 01:52:14,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 01:52:14,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 01:52:14,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 01:52:14,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14" (1/1) ... [2023-11-30 01:52:14,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 01:52:14,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 01:52:14,470 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-11-30 01:52:14,473 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-11-30 01:52:14,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 01:52:14,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-30 01:52:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 01:52:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 01:52:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 01:52:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 01:52:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 01:52:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 01:52:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 01:52:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-30 01:52:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-30 01:52:14,494 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-30 01:52:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 01:52:14,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 01:52:14,495 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 01:52:14,687 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 01:52:14,689 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 01:52:15,212 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 01:52:15,226 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 01:52:15,226 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-30 01:52:15,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:52:15 BoogieIcfgContainer [2023-11-30 01:52:15,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 01:52:15,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 01:52:15,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 01:52:15,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 01:52:15,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:52:13" (1/3) ... [2023-11-30 01:52:15,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a25d8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:52:15, skipping insertion in model container [2023-11-30 01:52:15,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:52:14" (2/3) ... [2023-11-30 01:52:15,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a25d8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:52:15, skipping insertion in model container [2023-11-30 01:52:15,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:52:15" (3/3) ... [2023-11-30 01:52:15,233 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.i [2023-11-30 01:52:15,244 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 01:52:15,244 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-30 01:52:15,244 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 01:52:15,334 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 01:52:15,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 431 places, 432 transitions, 868 flow [2023-11-30 01:52:15,452 INFO L124 PetriNetUnfolderBase]: 5/431 cut-off events. [2023-11-30 01:52:15,452 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 01:52:15,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 431 events. 5/431 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 366 event pairs, 0 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 302. Up to 2 conditions per place. [2023-11-30 01:52:15,457 INFO L82 GeneralOperation]: Start removeDead. Operand has 431 places, 432 transitions, 868 flow [2023-11-30 01:52:15,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 430 places, 431 transitions, 865 flow [2023-11-30 01:52:15,475 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 01:52:15,480 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4cb832d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 01:52:15,480 INFO L363 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-11-30 01:52:15,487 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 01:52:15,488 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2023-11-30 01:52:15,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 01:52:15,488 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:15,489 INFO L232 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] [2023-11-30 01:52:15,489 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:15,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash -410546215, now seen corresponding path program 1 times [2023-11-30 01:52:15,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:15,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893660924] [2023-11-30 01:52:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:15,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:15,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:15,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893660924] [2023-11-30 01:52:15,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893660924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:52:15,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 01:52:15,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 01:52:15,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174960133] [2023-11-30 01:52:15,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:52:15,987 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 01:52:15,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:16,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 01:52:16,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 01:52:16,017 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 432 [2023-11-30 01:52:16,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 431 transitions, 865 flow. Second operand has 6 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 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-11-30 01:52:16,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:16,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 432 [2023-11-30 01:52:16,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:16,824 INFO L124 PetriNetUnfolderBase]: 761/2571 cut-off events. [2023-11-30 01:52:16,824 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 01:52:16,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4309 conditions, 2571 events. 761/2571 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 14142 event pairs, 760 based on Foata normal form. 19/2305 useless extension candidates. Maximal degree in co-relation 3853. Up to 1714 conditions per place. [2023-11-30 01:52:16,839 INFO L140 encePairwiseOnDemand]: 404/432 looper letters, 193 selfloop transitions, 20 changer transitions 2/423 dead transitions. [2023-11-30 01:52:16,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 423 transitions, 1275 flow [2023-11-30 01:52:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 01:52:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 01:52:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2023-11-30 01:52:16,853 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5736882716049383 [2023-11-30 01:52:16,854 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1487 transitions. [2023-11-30 01:52:16,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1487 transitions. [2023-11-30 01:52:16,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:16,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1487 transitions. [2023-11-30 01:52:16,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 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-11-30 01:52:16,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:16,872 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:16,875 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 1 predicate places. [2023-11-30 01:52:16,875 INFO L500 AbstractCegarLoop]: Abstraction has has 431 places, 423 transitions, 1275 flow [2023-11-30 01:52:16,876 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 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-11-30 01:52:16,876 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:16,876 INFO L232 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] [2023-11-30 01:52:16,876 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 01:52:16,876 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:16,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:16,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1975994147, now seen corresponding path program 1 times [2023-11-30 01:52:16,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:16,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559523533] [2023-11-30 01:52:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:16,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:17,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:17,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559523533] [2023-11-30 01:52:17,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559523533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:52:17,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 01:52:17,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 01:52:17,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251870718] [2023-11-30 01:52:17,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:52:17,199 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 01:52:17,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:17,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 01:52:17,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 01:52:17,201 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 432 [2023-11-30 01:52:17,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 423 transitions, 1275 flow. Second operand has 6 states, 6 states have (on average 213.5) internal successors, (1281), 6 states have internal predecessors, (1281), 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-11-30 01:52:17,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:17,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 432 [2023-11-30 01:52:17,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:17,822 INFO L124 PetriNetUnfolderBase]: 761/2567 cut-off events. [2023-11-30 01:52:17,822 INFO L125 PetriNetUnfolderBase]: For 196/342 co-relation queries the response was YES. [2023-11-30 01:52:17,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6031 conditions, 2567 events. 761/2567 cut-off events. For 196/342 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 14147 event pairs, 760 based on Foata normal form. 0/2286 useless extension candidates. Maximal degree in co-relation 5431. Up to 1710 conditions per place. [2023-11-30 01:52:17,833 INFO L140 encePairwiseOnDemand]: 408/432 looper letters, 189 selfloop transitions, 20 changer transitions 2/419 dead transitions. [2023-11-30 01:52:17,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 419 transitions, 1677 flow [2023-11-30 01:52:17,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 01:52:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 01:52:17,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1479 transitions. [2023-11-30 01:52:17,836 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5706018518518519 [2023-11-30 01:52:17,836 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1479 transitions. [2023-11-30 01:52:17,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1479 transitions. [2023-11-30 01:52:17,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:17,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1479 transitions. [2023-11-30 01:52:17,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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-11-30 01:52:17,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:17,844 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:17,844 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 2 predicate places. [2023-11-30 01:52:17,844 INFO L500 AbstractCegarLoop]: Abstraction has has 432 places, 419 transitions, 1677 flow [2023-11-30 01:52:17,845 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.5) internal successors, (1281), 6 states have internal predecessors, (1281), 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-11-30 01:52:17,845 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:17,845 INFO L232 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 01:52:17,845 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 01:52:17,845 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:17,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:17,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1735557152, now seen corresponding path program 1 times [2023-11-30 01:52:17,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:17,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182767828] [2023-11-30 01:52:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:17,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:18,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:18,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182767828] [2023-11-30 01:52:18,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182767828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:52:18,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 01:52:18,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 01:52:18,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999009462] [2023-11-30 01:52:18,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:52:18,286 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 01:52:18,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:18,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 01:52:18,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 01:52:18,288 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 432 [2023-11-30 01:52:18,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 419 transitions, 1677 flow. Second operand has 6 states, 6 states have (on average 227.83333333333334) internal successors, (1367), 6 states have internal predecessors, (1367), 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-11-30 01:52:18,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:18,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 432 [2023-11-30 01:52:18,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:18,824 INFO L124 PetriNetUnfolderBase]: 859/2792 cut-off events. [2023-11-30 01:52:18,824 INFO L125 PetriNetUnfolderBase]: For 609/925 co-relation queries the response was YES. [2023-11-30 01:52:18,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8358 conditions, 2792 events. 859/2792 cut-off events. For 609/925 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15980 event pairs, 858 based on Foata normal form. 0/2493 useless extension candidates. Maximal degree in co-relation 7626. Up to 1907 conditions per place. [2023-11-30 01:52:18,842 INFO L140 encePairwiseOnDemand]: 426/432 looper letters, 190 selfloop transitions, 5 changer transitions 2/418 dead transitions. [2023-11-30 01:52:18,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 418 transitions, 2061 flow [2023-11-30 01:52:18,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 01:52:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 01:52:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1540 transitions. [2023-11-30 01:52:18,845 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5941358024691358 [2023-11-30 01:52:18,845 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1540 transitions. [2023-11-30 01:52:18,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1540 transitions. [2023-11-30 01:52:18,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:18,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1540 transitions. [2023-11-30 01:52:18,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 256.6666666666667) internal successors, (1540), 6 states have internal predecessors, (1540), 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-11-30 01:52:18,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:18,853 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:18,854 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 6 predicate places. [2023-11-30 01:52:18,854 INFO L500 AbstractCegarLoop]: Abstraction has has 436 places, 418 transitions, 2061 flow [2023-11-30 01:52:18,855 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 227.83333333333334) internal successors, (1367), 6 states have internal predecessors, (1367), 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-11-30 01:52:18,855 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:18,855 INFO L232 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, 1, 1, 1, 1, 1, 1, 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-11-30 01:52:18,855 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 01:52:18,855 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:18,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:18,856 INFO L85 PathProgramCache]: Analyzing trace with hash 19968795, now seen corresponding path program 1 times [2023-11-30 01:52:18,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:18,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986010153] [2023-11-30 01:52:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:18,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:18,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:18,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986010153] [2023-11-30 01:52:18,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986010153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:52:18,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 01:52:18,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 01:52:18,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259749841] [2023-11-30 01:52:18,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:52:18,915 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 01:52:18,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:18,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 01:52:18,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 01:52:18,917 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 432 [2023-11-30 01:52:18,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 418 transitions, 2061 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-11-30 01:52:18,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:18,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 432 [2023-11-30 01:52:18,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:19,533 INFO L124 PetriNetUnfolderBase]: 859/2901 cut-off events. [2023-11-30 01:52:19,533 INFO L125 PetriNetUnfolderBase]: For 990/1315 co-relation queries the response was YES. [2023-11-30 01:52:19,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8860 conditions, 2901 events. 859/2901 cut-off events. For 990/1315 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15979 event pairs, 858 based on Foata normal form. 0/2598 useless extension candidates. Maximal degree in co-relation 7792. Up to 1959 conditions per place. [2023-11-30 01:52:19,543 INFO L140 encePairwiseOnDemand]: 429/432 looper letters, 42 selfloop transitions, 2 changer transitions 2/435 dead transitions. [2023-11-30 01:52:19,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 435 transitions, 2261 flow [2023-11-30 01:52:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 01:52:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 01:52:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2023-11-30 01:52:19,545 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9606481481481481 [2023-11-30 01:52:19,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1245 transitions. [2023-11-30 01:52:19,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1245 transitions. [2023-11-30 01:52:19,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:19,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1245 transitions. [2023-11-30 01:52:19,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 415.0) internal successors, (1245), 3 states have internal predecessors, (1245), 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-11-30 01:52:19,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 432.0) internal successors, (1728), 4 states have internal predecessors, (1728), 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-11-30 01:52:19,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 432.0) internal successors, (1728), 4 states have internal predecessors, (1728), 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-11-30 01:52:19,550 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 8 predicate places. [2023-11-30 01:52:19,550 INFO L500 AbstractCegarLoop]: Abstraction has has 438 places, 435 transitions, 2261 flow [2023-11-30 01:52:19,550 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-11-30 01:52:19,550 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:19,551 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:52:19,551 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 01:52:19,551 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:19,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:19,551 INFO L85 PathProgramCache]: Analyzing trace with hash -424984831, now seen corresponding path program 1 times [2023-11-30 01:52:19,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:19,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401556245] [2023-11-30 01:52:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:19,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:19,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:19,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401556245] [2023-11-30 01:52:19,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401556245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:52:19,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 01:52:19,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 01:52:19,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857388606] [2023-11-30 01:52:19,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:52:19,833 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 01:52:19,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:19,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 01:52:19,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 01:52:19,835 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 432 [2023-11-30 01:52:19,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 435 transitions, 2261 flow. Second operand has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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-11-30 01:52:19,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:19,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 432 [2023-11-30 01:52:19,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:20,571 INFO L124 PetriNetUnfolderBase]: 859/2899 cut-off events. [2023-11-30 01:52:20,571 INFO L125 PetriNetUnfolderBase]: For 1514/2027 co-relation queries the response was YES. [2023-11-30 01:52:20,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10813 conditions, 2899 events. 859/2899 cut-off events. For 1514/2027 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15934 event pairs, 858 based on Foata normal form. 0/2598 useless extension candidates. Maximal degree in co-relation 9569. Up to 1957 conditions per place. [2023-11-30 01:52:20,592 INFO L140 encePairwiseOnDemand]: 426/432 looper letters, 199 selfloop transitions, 9 changer transitions 2/433 dead transitions. [2023-11-30 01:52:20,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 433 transitions, 2657 flow [2023-11-30 01:52:20,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 01:52:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 01:52:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1549 transitions. [2023-11-30 01:52:20,596 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.597608024691358 [2023-11-30 01:52:20,596 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1549 transitions. [2023-11-30 01:52:20,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1549 transitions. [2023-11-30 01:52:20,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:20,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1549 transitions. [2023-11-30 01:52:20,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 258.1666666666667) internal successors, (1549), 6 states have internal predecessors, (1549), 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-11-30 01:52:20,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:20,603 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:20,604 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 12 predicate places. [2023-11-30 01:52:20,604 INFO L500 AbstractCegarLoop]: Abstraction has has 442 places, 433 transitions, 2657 flow [2023-11-30 01:52:20,604 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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-11-30 01:52:20,605 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:20,605 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:52:20,605 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 01:52:20,605 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:20,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash -289859891, now seen corresponding path program 1 times [2023-11-30 01:52:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:20,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283096248] [2023-11-30 01:52:20,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:20,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:20,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:20,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283096248] [2023-11-30 01:52:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283096248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:52:20,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 01:52:20,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 01:52:20,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624227964] [2023-11-30 01:52:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:52:20,952 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 01:52:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:20,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 01:52:20,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 01:52:20,954 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 432 [2023-11-30 01:52:20,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 433 transitions, 2657 flow. Second operand has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 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-11-30 01:52:20,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:20,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 432 [2023-11-30 01:52:20,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:21,686 INFO L124 PetriNetUnfolderBase]: 859/2895 cut-off events. [2023-11-30 01:52:21,686 INFO L125 PetriNetUnfolderBase]: For 2374/3045 co-relation queries the response was YES. [2023-11-30 01:52:21,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12649 conditions, 2895 events. 859/2895 cut-off events. For 2374/3045 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15946 event pairs, 858 based on Foata normal form. 0/2598 useless extension candidates. Maximal degree in co-relation 11243. Up to 1953 conditions per place. [2023-11-30 01:52:21,702 INFO L140 encePairwiseOnDemand]: 414/432 looper letters, 182 selfloop transitions, 15 changer transitions 2/430 dead transitions. [2023-11-30 01:52:21,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 430 transitions, 3021 flow [2023-11-30 01:52:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 01:52:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 01:52:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1558 transitions. [2023-11-30 01:52:21,705 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6010802469135802 [2023-11-30 01:52:21,705 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1558 transitions. [2023-11-30 01:52:21,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1558 transitions. [2023-11-30 01:52:21,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:21,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1558 transitions. [2023-11-30 01:52:21,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 259.6666666666667) internal successors, (1558), 6 states have internal predecessors, (1558), 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-11-30 01:52:21,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:21,711 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:21,712 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 14 predicate places. [2023-11-30 01:52:21,712 INFO L500 AbstractCegarLoop]: Abstraction has has 444 places, 430 transitions, 3021 flow [2023-11-30 01:52:21,712 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 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-11-30 01:52:21,712 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:21,713 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:52:21,713 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 01:52:21,713 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:21,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:21,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1020050489, now seen corresponding path program 1 times [2023-11-30 01:52:21,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:21,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010863503] [2023-11-30 01:52:21,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:21,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:22,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:22,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010863503] [2023-11-30 01:52:22,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010863503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:52:22,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 01:52:22,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 01:52:22,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622000046] [2023-11-30 01:52:22,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:52:22,052 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 01:52:22,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:22,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 01:52:22,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 01:52:22,054 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 432 [2023-11-30 01:52:22,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 430 transitions, 3021 flow. Second operand has 6 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 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-11-30 01:52:22,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:22,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 432 [2023-11-30 01:52:22,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:22,862 INFO L124 PetriNetUnfolderBase]: 859/2891 cut-off events. [2023-11-30 01:52:22,863 INFO L125 PetriNetUnfolderBase]: For 3455/4270 co-relation queries the response was YES. [2023-11-30 01:52:22,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14485 conditions, 2891 events. 859/2891 cut-off events. For 3455/4270 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15945 event pairs, 858 based on Foata normal form. 0/2598 useless extension candidates. Maximal degree in co-relation 12917. Up to 1949 conditions per place. [2023-11-30 01:52:22,881 INFO L140 encePairwiseOnDemand]: 414/432 looper letters, 185 selfloop transitions, 15 changer transitions 2/427 dead transitions. [2023-11-30 01:52:22,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 427 transitions, 3385 flow [2023-11-30 01:52:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 01:52:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 01:52:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1525 transitions. [2023-11-30 01:52:22,885 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5883487654320988 [2023-11-30 01:52:22,885 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1525 transitions. [2023-11-30 01:52:22,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1525 transitions. [2023-11-30 01:52:22,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:22,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1525 transitions. [2023-11-30 01:52:22,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 254.16666666666666) internal successors, (1525), 6 states have internal predecessors, (1525), 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-11-30 01:52:22,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:22,891 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:22,892 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 16 predicate places. [2023-11-30 01:52:22,892 INFO L500 AbstractCegarLoop]: Abstraction has has 446 places, 427 transitions, 3385 flow [2023-11-30 01:52:22,892 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 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-11-30 01:52:22,892 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:22,893 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:52:22,893 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 01:52:22,893 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:22,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash -833200122, now seen corresponding path program 1 times [2023-11-30 01:52:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485334175] [2023-11-30 01:52:22,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:22,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:23,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485334175] [2023-11-30 01:52:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485334175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:52:23,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 01:52:23,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 01:52:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839568122] [2023-11-30 01:52:23,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:52:23,243 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 01:52:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:23,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 01:52:23,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 01:52:23,245 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 432 [2023-11-30 01:52:23,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 427 transitions, 3385 flow. Second operand has 6 states, 6 states have (on average 230.33333333333334) internal successors, (1382), 6 states have internal predecessors, (1382), 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-11-30 01:52:23,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:23,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 432 [2023-11-30 01:52:23,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:24,054 INFO L124 PetriNetUnfolderBase]: 859/2887 cut-off events. [2023-11-30 01:52:24,055 INFO L125 PetriNetUnfolderBase]: For 4769/5728 co-relation queries the response was YES. [2023-11-30 01:52:24,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16313 conditions, 2887 events. 859/2887 cut-off events. For 4769/5728 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15972 event pairs, 858 based on Foata normal form. 0/2598 useless extension candidates. Maximal degree in co-relation 14591. Up to 1945 conditions per place. [2023-11-30 01:52:24,072 INFO L140 encePairwiseOnDemand]: 414/432 looper letters, 182 selfloop transitions, 15 changer transitions 2/424 dead transitions. [2023-11-30 01:52:24,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 424 transitions, 3737 flow [2023-11-30 01:52:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 01:52:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 01:52:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1522 transitions. [2023-11-30 01:52:24,075 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5871913580246914 [2023-11-30 01:52:24,075 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1522 transitions. [2023-11-30 01:52:24,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1522 transitions. [2023-11-30 01:52:24,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:24,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1522 transitions. [2023-11-30 01:52:24,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 253.66666666666666) internal successors, (1522), 6 states have internal predecessors, (1522), 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-11-30 01:52:24,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:24,081 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:24,082 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 18 predicate places. [2023-11-30 01:52:24,082 INFO L500 AbstractCegarLoop]: Abstraction has has 448 places, 424 transitions, 3737 flow [2023-11-30 01:52:24,083 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 230.33333333333334) internal successors, (1382), 6 states have internal predecessors, (1382), 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-11-30 01:52:24,083 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:24,083 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:52:24,083 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 01:52:24,083 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:24,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:24,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1909078961, now seen corresponding path program 1 times [2023-11-30 01:52:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:24,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356921138] [2023-11-30 01:52:24,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:24,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356921138] [2023-11-30 01:52:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356921138] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 01:52:24,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964260733] [2023-11-30 01:52:24,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:24,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 01:52:24,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 01:52:24,239 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-11-30 01:52:24,284 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-11-30 01:52:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:24,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 01:52:24,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 01:52:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:24,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 01:52:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:24,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964260733] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 01:52:24,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 01:52:24,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 01:52:24,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574391742] [2023-11-30 01:52:24,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 01:52:24,791 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 01:52:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:24,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 01:52:24,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-30 01:52:24,796 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 432 [2023-11-30 01:52:24,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 424 transitions, 3737 flow. Second operand has 10 states, 10 states have (on average 404.7) internal successors, (4047), 10 states have internal predecessors, (4047), 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-11-30 01:52:24,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:24,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 432 [2023-11-30 01:52:24,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:25,644 INFO L124 PetriNetUnfolderBase]: 859/2995 cut-off events. [2023-11-30 01:52:25,644 INFO L125 PetriNetUnfolderBase]: For 5868/6835 co-relation queries the response was YES. [2023-11-30 01:52:25,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17044 conditions, 2995 events. 859/2995 cut-off events. For 5868/6835 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15819 event pairs, 858 based on Foata normal form. 0/2706 useless extension candidates. Maximal degree in co-relation 14757. Up to 1994 conditions per place. [2023-11-30 01:52:25,658 INFO L140 encePairwiseOnDemand]: 426/432 looper letters, 53 selfloop transitions, 9 changer transitions 2/443 dead transitions. [2023-11-30 01:52:25,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 443 transitions, 4101 flow [2023-11-30 01:52:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 01:52:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 01:52:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3655 transitions. [2023-11-30 01:52:25,663 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9400720164609053 [2023-11-30 01:52:25,663 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3655 transitions. [2023-11-30 01:52:25,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3655 transitions. [2023-11-30 01:52:25,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:25,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3655 transitions. [2023-11-30 01:52:25,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 406.1111111111111) internal successors, (3655), 9 states have internal predecessors, (3655), 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-11-30 01:52:25,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 432.0) internal successors, (4320), 10 states have internal predecessors, (4320), 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-11-30 01:52:25,674 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 432.0) internal successors, (4320), 10 states have internal predecessors, (4320), 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-11-30 01:52:25,674 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 26 predicate places. [2023-11-30 01:52:25,674 INFO L500 AbstractCegarLoop]: Abstraction has has 456 places, 443 transitions, 4101 flow [2023-11-30 01:52:25,675 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 404.7) internal successors, (4047), 10 states have internal predecessors, (4047), 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-11-30 01:52:25,675 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:25,676 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 01:52:25,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-30 01:52:25,881 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 01:52:25,881 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:25,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash 360401501, now seen corresponding path program 2 times [2023-11-30 01:52:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:25,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438705290] [2023-11-30 01:52:25,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:25,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:26,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:26,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438705290] [2023-11-30 01:52:26,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438705290] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 01:52:26,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076475673] [2023-11-30 01:52:26,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 01:52:26,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 01:52:26,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 01:52:26,396 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-11-30 01:52:26,427 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-11-30 01:52:26,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 01:52:26,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 01:52:26,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-30 01:52:26,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 01:52:26,686 INFO L378 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 15 treesize of output 11 [2023-11-30 01:52:26,702 INFO L378 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 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-30 01:52:26,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 01:52:26,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-30 01:52:26,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 01:52:26,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-30 01:52:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2023-11-30 01:52:26,769 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 01:52:26,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076475673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:52:26,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 01:52:26,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2023-11-30 01:52:26,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042511832] [2023-11-30 01:52:26,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:52:26,770 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 01:52:26,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:26,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 01:52:26,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-11-30 01:52:26,772 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 432 [2023-11-30 01:52:26,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 443 transitions, 4101 flow. Second operand has 6 states, 6 states have (on average 242.33333333333334) internal successors, (1454), 6 states have internal predecessors, (1454), 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-11-30 01:52:26,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:26,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 432 [2023-11-30 01:52:26,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:28,374 INFO L124 PetriNetUnfolderBase]: 1523/4767 cut-off events. [2023-11-30 01:52:28,375 INFO L125 PetriNetUnfolderBase]: For 12200/14334 co-relation queries the response was YES. [2023-11-30 01:52:28,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31471 conditions, 4767 events. 1523/4767 cut-off events. For 12200/14334 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 31002 event pairs, 139 based on Foata normal form. 0/4296 useless extension candidates. Maximal degree in co-relation 28981. Up to 3339 conditions per place. [2023-11-30 01:52:28,403 INFO L140 encePairwiseOnDemand]: 403/432 looper letters, 300 selfloop transitions, 75 changer transitions 2/616 dead transitions. [2023-11-30 01:52:28,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 616 transitions, 7609 flow [2023-11-30 01:52:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 01:52:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 01:52:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1739 transitions. [2023-11-30 01:52:28,406 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6709104938271605 [2023-11-30 01:52:28,406 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1739 transitions. [2023-11-30 01:52:28,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1739 transitions. [2023-11-30 01:52:28,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:28,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1739 transitions. [2023-11-30 01:52:28,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 289.8333333333333) internal successors, (1739), 6 states have internal predecessors, (1739), 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-11-30 01:52:28,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:28,413 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:28,413 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 30 predicate places. [2023-11-30 01:52:28,413 INFO L500 AbstractCegarLoop]: Abstraction has has 460 places, 616 transitions, 7609 flow [2023-11-30 01:52:28,414 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.33333333333334) internal successors, (1454), 6 states have internal predecessors, (1454), 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-11-30 01:52:28,414 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:28,414 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:52:28,424 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-11-30 01:52:28,624 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-30 01:52:28,625 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:28,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:28,625 INFO L85 PathProgramCache]: Analyzing trace with hash -897383726, now seen corresponding path program 1 times [2023-11-30 01:52:28,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:28,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943444276] [2023-11-30 01:52:28,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:28,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:29,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:29,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943444276] [2023-11-30 01:52:29,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943444276] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 01:52:29,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487296153] [2023-11-30 01:52:29,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:29,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 01:52:29,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 01:52:29,180 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-11-30 01:52:29,181 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-11-30 01:52:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:29,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 1755 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-30 01:52:29,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 01:52:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:29,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 01:52:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:30,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487296153] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 01:52:30,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 01:52:30,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-30 01:52:30,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119733685] [2023-11-30 01:52:30,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 01:52:30,202 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 01:52:30,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:30,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 01:52:30,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-11-30 01:52:30,207 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 432 [2023-11-30 01:52:30,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 616 transitions, 7609 flow. Second operand has 18 states, 18 states have (on average 405.94444444444446) internal successors, (7307), 18 states have internal predecessors, (7307), 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-11-30 01:52:30,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:30,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 432 [2023-11-30 01:52:30,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:32,730 INFO L124 PetriNetUnfolderBase]: 1523/5230 cut-off events. [2023-11-30 01:52:32,731 INFO L125 PetriNetUnfolderBase]: For 14542/16139 co-relation queries the response was YES. [2023-11-30 01:52:32,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34159 conditions, 5230 events. 1523/5230 cut-off events. For 14542/16139 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31547 event pairs, 129 based on Foata normal form. 0/4769 useless extension candidates. Maximal degree in co-relation 29279. Up to 3531 conditions per place. [2023-11-30 01:52:32,758 INFO L140 encePairwiseOnDemand]: 426/432 looper letters, 119 selfloop transitions, 21 changer transitions 2/684 dead transitions. [2023-11-30 01:52:32,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 684 transitions, 9041 flow [2023-11-30 01:52:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-30 01:52:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-30 01:52:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 8513 transitions. [2023-11-30 01:52:32,769 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9383818342151675 [2023-11-30 01:52:32,770 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 8513 transitions. [2023-11-30 01:52:32,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 8513 transitions. [2023-11-30 01:52:32,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:32,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 8513 transitions. [2023-11-30 01:52:32,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 405.3809523809524) internal successors, (8513), 21 states have internal predecessors, (8513), 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-11-30 01:52:32,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 432.0) internal successors, (9504), 22 states have internal predecessors, (9504), 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-11-30 01:52:32,794 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 432.0) internal successors, (9504), 22 states have internal predecessors, (9504), 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-11-30 01:52:32,794 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 50 predicate places. [2023-11-30 01:52:32,794 INFO L500 AbstractCegarLoop]: Abstraction has has 480 places, 684 transitions, 9041 flow [2023-11-30 01:52:32,795 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 405.94444444444446) internal successors, (7307), 18 states have internal predecessors, (7307), 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-11-30 01:52:32,795 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:32,796 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:52:32,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-30 01:52:33,002 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 01:52:33,003 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:33,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:33,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1601609686, now seen corresponding path program 2 times [2023-11-30 01:52:33,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:33,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978752801] [2023-11-30 01:52:33,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:33,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:34,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:34,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978752801] [2023-11-30 01:52:34,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978752801] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 01:52:34,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758642055] [2023-11-30 01:52:34,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 01:52:34,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 01:52:34,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 01:52:34,588 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-11-30 01:52:34,605 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-11-30 01:52:35,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 01:52:35,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 01:52:35,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 01:52:35,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 01:52:35,136 INFO L378 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 15 treesize of output 11 [2023-11-30 01:52:35,148 INFO L378 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 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-30 01:52:35,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 01:52:35,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-30 01:52:35,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 01:52:35,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-30 01:52:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2233 trivial. 0 not checked. [2023-11-30 01:52:35,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 01:52:35,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758642055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:52:35,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 01:52:35,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2023-11-30 01:52:35,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307028364] [2023-11-30 01:52:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:52:35,213 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 01:52:35,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:35,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 01:52:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2023-11-30 01:52:35,214 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 432 [2023-11-30 01:52:35,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 684 transitions, 9041 flow. Second operand has 6 states, 6 states have (on average 247.5) internal successors, (1485), 6 states have internal predecessors, (1485), 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-11-30 01:52:35,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:35,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 432 [2023-11-30 01:52:35,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:37,669 INFO L124 PetriNetUnfolderBase]: 1523/5190 cut-off events. [2023-11-30 01:52:37,669 INFO L125 PetriNetUnfolderBase]: For 17301/19111 co-relation queries the response was YES. [2023-11-30 01:52:37,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37632 conditions, 5190 events. 1523/5190 cut-off events. For 17301/19111 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 31379 event pairs, 153 based on Foata normal form. 0/4736 useless extension candidates. Maximal degree in co-relation 32363. Up to 3530 conditions per place. [2023-11-30 01:52:37,698 INFO L140 encePairwiseOnDemand]: 426/432 looper letters, 417 selfloop transitions, 5 changer transitions 2/683 dead transitions. [2023-11-30 01:52:37,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 683 transitions, 9867 flow [2023-11-30 01:52:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 01:52:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 01:52:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1563 transitions. [2023-11-30 01:52:37,701 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6030092592592593 [2023-11-30 01:52:37,701 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1563 transitions. [2023-11-30 01:52:37,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1563 transitions. [2023-11-30 01:52:37,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:37,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1563 transitions. [2023-11-30 01:52:37,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 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-11-30 01:52:37,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:37,706 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:37,706 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 54 predicate places. [2023-11-30 01:52:37,706 INFO L500 AbstractCegarLoop]: Abstraction has has 484 places, 683 transitions, 9867 flow [2023-11-30 01:52:37,707 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.5) internal successors, (1485), 6 states have internal predecessors, (1485), 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-11-30 01:52:37,707 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:37,707 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:52:37,736 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-11-30 01:52:37,913 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 01:52:37,913 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:37,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:37,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1548285974, now seen corresponding path program 1 times [2023-11-30 01:52:37,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:37,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292773267] [2023-11-30 01:52:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:37,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:39,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:39,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:39,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292773267] [2023-11-30 01:52:39,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292773267] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 01:52:39,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710299227] [2023-11-30 01:52:39,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:39,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 01:52:39,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 01:52:39,262 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-11-30 01:52:39,264 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-11-30 01:52:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:40,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 3675 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-30 01:52:40,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 01:52:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:40,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 01:52:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 01:52:41,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710299227] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 01:52:41,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 01:52:41,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-11-30 01:52:41,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956489586] [2023-11-30 01:52:41,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 01:52:41,710 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-30 01:52:41,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-30 01:52:41,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-11-30 01:52:41,715 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 432 [2023-11-30 01:52:41,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 683 transitions, 9867 flow. Second operand has 23 states, 23 states have (on average 406.7391304347826) internal successors, (9355), 23 states have internal predecessors, (9355), 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-11-30 01:52:41,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:41,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 432 [2023-11-30 01:52:41,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:44,992 INFO L124 PetriNetUnfolderBase]: 1523/5527 cut-off events. [2023-11-30 01:52:44,992 INFO L125 PetriNetUnfolderBase]: For 21204/23175 co-relation queries the response was YES. [2023-11-30 01:52:44,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39977 conditions, 5527 events. 1523/5527 cut-off events. For 21204/23175 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31337 event pairs, 129 based on Foata normal form. 0/5067 useless extension candidates. Maximal degree in co-relation 32641. Up to 3674 conditions per place. [2023-11-30 01:52:45,025 INFO L140 encePairwiseOnDemand]: 426/432 looper letters, 161 selfloop transitions, 30 changer transitions 2/734 dead transitions. [2023-11-30 01:52:45,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 734 transitions, 11287 flow [2023-11-30 01:52:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-30 01:52:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-30 01:52:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 12154 transitions. [2023-11-30 01:52:45,035 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9378086419753087 [2023-11-30 01:52:45,035 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 12154 transitions. [2023-11-30 01:52:45,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 12154 transitions. [2023-11-30 01:52:45,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:45,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 12154 transitions. [2023-11-30 01:52:45,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 405.1333333333333) internal successors, (12154), 30 states have internal predecessors, (12154), 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-11-30 01:52:45,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 432.0) internal successors, (13392), 31 states have internal predecessors, (13392), 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-11-30 01:52:45,062 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 432.0) internal successors, (13392), 31 states have internal predecessors, (13392), 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-11-30 01:52:45,063 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 83 predicate places. [2023-11-30 01:52:45,063 INFO L500 AbstractCegarLoop]: Abstraction has has 513 places, 734 transitions, 11287 flow [2023-11-30 01:52:45,065 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 406.7391304347826) internal successors, (9355), 23 states have internal predecessors, (9355), 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-11-30 01:52:45,065 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:45,065 INFO L232 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:52:45,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-30 01:52:45,275 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-30 01:52:45,275 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:45,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:45,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2021504916, now seen corresponding path program 2 times [2023-11-30 01:52:45,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:45,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924537927] [2023-11-30 01:52:45,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4780 trivial. 0 not checked. [2023-11-30 01:52:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:48,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924537927] [2023-11-30 01:52:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924537927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:52:48,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 01:52:48,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 01:52:48,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666386686] [2023-11-30 01:52:48,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:52:48,610 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 01:52:48,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:48,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 01:52:48,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 01:52:48,611 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 432 [2023-11-30 01:52:48,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 734 transitions, 11287 flow. Second operand has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 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-11-30 01:52:48,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:48,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 432 [2023-11-30 01:52:48,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:52:52,573 INFO L124 PetriNetUnfolderBase]: 1817/6133 cut-off events. [2023-11-30 01:52:52,574 INFO L125 PetriNetUnfolderBase]: For 29677/33660 co-relation queries the response was YES. [2023-11-30 01:52:52,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48450 conditions, 6133 events. 1817/6133 cut-off events. For 29677/33660 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 35937 event pairs, 194 based on Foata normal form. 4/5664 useless extension candidates. Maximal degree in co-relation 40601. Up to 4082 conditions per place. [2023-11-30 01:52:52,606 INFO L140 encePairwiseOnDemand]: 409/432 looper letters, 595 selfloop transitions, 134 changer transitions 2/1034 dead transitions. [2023-11-30 01:52:52,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 1034 transitions, 18823 flow [2023-11-30 01:52:52,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 01:52:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 01:52:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1755 transitions. [2023-11-30 01:52:52,608 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2023-11-30 01:52:52,608 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1755 transitions. [2023-11-30 01:52:52,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1755 transitions. [2023-11-30 01:52:52,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:52:52,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1755 transitions. [2023-11-30 01:52:52,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 292.5) internal successors, (1755), 6 states have internal predecessors, (1755), 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-11-30 01:52:52,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:52,611 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:52:52,612 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 88 predicate places. [2023-11-30 01:52:52,612 INFO L500 AbstractCegarLoop]: Abstraction has has 518 places, 1034 transitions, 18823 flow [2023-11-30 01:52:52,612 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 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-11-30 01:52:52,612 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:52:52,612 INFO L232 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:52:52,612 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 01:52:52,613 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:52:52,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:52:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash 730751733, now seen corresponding path program 1 times [2023-11-30 01:52:52,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:52:52,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910254951] [2023-11-30 01:52:52,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:52:52,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:52:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:52:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4780 trivial. 0 not checked. [2023-11-30 01:52:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:52:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910254951] [2023-11-30 01:52:55,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910254951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:52:55,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 01:52:55,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 01:52:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606644288] [2023-11-30 01:52:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:52:55,657 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 01:52:55,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:52:55,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 01:52:55,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 01:52:55,659 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 432 [2023-11-30 01:52:55,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 1034 transitions, 18823 flow. Second operand has 6 states, 6 states have (on average 255.66666666666666) internal successors, (1534), 6 states have internal predecessors, (1534), 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-11-30 01:52:55,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:52:55,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 432 [2023-11-30 01:52:55,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:53:00,615 INFO L124 PetriNetUnfolderBase]: 2184/7025 cut-off events. [2023-11-30 01:53:00,616 INFO L125 PetriNetUnfolderBase]: For 49021/55628 co-relation queries the response was YES. [2023-11-30 01:53:00,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59732 conditions, 7025 events. 2184/7025 cut-off events. For 49021/55628 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 43428 event pairs, 311 based on Foata normal form. 0/6513 useless extension candidates. Maximal degree in co-relation 51365. Up to 4639 conditions per place. [2023-11-30 01:53:00,659 INFO L140 encePairwiseOnDemand]: 409/432 looper letters, 858 selfloop transitions, 135 changer transitions 43/1335 dead transitions. [2023-11-30 01:53:00,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 1335 transitions, 27613 flow [2023-11-30 01:53:00,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 01:53:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 01:53:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1736 transitions. [2023-11-30 01:53:00,661 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6697530864197531 [2023-11-30 01:53:00,661 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1736 transitions. [2023-11-30 01:53:00,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1736 transitions. [2023-11-30 01:53:00,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:53:00,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1736 transitions. [2023-11-30 01:53:00,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 289.3333333333333) internal successors, (1736), 6 states have internal predecessors, (1736), 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-11-30 01:53:00,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:53:00,665 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:53:00,665 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 93 predicate places. [2023-11-30 01:53:00,665 INFO L500 AbstractCegarLoop]: Abstraction has has 523 places, 1335 transitions, 27613 flow [2023-11-30 01:53:00,666 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.66666666666666) internal successors, (1534), 6 states have internal predecessors, (1534), 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-11-30 01:53:00,666 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:53:00,666 INFO L232 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:53:00,666 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 01:53:00,666 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:53:00,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:53:00,667 INFO L85 PathProgramCache]: Analyzing trace with hash -103979776, now seen corresponding path program 1 times [2023-11-30 01:53:00,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:53:00,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509486634] [2023-11-30 01:53:00,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:53:00,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:53:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:53:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4780 trivial. 0 not checked. [2023-11-30 01:53:03,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:53:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509486634] [2023-11-30 01:53:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509486634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 01:53:03,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 01:53:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 01:53:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071778862] [2023-11-30 01:53:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 01:53:03,704 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 01:53:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 01:53:03,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 01:53:03,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 01:53:03,705 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 432 [2023-11-30 01:53:03,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 1335 transitions, 27613 flow. Second operand has 6 states, 6 states have (on average 254.33333333333334) internal successors, (1526), 6 states have internal predecessors, (1526), 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-11-30 01:53:03,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 01:53:03,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 432 [2023-11-30 01:53:03,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 01:53:10,162 INFO L124 PetriNetUnfolderBase]: 2584/7940 cut-off events. [2023-11-30 01:53:10,163 INFO L125 PetriNetUnfolderBase]: For 71334/77651 co-relation queries the response was YES. [2023-11-30 01:53:10,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71313 conditions, 7940 events. 2584/7940 cut-off events. For 71334/77651 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 50613 event pairs, 462 based on Foata normal form. 12/7403 useless extension candidates. Maximal degree in co-relation 62434. Up to 5123 conditions per place. [2023-11-30 01:53:10,225 INFO L140 encePairwiseOnDemand]: 413/432 looper letters, 1002 selfloop transitions, 115 changer transitions 43/1462 dead transitions. [2023-11-30 01:53:10,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 1462 transitions, 33057 flow [2023-11-30 01:53:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 01:53:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 01:53:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1668 transitions. [2023-11-30 01:53:10,227 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6435185185185185 [2023-11-30 01:53:10,227 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1668 transitions. [2023-11-30 01:53:10,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1668 transitions. [2023-11-30 01:53:10,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 01:53:10,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1668 transitions. [2023-11-30 01:53:10,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 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-11-30 01:53:10,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:53:10,251 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 432.0) internal successors, (3024), 7 states have internal predecessors, (3024), 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-11-30 01:53:10,251 INFO L307 CegarLoopForPetriNet]: 430 programPoint places, 98 predicate places. [2023-11-30 01:53:10,251 INFO L500 AbstractCegarLoop]: Abstraction has has 528 places, 1462 transitions, 33057 flow [2023-11-30 01:53:10,251 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 254.33333333333334) internal successors, (1526), 6 states have internal predecessors, (1526), 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-11-30 01:53:10,251 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 01:53:10,252 INFO L232 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-30 01:53:10,252 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 01:53:10,252 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2023-11-30 01:53:10,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 01:53:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1195598394, now seen corresponding path program 1 times [2023-11-30 01:53:10,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 01:53:10,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335914450] [2023-11-30 01:53:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:53:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 01:53:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:53:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 534 proven. 1069 refuted. 0 times theorem prover too weak. 3177 trivial. 0 not checked. [2023-11-30 01:53:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 01:53:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335914450] [2023-11-30 01:53:37,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335914450] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 01:53:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195751946] [2023-11-30 01:53:37,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 01:53:37,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 01:53:37,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 01:53:37,097 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 01:53:37,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-30 01:53:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 01:53:41,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 4989 conjuncts, 255 conjunts are in the unsatisfiable core [2023-11-30 01:53:41,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 01:53:41,714 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 01:53:41,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-30 01:53:41,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-30 01:53:42,014 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-30 01:53:42,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-30 01:53:42,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-30 01:53:42,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-30 01:53:42,348 INFO L378 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 20 treesize of output 8 [2023-11-30 01:53:42,819 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-30 01:53:42,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-30 01:53:43,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-30 01:53:43,435 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-30 01:53:43,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-30 01:53:43,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-30 01:53:43,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-30 01:53:43,958 INFO L378 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 30 treesize of output 12 [2023-11-30 01:53:44,501 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-30 01:53:44,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-30 01:53:44,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-30 01:53:45,222 INFO L349 Elim1Store]: treesize reduction 72, result has 35.7 percent of original size [2023-11-30 01:53:45,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 57 [2023-11-30 01:53:45,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-11-30 01:53:45,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2023-11-30 01:53:45,973 INFO L378 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 51 treesize of output 21 [2023-11-30 01:53:47,329 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2023-11-30 01:53:47,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2023-11-30 01:53:48,217 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2023-11-30 01:53:48,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2023-11-30 01:53:50,608 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2023-11-30 01:53:50,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2023-11-30 01:53:51,629 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-11-30 01:53:51,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2023-11-30 01:53:54,625 INFO L349 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2023-11-30 01:53:54,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2023-11-30 01:53:57,124 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2023-11-30 01:53:57,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76 [2023-11-30 01:54:02,912 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2023-11-30 01:54:02,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 76 [2023-11-30 01:54:05,248 INFO L349 Elim1Store]: treesize reduction 108, result has 33.7 percent of original size [2023-11-30 01:54:05,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 81 [2023-11-30 01:54:18,565 INFO L349 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2023-11-30 01:54:18,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 88 [2023-11-30 01:54:21,424 INFO L349 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2023-11-30 01:54:21,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 88 [2023-11-30 01:54:36,600 INFO L349 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2023-11-30 01:54:36,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 62 [2023-11-30 01:54:52,939 INFO L349 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2023-11-30 01:54:52,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 62 [2023-11-30 01:55:07,419 INFO L349 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2023-11-30 01:55:07,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 62 [2023-11-30 01:55:18,597 INFO L349 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2023-11-30 01:55:18,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 62 [2023-11-30 01:55:35,165 INFO L349 Elim1Store]: treesize reduction 84, result has 43.2 percent of original size [2023-11-30 01:55:35,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 44 treesize of output 85 [2023-11-30 01:55:53,388 WARN L293 SmtUtils]: Spent 13.06s on a formula simplification. DAG size of input: 3076 DAG size of output: 337 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-30 01:55:53,389 INFO L349 Elim1Store]: treesize reduction 5772, result has 9.8 percent of original size [2023-11-30 01:55:53,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 38 select indices, 38 select index equivalence classes, 0 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 740 case distinctions, treesize of input 652 treesize of output 1197 [2023-11-30 02:04:38,885 WARN L293 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 448 DAG size of output: 450 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-11-30 02:05:55,141 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 02:05:55,141 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 02:05:55,242 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2023-11-30 02:05:55,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-30 02:05:55,456 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-30 02:05:55,457 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. [2023-11-30 02:05:55,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2023-11-30 02:05:55,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2023-11-30 02:05:55,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2023-11-30 02:05:55,458 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2023-11-30 02:05:55,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2023-11-30 02:05:55,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2023-11-30 02:05:55,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2023-11-30 02:05:55,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2023-11-30 02:05:55,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2023-11-30 02:05:55,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2023-11-30 02:05:55,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2023-11-30 02:05:55,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2023-11-30 02:05:55,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2023-11-30 02:05:55,459 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2023-11-30 02:05:55,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2023-11-30 02:05:55,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2023-11-30 02:05:55,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2023-11-30 02:05:55,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2023-11-30 02:05:55,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2023-11-30 02:05:55,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (16 of 37 remaining) [2023-11-30 02:05:55,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2023-11-30 02:05:55,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2023-11-30 02:05:55,460 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2023-11-30 02:05:55,461 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 37 remaining) [2023-11-30 02:05:55,461 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2023-11-30 02:05:55,461 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2023-11-30 02:05:55,461 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2023-11-30 02:05:55,461 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2023-11-30 02:05:55,461 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2023-11-30 02:05:55,461 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2023-11-30 02:05:55,461 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2023-11-30 02:05:55,461 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2023-11-30 02:05:55,461 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2023-11-30 02:05:55,462 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2023-11-30 02:05:55,462 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2023-11-30 02:05:55,462 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2023-11-30 02:05:55,462 INFO L457 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:05:55,467 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 02:05:55,467 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 02:05:55,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:05:55 BasicIcfg [2023-11-30 02:05:55,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 02:05:55,470 INFO L158 Benchmark]: Toolchain (without parser) took 821615.73ms. Allocated memory was 666.9MB in the beginning and 8.4GB in the end (delta: 7.8GB). Free memory was 616.1MB in the beginning and 2.6GB in the end (delta: -2.0GB). Peak memory consumption was 6.7GB. Max. memory is 16.0GB. [2023-11-30 02:05:55,470 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 385.9MB. Free memory is still 332.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 02:05:55,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.99ms. Allocated memory is still 666.9MB. Free memory was 616.1MB in the beginning and 575.6MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-11-30 02:05:55,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.90ms. Allocated memory is still 666.9MB. Free memory was 575.6MB in the beginning and 570.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 02:05:55,470 INFO L158 Benchmark]: Boogie Preprocessor took 40.60ms. Allocated memory is still 666.9MB. Free memory was 570.2MB in the beginning and 565.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 02:05:55,471 INFO L158 Benchmark]: RCFGBuilder took 784.18ms. Allocated memory is still 666.9MB. Free memory was 565.8MB in the beginning and 516.3MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.0GB. [2023-11-30 02:05:55,471 INFO L158 Benchmark]: TraceAbstraction took 820240.58ms. Allocated memory was 666.9MB in the beginning and 8.4GB in the end (delta: 7.8GB). Free memory was 515.7MB in the beginning and 2.6GB in the end (delta: -2.1GB). Peak memory consumption was 6.6GB. Max. memory is 16.0GB. [2023-11-30 02:05:55,472 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.10ms. Allocated memory is still 385.9MB. Free memory is still 332.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 478.99ms. Allocated memory is still 666.9MB. Free memory was 616.1MB in the beginning and 575.6MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.90ms. Allocated memory is still 666.9MB. Free memory was 575.6MB in the beginning and 570.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.60ms. Allocated memory is still 666.9MB. Free memory was 570.2MB in the beginning and 565.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 784.18ms. Allocated memory is still 666.9MB. Free memory was 565.8MB in the beginning and 516.3MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.0GB. * TraceAbstraction took 820240.58ms. Allocated memory was 666.9MB in the beginning and 8.4GB in the end (delta: 7.8GB). Free memory was 515.7MB in the beginning and 2.6GB in the end (delta: -2.1GB). Peak memory consumption was 6.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1270]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1256]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1265]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1257]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1267]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1270]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1271]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1268]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1249]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1265 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-25-1 term,while PolyPacSimplificationTermWalker was simplifying 25 xjuncts wrt. a ∧-45-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 519 locations, 37 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 820.1s, OverallIterations: 17, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 32.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 478 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 2103 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5874 IncrementalHoareTripleChecker+Invalid, 6165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 2064 mSDtfsCounter, 5874 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4530 GetRequests, 4369 SyntacticMatches, 11 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33057occurred in iteration=16, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 9975 NumberOfCodeBlocks, 8915 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 11510 ConstructedInterpolants, 0 QuantifiedInterpolants, 21798 SizeOfPredicates, 22 NumberOfNonLiveVariables, 6753 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 24 InterpolantComputations, 13 PerfectInterpolantSequences, 16894/27113 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown