/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 07:32:00,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 07:32:00,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 07:32:00,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 07:32:00,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 07:32:00,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 07:32:00,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 07:32:00,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 07:32:00,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 07:32:00,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 07:32:00,511 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 07:32:00,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 07:32:00,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 07:32:00,513 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 07:32:00,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 07:32:00,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 07:32:00,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 07:32:00,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 07:32:00,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 07:32:00,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 07:32:00,514 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 07:32:00,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 07:32:00,515 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 07:32:00,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 07:32:00,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 07:32:00,516 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 07:32:00,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 07:32:00,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 07:32:00,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 07:32:00,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 07:32:00,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 07:32:00,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 07:32:00,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 07:32:00,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 07:32:00,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 07:32:00,519 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 07:32:00,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 07:32:00,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 07:32:00,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 07:32:00,885 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 07:32:00,885 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 07:32:00,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2023-08-25 07:32:02,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 07:32:02,233 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 07:32:02,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2023-08-25 07:32:02,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b767d345e/18be2fa4ae5e40d4b7a9b62286f07e25/FLAGc4b395862 [2023-08-25 07:32:02,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b767d345e/18be2fa4ae5e40d4b7a9b62286f07e25 [2023-08-25 07:32:02,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 07:32:02,254 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 07:32:02,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 07:32:02,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 07:32:02,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 07:32:02,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4219be07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02, skipping insertion in model container [2023-08-25 07:32:02,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,278 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 07:32:02,498 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 07:32:02,508 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 07:32:02,567 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 07:32:02,582 INFO L206 MainTranslator]: Completed translation [2023-08-25 07:32:02,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02 WrapperNode [2023-08-25 07:32:02,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 07:32:02,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 07:32:02,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 07:32:02,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 07:32:02,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,656 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 489 [2023-08-25 07:32:02,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 07:32:02,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 07:32:02,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 07:32:02,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 07:32:02,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 07:32:02,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 07:32:02,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 07:32:02,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 07:32:02,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02" (1/1) ... [2023-08-25 07:32:02,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 07:32:02,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:32:02,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 07:32:02,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 07:32:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 07:32:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 07:32:02,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 07:32:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 07:32:02,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 07:32:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 07:32:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 07:32:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 07:32:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 07:32:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 07:32:02,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 07:32:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 07:32:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 07:32:02,821 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 07:32:02,939 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 07:32:02,940 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 07:32:03,694 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 07:32:03,712 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 07:32:03,713 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-25 07:32:03,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:32:03 BoogieIcfgContainer [2023-08-25 07:32:03,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 07:32:03,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 07:32:03,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 07:32:03,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 07:32:03,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 07:32:02" (1/3) ... [2023-08-25 07:32:03,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad907bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:32:03, skipping insertion in model container [2023-08-25 07:32:03,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:32:02" (2/3) ... [2023-08-25 07:32:03,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad907bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:32:03, skipping insertion in model container [2023-08-25 07:32:03,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:32:03" (3/3) ... [2023-08-25 07:32:03,723 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2023-08-25 07:32:03,736 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 07:32:03,736 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 87 error locations. [2023-08-25 07:32:03,737 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 07:32:03,898 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-25 07:32:03,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 590 places, 617 transitions, 1250 flow [2023-08-25 07:32:04,163 INFO L124 PetriNetUnfolderBase]: 34/615 cut-off events. [2023-08-25 07:32:04,163 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 07:32:04,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 615 events. 34/615 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1838 event pairs, 0 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 487. Up to 2 conditions per place. [2023-08-25 07:32:04,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 590 places, 617 transitions, 1250 flow [2023-08-25 07:32:04,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 579 places, 606 transitions, 1224 flow [2023-08-25 07:32:04,196 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 07:32:04,209 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 579 places, 606 transitions, 1224 flow [2023-08-25 07:32:04,211 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 579 places, 606 transitions, 1224 flow [2023-08-25 07:32:04,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 579 places, 606 transitions, 1224 flow [2023-08-25 07:32:04,320 INFO L124 PetriNetUnfolderBase]: 34/606 cut-off events. [2023-08-25 07:32:04,320 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 07:32:04,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 606 events. 34/606 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1820 event pairs, 0 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 487. Up to 2 conditions per place. [2023-08-25 07:32:04,352 INFO L119 LiptonReduction]: Number of co-enabled transitions 59800 [2023-08-25 07:32:14,227 INFO L134 LiptonReduction]: Checked pairs total: 241078 [2023-08-25 07:32:14,227 INFO L136 LiptonReduction]: Total number of compositions: 611 [2023-08-25 07:32:14,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 07:32:14,244 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3759e721, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 07:32:14,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 165 error locations. [2023-08-25 07:32:14,245 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 07:32:14,245 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 07:32:14,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 07:32:14,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:14,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 07:32:14,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:14,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2452, now seen corresponding path program 1 times [2023-08-25 07:32:14,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:14,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21370120] [2023-08-25 07:32:14,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:14,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:32:14,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21370120] [2023-08-25 07:32:14,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21370120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:14,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:14,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 07:32:14,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110159029] [2023-08-25 07:32:14,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:14,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 07:32:14,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 07:32:14,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 07:32:14,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 1228 [2023-08-25 07:32:14,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 232 transitions, 476 flow. Second operand has 2 states, 2 states have (on average 595.5) internal successors, (1191), 2 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:14,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:14,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 1228 [2023-08-25 07:32:14,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:14,947 INFO L124 PetriNetUnfolderBase]: 1923/4659 cut-off events. [2023-08-25 07:32:14,947 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2023-08-25 07:32:14,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7800 conditions, 4659 events. 1923/4659 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 36429 event pairs, 1478 based on Foata normal form. 717/4823 useless extension candidates. Maximal degree in co-relation 6925. Up to 3057 conditions per place. [2023-08-25 07:32:14,984 INFO L140 encePairwiseOnDemand]: 1172/1228 looper letters, 87 selfloop transitions, 0 changer transitions 0/176 dead transitions. [2023-08-25 07:32:14,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 176 transitions, 538 flow [2023-08-25 07:32:14,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 07:32:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 07:32:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1333 transitions. [2023-08-25 07:32:15,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5427524429967426 [2023-08-25 07:32:15,004 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1333 transitions. [2023-08-25 07:32:15,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1333 transitions. [2023-08-25 07:32:15,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:15,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1333 transitions. [2023-08-25 07:32:15,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 666.5) internal successors, (1333), 2 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:15,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 1228.0) internal successors, (3684), 3 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:15,027 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 1228.0) internal successors, (3684), 3 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:15,028 INFO L175 Difference]: Start difference. First operand has 220 places, 232 transitions, 476 flow. Second operand 2 states and 1333 transitions. [2023-08-25 07:32:15,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 176 transitions, 538 flow [2023-08-25 07:32:15,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 176 transitions, 530 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 07:32:15,038 INFO L231 Difference]: Finished difference. Result has 169 places, 176 transitions, 356 flow [2023-08-25 07:32:15,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=356, PETRI_PLACES=169, PETRI_TRANSITIONS=176} [2023-08-25 07:32:15,043 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -51 predicate places. [2023-08-25 07:32:15,043 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 176 transitions, 356 flow [2023-08-25 07:32:15,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 595.5) internal successors, (1191), 2 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:15,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:15,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 07:32:15,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 07:32:15,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:15,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash 490402646, now seen corresponding path program 1 times [2023-08-25 07:32:15,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:15,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220498646] [2023-08-25 07:32:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:32:15,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:15,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220498646] [2023-08-25 07:32:15,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220498646] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:15,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:15,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:32:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511654470] [2023-08-25 07:32:15,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:15,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:32:15,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:15,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:32:15,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:32:15,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 574 out of 1228 [2023-08-25 07:32:15,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 176 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 575.6666666666666) internal successors, (1727), 3 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:15,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:15,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 574 of 1228 [2023-08-25 07:32:15,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:15,633 INFO L124 PetriNetUnfolderBase]: 2123/4959 cut-off events. [2023-08-25 07:32:15,634 INFO L125 PetriNetUnfolderBase]: For 68/85 co-relation queries the response was YES. [2023-08-25 07:32:15,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8457 conditions, 4959 events. 2123/4959 cut-off events. For 68/85 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 37416 event pairs, 1056 based on Foata normal form. 1/4542 useless extension candidates. Maximal degree in co-relation 8454. Up to 3478 conditions per place. [2023-08-25 07:32:15,661 INFO L140 encePairwiseOnDemand]: 1220/1228 looper letters, 96 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2023-08-25 07:32:15,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 175 transitions, 551 flow [2023-08-25 07:32:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:32:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:32:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1826 transitions. [2023-08-25 07:32:15,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495656894679696 [2023-08-25 07:32:15,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1826 transitions. [2023-08-25 07:32:15,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1826 transitions. [2023-08-25 07:32:15,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:15,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1826 transitions. [2023-08-25 07:32:15,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 608.6666666666666) internal successors, (1826), 3 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:15,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:15,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:15,679 INFO L175 Difference]: Start difference. First operand has 169 places, 176 transitions, 356 flow. Second operand 3 states and 1826 transitions. [2023-08-25 07:32:15,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 175 transitions, 551 flow [2023-08-25 07:32:15,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 175 transitions, 551 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:32:15,683 INFO L231 Difference]: Finished difference. Result has 166 places, 172 transitions, 358 flow [2023-08-25 07:32:15,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=166, PETRI_TRANSITIONS=172} [2023-08-25 07:32:15,684 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -54 predicate places. [2023-08-25 07:32:15,684 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 172 transitions, 358 flow [2023-08-25 07:32:15,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 575.6666666666666) internal successors, (1727), 3 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:15,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:15,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:15,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 07:32:15,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:15,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1168477798, now seen corresponding path program 1 times [2023-08-25 07:32:15,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:15,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581555052] [2023-08-25 07:32:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:15,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:32:15,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:15,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581555052] [2023-08-25 07:32:15,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581555052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:15,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:15,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:32:15,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839261366] [2023-08-25 07:32:15,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:15,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:32:15,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:15,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:32:15,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:32:15,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 1228 [2023-08-25 07:32:15,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 172 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 558.0) internal successors, (1674), 3 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:15,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:15,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 1228 [2023-08-25 07:32:15,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:16,224 INFO L124 PetriNetUnfolderBase]: 1802/4517 cut-off events. [2023-08-25 07:32:16,224 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-25 07:32:16,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7615 conditions, 4517 events. 1802/4517 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 34656 event pairs, 1542 based on Foata normal form. 0/4083 useless extension candidates. Maximal degree in co-relation 7611. Up to 3018 conditions per place. [2023-08-25 07:32:16,254 INFO L140 encePairwiseOnDemand]: 1217/1228 looper letters, 86 selfloop transitions, 1 changer transitions 0/162 dead transitions. [2023-08-25 07:32:16,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 162 transitions, 512 flow [2023-08-25 07:32:16,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:32:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:32:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1765 transitions. [2023-08-25 07:32:16,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790988056460369 [2023-08-25 07:32:16,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1765 transitions. [2023-08-25 07:32:16,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1765 transitions. [2023-08-25 07:32:16,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:16,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1765 transitions. [2023-08-25 07:32:16,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 588.3333333333334) internal successors, (1765), 3 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:16,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:16,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:16,271 INFO L175 Difference]: Start difference. First operand has 166 places, 172 transitions, 358 flow. Second operand 3 states and 1765 transitions. [2023-08-25 07:32:16,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 162 transitions, 512 flow [2023-08-25 07:32:16,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 162 transitions, 512 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:32:16,276 INFO L231 Difference]: Finished difference. Result has 158 places, 162 transitions, 340 flow [2023-08-25 07:32:16,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=158, PETRI_TRANSITIONS=162} [2023-08-25 07:32:16,278 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -62 predicate places. [2023-08-25 07:32:16,278 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 162 transitions, 340 flow [2023-08-25 07:32:16,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 558.0) internal successors, (1674), 3 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:16,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:16,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:16,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 07:32:16,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:16,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:16,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1405656490, now seen corresponding path program 1 times [2023-08-25 07:32:16,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:16,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944803555] [2023-08-25 07:32:16,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:16,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:32:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944803555] [2023-08-25 07:32:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944803555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:16,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:16,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:32:16,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729551264] [2023-08-25 07:32:16,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:16,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:32:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:16,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:32:16,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:32:16,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 1228 [2023-08-25 07:32:16,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 162 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:16,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:16,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 1228 [2023-08-25 07:32:16,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:17,278 INFO L124 PetriNetUnfolderBase]: 4162/8065 cut-off events. [2023-08-25 07:32:17,278 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2023-08-25 07:32:17,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15353 conditions, 8065 events. 4162/8065 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 55707 event pairs, 1372 based on Foata normal form. 0/7149 useless extension candidates. Maximal degree in co-relation 15348. Up to 4718 conditions per place. [2023-08-25 07:32:17,319 INFO L140 encePairwiseOnDemand]: 1217/1228 looper letters, 189 selfloop transitions, 7 changer transitions 0/234 dead transitions. [2023-08-25 07:32:17,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 234 transitions, 878 flow [2023-08-25 07:32:17,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:32:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:32:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2023-08-25 07:32:17,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46389793702497284 [2023-08-25 07:32:17,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1709 transitions. [2023-08-25 07:32:17,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1709 transitions. [2023-08-25 07:32:17,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:17,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1709 transitions. [2023-08-25 07:32:17,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 569.6666666666666) internal successors, (1709), 3 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:17,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:17,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:17,337 INFO L175 Difference]: Start difference. First operand has 158 places, 162 transitions, 340 flow. Second operand 3 states and 1709 transitions. [2023-08-25 07:32:17,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 234 transitions, 878 flow [2023-08-25 07:32:17,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 234 transitions, 877 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:32:17,341 INFO L231 Difference]: Finished difference. Result has 160 places, 168 transitions, 392 flow [2023-08-25 07:32:17,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=160, PETRI_TRANSITIONS=168} [2023-08-25 07:32:17,342 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -60 predicate places. [2023-08-25 07:32:17,342 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 168 transitions, 392 flow [2023-08-25 07:32:17,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:17,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:17,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:17,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 07:32:17,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:17,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:17,344 INFO L85 PathProgramCache]: Analyzing trace with hash -568963027, now seen corresponding path program 1 times [2023-08-25 07:32:17,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:17,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025209024] [2023-08-25 07:32:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:32:17,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:17,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025209024] [2023-08-25 07:32:17,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025209024] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:17,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:17,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:32:17,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334060947] [2023-08-25 07:32:17,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:17,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:32:17,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:17,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:32:17,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:32:17,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 577 out of 1228 [2023-08-25 07:32:17,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 168 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 579.0) internal successors, (1737), 3 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:17,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:17,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 577 of 1228 [2023-08-25 07:32:17,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:18,062 INFO L124 PetriNetUnfolderBase]: 2712/6617 cut-off events. [2023-08-25 07:32:18,062 INFO L125 PetriNetUnfolderBase]: For 317/317 co-relation queries the response was YES. [2023-08-25 07:32:18,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11738 conditions, 6617 events. 2712/6617 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 51942 event pairs, 2397 based on Foata normal form. 0/6179 useless extension candidates. Maximal degree in co-relation 11732. Up to 4606 conditions per place. [2023-08-25 07:32:18,096 INFO L140 encePairwiseOnDemand]: 1225/1228 looper letters, 92 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2023-08-25 07:32:18,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 169 transitions, 582 flow [2023-08-25 07:32:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:32:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:32:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1820 transitions. [2023-08-25 07:32:18,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494028230184582 [2023-08-25 07:32:18,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1820 transitions. [2023-08-25 07:32:18,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1820 transitions. [2023-08-25 07:32:18,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:18,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1820 transitions. [2023-08-25 07:32:18,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 606.6666666666666) internal successors, (1820), 3 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:18,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:18,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:18,112 INFO L175 Difference]: Start difference. First operand has 160 places, 168 transitions, 392 flow. Second operand 3 states and 1820 transitions. [2023-08-25 07:32:18,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 169 transitions, 582 flow [2023-08-25 07:32:18,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 169 transitions, 575 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:32:18,116 INFO L231 Difference]: Finished difference. Result has 162 places, 169 transitions, 397 flow [2023-08-25 07:32:18,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=162, PETRI_TRANSITIONS=169} [2023-08-25 07:32:18,117 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -58 predicate places. [2023-08-25 07:32:18,117 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 169 transitions, 397 flow [2023-08-25 07:32:18,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 579.0) internal successors, (1737), 3 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:18,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:18,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:18,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 07:32:18,119 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:18,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:18,119 INFO L85 PathProgramCache]: Analyzing trace with hash -13156322, now seen corresponding path program 1 times [2023-08-25 07:32:18,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:18,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743982052] [2023-08-25 07:32:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:18,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:18,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:18,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743982052] [2023-08-25 07:32:18,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743982052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:18,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:18,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:32:18,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157324323] [2023-08-25 07:32:18,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:18,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:32:18,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:18,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:32:18,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:32:18,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 1228 [2023-08-25 07:32:18,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 169 transitions, 397 flow. Second operand has 6 states, 6 states have (on average 512.8333333333334) internal successors, (3077), 6 states have internal predecessors, (3077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:18,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:18,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 1228 [2023-08-25 07:32:18,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:21,979 INFO L124 PetriNetUnfolderBase]: 24145/38848 cut-off events. [2023-08-25 07:32:21,979 INFO L125 PetriNetUnfolderBase]: For 912/912 co-relation queries the response was YES. [2023-08-25 07:32:22,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78527 conditions, 38848 events. 24145/38848 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 275449 event pairs, 1860 based on Foata normal form. 0/35910 useless extension candidates. Maximal degree in co-relation 78520. Up to 14902 conditions per place. [2023-08-25 07:32:22,205 INFO L140 encePairwiseOnDemand]: 1223/1228 looper letters, 637 selfloop transitions, 4 changer transitions 0/664 dead transitions. [2023-08-25 07:32:22,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 664 transitions, 2797 flow [2023-08-25 07:32:22,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:32:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:32:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3677 transitions. [2023-08-25 07:32:22,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4990499457111835 [2023-08-25 07:32:22,215 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3677 transitions. [2023-08-25 07:32:22,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3677 transitions. [2023-08-25 07:32:22,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:22,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3677 transitions. [2023-08-25 07:32:22,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 612.8333333333334) internal successors, (3677), 6 states have internal predecessors, (3677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:22,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:22,248 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:22,248 INFO L175 Difference]: Start difference. First operand has 162 places, 169 transitions, 397 flow. Second operand 6 states and 3677 transitions. [2023-08-25 07:32:22,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 664 transitions, 2797 flow [2023-08-25 07:32:22,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 664 transitions, 2793 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 07:32:22,261 INFO L231 Difference]: Finished difference. Result has 165 places, 168 transitions, 399 flow [2023-08-25 07:32:22,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=165, PETRI_TRANSITIONS=168} [2023-08-25 07:32:22,264 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -55 predicate places. [2023-08-25 07:32:22,264 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 168 transitions, 399 flow [2023-08-25 07:32:22,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 512.8333333333334) internal successors, (3077), 6 states have internal predecessors, (3077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:22,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:22,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:22,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 07:32:22,266 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:22,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1363847651, now seen corresponding path program 1 times [2023-08-25 07:32:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:22,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642164446] [2023-08-25 07:32:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:22,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:22,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642164446] [2023-08-25 07:32:22,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642164446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:22,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:22,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:32:22,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944112675] [2023-08-25 07:32:22,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:22,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:32:22,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:22,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:32:22,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:32:22,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 1228 [2023-08-25 07:32:22,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 168 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:22,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:22,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 1228 [2023-08-25 07:32:22,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:23,018 INFO L124 PetriNetUnfolderBase]: 3736/8089 cut-off events. [2023-08-25 07:32:23,018 INFO L125 PetriNetUnfolderBase]: For 1413/1413 co-relation queries the response was YES. [2023-08-25 07:32:23,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15807 conditions, 8089 events. 3736/8089 cut-off events. For 1413/1413 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 59869 event pairs, 802 based on Foata normal form. 0/7443 useless extension candidates. Maximal degree in co-relation 15800. Up to 5486 conditions per place. [2023-08-25 07:32:23,055 INFO L140 encePairwiseOnDemand]: 1212/1228 looper letters, 128 selfloop transitions, 6 changer transitions 0/195 dead transitions. [2023-08-25 07:32:23,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 195 transitions, 726 flow [2023-08-25 07:32:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:32:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:32:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1823 transitions. [2023-08-25 07:32:23,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494842562432139 [2023-08-25 07:32:23,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1823 transitions. [2023-08-25 07:32:23,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1823 transitions. [2023-08-25 07:32:23,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:23,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1823 transitions. [2023-08-25 07:32:23,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 607.6666666666666) internal successors, (1823), 3 states have internal predecessors, (1823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:23,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:23,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:23,069 INFO L175 Difference]: Start difference. First operand has 165 places, 168 transitions, 399 flow. Second operand 3 states and 1823 transitions. [2023-08-25 07:32:23,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 195 transitions, 726 flow [2023-08-25 07:32:23,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 195 transitions, 717 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 07:32:23,075 INFO L231 Difference]: Finished difference. Result has 154 places, 164 transitions, 414 flow [2023-08-25 07:32:23,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=154, PETRI_TRANSITIONS=164} [2023-08-25 07:32:23,076 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -66 predicate places. [2023-08-25 07:32:23,076 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 164 transitions, 414 flow [2023-08-25 07:32:23,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:23,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:23,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:23,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 07:32:23,077 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:23,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:23,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2105533571, now seen corresponding path program 1 times [2023-08-25 07:32:23,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:23,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560133746] [2023-08-25 07:32:23,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:23,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:23,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:23,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560133746] [2023-08-25 07:32:23,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560133746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:23,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:23,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:32:23,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874754335] [2023-08-25 07:32:23,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:23,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:32:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:23,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:32:23,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:32:23,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 1228 [2023-08-25 07:32:23,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 164 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 502.3333333333333) internal successors, (3014), 6 states have internal predecessors, (3014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:23,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:23,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 1228 [2023-08-25 07:32:23,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:27,262 INFO L124 PetriNetUnfolderBase]: 25867/41157 cut-off events. [2023-08-25 07:32:27,262 INFO L125 PetriNetUnfolderBase]: For 891/891 co-relation queries the response was YES. [2023-08-25 07:32:27,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86689 conditions, 41157 events. 25867/41157 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 273619 event pairs, 16162 based on Foata normal form. 0/38184 useless extension candidates. Maximal degree in co-relation 86682. Up to 29461 conditions per place. [2023-08-25 07:32:27,492 INFO L140 encePairwiseOnDemand]: 1222/1228 looper letters, 619 selfloop transitions, 5 changer transitions 0/639 dead transitions. [2023-08-25 07:32:27,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 639 transitions, 2780 flow [2023-08-25 07:32:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:32:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:32:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3590 transitions. [2023-08-25 07:32:27,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48724212812160694 [2023-08-25 07:32:27,502 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3590 transitions. [2023-08-25 07:32:27,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3590 transitions. [2023-08-25 07:32:27,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:27,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3590 transitions. [2023-08-25 07:32:27,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 598.3333333333334) internal successors, (3590), 6 states have internal predecessors, (3590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:27,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:27,521 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:27,521 INFO L175 Difference]: Start difference. First operand has 154 places, 164 transitions, 414 flow. Second operand 6 states and 3590 transitions. [2023-08-25 07:32:27,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 639 transitions, 2780 flow [2023-08-25 07:32:27,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 639 transitions, 2780 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:32:27,532 INFO L231 Difference]: Finished difference. Result has 158 places, 163 transitions, 422 flow [2023-08-25 07:32:27,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=158, PETRI_TRANSITIONS=163} [2023-08-25 07:32:27,532 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -62 predicate places. [2023-08-25 07:32:27,533 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 163 transitions, 422 flow [2023-08-25 07:32:27,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 502.3333333333333) internal successors, (3014), 6 states have internal predecessors, (3014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:27,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:27,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:27,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 07:32:27,534 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:27,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:27,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1853917298, now seen corresponding path program 1 times [2023-08-25 07:32:27,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:27,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284339448] [2023-08-25 07:32:27,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:27,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:27,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284339448] [2023-08-25 07:32:27,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284339448] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:27,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:27,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:32:27,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24339820] [2023-08-25 07:32:27,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:27,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:32:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:27,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:32:27,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:32:27,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 1228 [2023-08-25 07:32:27,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 163 transitions, 422 flow. Second operand has 6 states, 6 states have (on average 478.6666666666667) internal successors, (2872), 6 states have internal predecessors, (2872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:27,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:27,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 1228 [2023-08-25 07:32:27,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:30,923 INFO L124 PetriNetUnfolderBase]: 23287/37548 cut-off events. [2023-08-25 07:32:30,923 INFO L125 PetriNetUnfolderBase]: For 4293/4293 co-relation queries the response was YES. [2023-08-25 07:32:30,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83389 conditions, 37548 events. 23287/37548 cut-off events. For 4293/4293 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 247194 event pairs, 12912 based on Foata normal form. 910/36292 useless extension candidates. Maximal degree in co-relation 83381. Up to 22897 conditions per place. [2023-08-25 07:32:31,054 INFO L140 encePairwiseOnDemand]: 1173/1228 looper letters, 179 selfloop transitions, 52 changer transitions 0/246 dead transitions. [2023-08-25 07:32:31,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 246 transitions, 1098 flow [2023-08-25 07:32:31,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:32:31,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:32:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3085 transitions. [2023-08-25 07:32:31,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4187024972855592 [2023-08-25 07:32:31,064 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3085 transitions. [2023-08-25 07:32:31,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3085 transitions. [2023-08-25 07:32:31,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:31,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3085 transitions. [2023-08-25 07:32:31,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 514.1666666666666) internal successors, (3085), 6 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:31,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:31,079 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:31,079 INFO L175 Difference]: Start difference. First operand has 158 places, 163 transitions, 422 flow. Second operand 6 states and 3085 transitions. [2023-08-25 07:32:31,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 246 transitions, 1098 flow [2023-08-25 07:32:31,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 246 transitions, 1048 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 07:32:31,105 INFO L231 Difference]: Finished difference. Result has 149 places, 154 transitions, 498 flow [2023-08-25 07:32:31,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=149, PETRI_TRANSITIONS=154} [2023-08-25 07:32:31,106 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -71 predicate places. [2023-08-25 07:32:31,106 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 154 transitions, 498 flow [2023-08-25 07:32:31,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 478.6666666666667) internal successors, (2872), 6 states have internal predecessors, (2872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:31,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:31,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:31,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 07:32:31,107 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:31,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:31,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2107011209, now seen corresponding path program 1 times [2023-08-25 07:32:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:31,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626241394] [2023-08-25 07:32:31,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:31,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:31,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:31,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626241394] [2023-08-25 07:32:31,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626241394] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:31,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:31,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:32:31,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165381334] [2023-08-25 07:32:31,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:31,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:32:31,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:31,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:32:31,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:32:31,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 1228 [2023-08-25 07:32:31,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 154 transitions, 498 flow. Second operand has 6 states, 6 states have (on average 514.0) internal successors, (3084), 6 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:31,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:31,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 1228 [2023-08-25 07:32:31,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:34,574 INFO L124 PetriNetUnfolderBase]: 23113/37173 cut-off events. [2023-08-25 07:32:34,574 INFO L125 PetriNetUnfolderBase]: For 1017/1017 co-relation queries the response was YES. [2023-08-25 07:32:34,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84903 conditions, 37173 events. 23113/37173 cut-off events. For 1017/1017 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 243901 event pairs, 19966 based on Foata normal form. 0/35179 useless extension candidates. Maximal degree in co-relation 84895. Up to 34309 conditions per place. [2023-08-25 07:32:34,748 INFO L140 encePairwiseOnDemand]: 1223/1228 looper letters, 554 selfloop transitions, 4 changer transitions 8/581 dead transitions. [2023-08-25 07:32:34,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 581 transitions, 3108 flow [2023-08-25 07:32:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:32:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:32:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3582 transitions. [2023-08-25 07:32:34,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48615635179153094 [2023-08-25 07:32:34,757 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3582 transitions. [2023-08-25 07:32:34,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3582 transitions. [2023-08-25 07:32:34,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:34,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3582 transitions. [2023-08-25 07:32:34,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 597.0) internal successors, (3582), 6 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:34,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:34,776 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:34,776 INFO L175 Difference]: Start difference. First operand has 149 places, 154 transitions, 498 flow. Second operand 6 states and 3582 transitions. [2023-08-25 07:32:34,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 581 transitions, 3108 flow [2023-08-25 07:32:34,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 581 transitions, 2588 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 07:32:34,997 INFO L231 Difference]: Finished difference. Result has 148 places, 153 transitions, 400 flow [2023-08-25 07:32:34,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=148, PETRI_TRANSITIONS=153} [2023-08-25 07:32:34,998 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -72 predicate places. [2023-08-25 07:32:34,999 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 153 transitions, 400 flow [2023-08-25 07:32:34,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 514.0) internal successors, (3084), 6 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:35,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:35,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:35,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 07:32:35,000 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:35,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:35,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1842654047, now seen corresponding path program 1 times [2023-08-25 07:32:35,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:35,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352546578] [2023-08-25 07:32:35,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:35,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:35,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:35,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352546578] [2023-08-25 07:32:35,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352546578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:35,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:35,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 07:32:35,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010085214] [2023-08-25 07:32:35,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:35,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 07:32:35,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:35,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 07:32:35,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-25 07:32:35,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 1228 [2023-08-25 07:32:35,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 153 transitions, 400 flow. Second operand has 4 states, 4 states have (on average 566.5) internal successors, (2266), 4 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:35,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:35,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 1228 [2023-08-25 07:32:35,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:35,649 INFO L124 PetriNetUnfolderBase]: 2733/5960 cut-off events. [2023-08-25 07:32:35,649 INFO L125 PetriNetUnfolderBase]: For 417/425 co-relation queries the response was YES. [2023-08-25 07:32:35,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11472 conditions, 5960 events. 2733/5960 cut-off events. For 417/425 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 40971 event pairs, 1621 based on Foata normal form. 30/5614 useless extension candidates. Maximal degree in co-relation 11464. Up to 3262 conditions per place. [2023-08-25 07:32:35,673 INFO L140 encePairwiseOnDemand]: 1222/1228 looper letters, 132 selfloop transitions, 5 changer transitions 0/190 dead transitions. [2023-08-25 07:32:35,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 190 transitions, 750 flow [2023-08-25 07:32:35,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 07:32:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 07:32:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2382 transitions. [2023-08-25 07:32:35,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48493485342019543 [2023-08-25 07:32:35,678 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 2382 transitions. [2023-08-25 07:32:35,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 2382 transitions. [2023-08-25 07:32:35,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:35,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 2382 transitions. [2023-08-25 07:32:35,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 595.5) internal successors, (2382), 4 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:35,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1228.0) internal successors, (6140), 5 states have internal predecessors, (6140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:35,688 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1228.0) internal successors, (6140), 5 states have internal predecessors, (6140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:35,688 INFO L175 Difference]: Start difference. First operand has 148 places, 153 transitions, 400 flow. Second operand 4 states and 2382 transitions. [2023-08-25 07:32:35,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 190 transitions, 750 flow [2023-08-25 07:32:35,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 190 transitions, 733 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-25 07:32:35,693 INFO L231 Difference]: Finished difference. Result has 149 places, 152 transitions, 399 flow [2023-08-25 07:32:35,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=149, PETRI_TRANSITIONS=152} [2023-08-25 07:32:35,694 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -71 predicate places. [2023-08-25 07:32:35,694 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 152 transitions, 399 flow [2023-08-25 07:32:35,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 566.5) internal successors, (2266), 4 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:35,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:35,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:35,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 07:32:35,695 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:35,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:35,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1689950141, now seen corresponding path program 1 times [2023-08-25 07:32:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:35,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144122420] [2023-08-25 07:32:35,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:35,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:35,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:35,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144122420] [2023-08-25 07:32:35,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144122420] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:35,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:35,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 07:32:35,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7659926] [2023-08-25 07:32:35,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:35,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 07:32:35,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:35,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 07:32:35,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-25 07:32:35,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 1228 [2023-08-25 07:32:35,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 152 transitions, 399 flow. Second operand has 4 states, 4 states have (on average 568.0) internal successors, (2272), 4 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:35,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:35,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 1228 [2023-08-25 07:32:35,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:36,519 INFO L124 PetriNetUnfolderBase]: 2453/5414 cut-off events. [2023-08-25 07:32:36,519 INFO L125 PetriNetUnfolderBase]: For 513/521 co-relation queries the response was YES. [2023-08-25 07:32:36,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10492 conditions, 5414 events. 2453/5414 cut-off events. For 513/521 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 36441 event pairs, 1578 based on Foata normal form. 30/5093 useless extension candidates. Maximal degree in co-relation 10482. Up to 3240 conditions per place. [2023-08-25 07:32:36,537 INFO L140 encePairwiseOnDemand]: 1223/1228 looper letters, 124 selfloop transitions, 4 changer transitions 0/181 dead transitions. [2023-08-25 07:32:36,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 181 transitions, 711 flow [2023-08-25 07:32:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 07:32:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 07:32:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2374 transitions. [2023-08-25 07:32:36,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4833061889250814 [2023-08-25 07:32:36,542 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 2374 transitions. [2023-08-25 07:32:36,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 2374 transitions. [2023-08-25 07:32:36,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:36,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 2374 transitions. [2023-08-25 07:32:36,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 593.5) internal successors, (2374), 4 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:36,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1228.0) internal successors, (6140), 5 states have internal predecessors, (6140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:36,552 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1228.0) internal successors, (6140), 5 states have internal predecessors, (6140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:36,553 INFO L175 Difference]: Start difference. First operand has 149 places, 152 transitions, 399 flow. Second operand 4 states and 2374 transitions. [2023-08-25 07:32:36,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 181 transitions, 711 flow [2023-08-25 07:32:36,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 181 transitions, 700 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-25 07:32:36,557 INFO L231 Difference]: Finished difference. Result has 152 places, 149 transitions, 386 flow [2023-08-25 07:32:36,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=386, PETRI_PLACES=152, PETRI_TRANSITIONS=149} [2023-08-25 07:32:36,558 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -68 predicate places. [2023-08-25 07:32:36,558 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 149 transitions, 386 flow [2023-08-25 07:32:36,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 568.0) internal successors, (2272), 4 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:36,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:36,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:36,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 07:32:36,559 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:36,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:36,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1297942636, now seen corresponding path program 1 times [2023-08-25 07:32:36,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:36,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21210982] [2023-08-25 07:32:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:36,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:36,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21210982] [2023-08-25 07:32:36,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21210982] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:36,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:36,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 07:32:36,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072434608] [2023-08-25 07:32:36,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:36,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-25 07:32:36,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:36,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-25 07:32:36,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-25 07:32:36,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 07:32:36,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 149 transitions, 386 flow. Second operand has 7 states, 7 states have (on average 562.7142857142857) internal successors, (3939), 7 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:36,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:36,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 07:32:36,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:38,807 INFO L124 PetriNetUnfolderBase]: 5703/11837 cut-off events. [2023-08-25 07:32:38,807 INFO L125 PetriNetUnfolderBase]: For 1165/1200 co-relation queries the response was YES. [2023-08-25 07:32:38,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22736 conditions, 11837 events. 5703/11837 cut-off events. For 1165/1200 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 85975 event pairs, 2061 based on Foata normal form. 43/11090 useless extension candidates. Maximal degree in co-relation 22725. Up to 2944 conditions per place. [2023-08-25 07:32:38,854 INFO L140 encePairwiseOnDemand]: 1219/1228 looper letters, 382 selfloop transitions, 25 changer transitions 2/461 dead transitions. [2023-08-25 07:32:38,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 461 transitions, 1956 flow [2023-08-25 07:32:38,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-25 07:32:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-25 07:32:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7116 transitions. [2023-08-25 07:32:38,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828990228013029 [2023-08-25 07:32:38,862 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 7116 transitions. [2023-08-25 07:32:38,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 7116 transitions. [2023-08-25 07:32:38,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:38,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 7116 transitions. [2023-08-25 07:32:38,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 593.0) internal successors, (7116), 12 states have internal predecessors, (7116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:38,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 1228.0) internal successors, (15964), 13 states have internal predecessors, (15964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:38,893 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 1228.0) internal successors, (15964), 13 states have internal predecessors, (15964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:38,893 INFO L175 Difference]: Start difference. First operand has 152 places, 149 transitions, 386 flow. Second operand 12 states and 7116 transitions. [2023-08-25 07:32:38,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 461 transitions, 1956 flow [2023-08-25 07:32:38,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 461 transitions, 1934 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-25 07:32:38,902 INFO L231 Difference]: Finished difference. Result has 166 places, 169 transitions, 549 flow [2023-08-25 07:32:38,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=549, PETRI_PLACES=166, PETRI_TRANSITIONS=169} [2023-08-25 07:32:38,902 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -54 predicate places. [2023-08-25 07:32:38,902 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 169 transitions, 549 flow [2023-08-25 07:32:38,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 562.7142857142857) internal successors, (3939), 7 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:38,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:38,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:38,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-25 07:32:38,904 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:38,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1703953979, now seen corresponding path program 1 times [2023-08-25 07:32:38,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:38,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855181107] [2023-08-25 07:32:38,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:38,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:39,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:39,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855181107] [2023-08-25 07:32:39,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855181107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:39,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:39,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:32:39,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875540048] [2023-08-25 07:32:39,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:39,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 07:32:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 07:32:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-25 07:32:39,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 07:32:39,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 169 transitions, 549 flow. Second operand has 5 states, 5 states have (on average 565.0) internal successors, (2825), 5 states have internal predecessors, (2825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:39,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:39,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 07:32:39,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:40,973 INFO L124 PetriNetUnfolderBase]: 5710/12232 cut-off events. [2023-08-25 07:32:40,973 INFO L125 PetriNetUnfolderBase]: For 8458/8499 co-relation queries the response was YES. [2023-08-25 07:32:41,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26549 conditions, 12232 events. 5710/12232 cut-off events. For 8458/8499 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 91150 event pairs, 3358 based on Foata normal form. 14/11816 useless extension candidates. Maximal degree in co-relation 26532. Up to 4886 conditions per place. [2023-08-25 07:32:41,038 INFO L140 encePairwiseOnDemand]: 1222/1228 looper letters, 274 selfloop transitions, 15 changer transitions 3/344 dead transitions. [2023-08-25 07:32:41,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 344 transitions, 1603 flow [2023-08-25 07:32:41,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 07:32:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 07:32:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3053 transitions. [2023-08-25 07:32:41,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49723127035830617 [2023-08-25 07:32:41,043 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3053 transitions. [2023-08-25 07:32:41,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3053 transitions. [2023-08-25 07:32:41,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:41,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3053 transitions. [2023-08-25 07:32:41,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 610.6) internal successors, (3053), 5 states have internal predecessors, (3053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:41,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1228.0) internal successors, (7368), 6 states have internal predecessors, (7368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:41,055 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1228.0) internal successors, (7368), 6 states have internal predecessors, (7368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:41,055 INFO L175 Difference]: Start difference. First operand has 166 places, 169 transitions, 549 flow. Second operand 5 states and 3053 transitions. [2023-08-25 07:32:41,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 344 transitions, 1603 flow [2023-08-25 07:32:41,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 344 transitions, 1587 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 07:32:41,098 INFO L231 Difference]: Finished difference. Result has 170 places, 171 transitions, 604 flow [2023-08-25 07:32:41,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=604, PETRI_PLACES=170, PETRI_TRANSITIONS=171} [2023-08-25 07:32:41,098 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -50 predicate places. [2023-08-25 07:32:41,099 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 171 transitions, 604 flow [2023-08-25 07:32:41,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 565.0) internal successors, (2825), 5 states have internal predecessors, (2825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:41,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:41,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:41,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-25 07:32:41,100 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:41,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1809565797, now seen corresponding path program 2 times [2023-08-25 07:32:41,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:41,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88153080] [2023-08-25 07:32:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:41,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88153080] [2023-08-25 07:32:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88153080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:41,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:41,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:32:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362651364] [2023-08-25 07:32:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:41,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 07:32:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:41,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 07:32:41,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 07:32:41,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 07:32:41,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 171 transitions, 604 flow. Second operand has 5 states, 5 states have (on average 565.0) internal successors, (2825), 5 states have internal predecessors, (2825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:41,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:41,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 07:32:41,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:42,865 INFO L124 PetriNetUnfolderBase]: 6110/13037 cut-off events. [2023-08-25 07:32:42,865 INFO L125 PetriNetUnfolderBase]: For 12154/12257 co-relation queries the response was YES. [2023-08-25 07:32:42,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29600 conditions, 13037 events. 6110/13037 cut-off events. For 12154/12257 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 97203 event pairs, 3584 based on Foata normal form. 30/12611 useless extension candidates. Maximal degree in co-relation 29580. Up to 4918 conditions per place. [2023-08-25 07:32:42,933 INFO L140 encePairwiseOnDemand]: 1221/1228 looper letters, 225 selfloop transitions, 19 changer transitions 1/297 dead transitions. [2023-08-25 07:32:42,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 297 transitions, 1458 flow [2023-08-25 07:32:42,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 07:32:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 07:32:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3007 transitions. [2023-08-25 07:32:42,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897394136807818 [2023-08-25 07:32:42,937 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3007 transitions. [2023-08-25 07:32:42,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3007 transitions. [2023-08-25 07:32:42,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:42,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3007 transitions. [2023-08-25 07:32:42,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 601.4) internal successors, (3007), 5 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:42,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1228.0) internal successors, (7368), 6 states have internal predecessors, (7368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:42,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1228.0) internal successors, (7368), 6 states have internal predecessors, (7368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:42,945 INFO L175 Difference]: Start difference. First operand has 170 places, 171 transitions, 604 flow. Second operand 5 states and 3007 transitions. [2023-08-25 07:32:42,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 297 transitions, 1458 flow [2023-08-25 07:32:42,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 297 transitions, 1446 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:32:42,994 INFO L231 Difference]: Finished difference. Result has 175 places, 177 transitions, 701 flow [2023-08-25 07:32:42,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=701, PETRI_PLACES=175, PETRI_TRANSITIONS=177} [2023-08-25 07:32:42,995 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -45 predicate places. [2023-08-25 07:32:42,995 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 177 transitions, 701 flow [2023-08-25 07:32:42,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 565.0) internal successors, (2825), 5 states have internal predecessors, (2825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:42,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:42,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:42,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-25 07:32:42,996 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:42,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:42,996 INFO L85 PathProgramCache]: Analyzing trace with hash -573154303, now seen corresponding path program 3 times [2023-08-25 07:32:42,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:42,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734488362] [2023-08-25 07:32:42,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:42,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:43,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:43,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734488362] [2023-08-25 07:32:43,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734488362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:43,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:43,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 07:32:43,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362396640] [2023-08-25 07:32:43,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:43,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:32:43,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:43,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:32:43,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:32:43,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 1228 [2023-08-25 07:32:43,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 177 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 566.8333333333334) internal successors, (3401), 6 states have internal predecessors, (3401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:43,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:43,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 1228 [2023-08-25 07:32:43,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:44,468 INFO L124 PetriNetUnfolderBase]: 5688/12199 cut-off events. [2023-08-25 07:32:44,468 INFO L125 PetriNetUnfolderBase]: For 11451/11565 co-relation queries the response was YES. [2023-08-25 07:32:44,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27882 conditions, 12199 events. 5688/12199 cut-off events. For 11451/11565 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 90516 event pairs, 2845 based on Foata normal form. 44/11824 useless extension candidates. Maximal degree in co-relation 27860. Up to 5653 conditions per place. [2023-08-25 07:32:44,539 INFO L140 encePairwiseOnDemand]: 1219/1228 looper letters, 165 selfloop transitions, 20 changer transitions 0/242 dead transitions. [2023-08-25 07:32:44,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 242 transitions, 1323 flow [2023-08-25 07:32:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:32:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:32:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3528 transitions. [2023-08-25 07:32:44,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4788273615635179 [2023-08-25 07:32:44,545 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3528 transitions. [2023-08-25 07:32:44,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3528 transitions. [2023-08-25 07:32:44,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:44,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3528 transitions. [2023-08-25 07:32:44,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 588.0) internal successors, (3528), 6 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:44,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:44,555 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:44,555 INFO L175 Difference]: Start difference. First operand has 175 places, 177 transitions, 701 flow. Second operand 6 states and 3528 transitions. [2023-08-25 07:32:44,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 242 transitions, 1323 flow [2023-08-25 07:32:44,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 242 transitions, 1307 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 07:32:44,599 INFO L231 Difference]: Finished difference. Result has 181 places, 179 transitions, 754 flow [2023-08-25 07:32:44,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=754, PETRI_PLACES=181, PETRI_TRANSITIONS=179} [2023-08-25 07:32:44,602 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -39 predicate places. [2023-08-25 07:32:44,602 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 179 transitions, 754 flow [2023-08-25 07:32:44,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 566.8333333333334) internal successors, (3401), 6 states have internal predecessors, (3401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:44,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:44,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:44,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 07:32:44,603 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:44,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:44,604 INFO L85 PathProgramCache]: Analyzing trace with hash 664924409, now seen corresponding path program 1 times [2023-08-25 07:32:44,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:44,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130931853] [2023-08-25 07:32:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:44,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:44,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:44,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130931853] [2023-08-25 07:32:44,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130931853] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:44,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:44,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 07:32:44,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239624269] [2023-08-25 07:32:44,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:44,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:32:44,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:44,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:32:44,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:32:44,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 07:32:44,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 179 transitions, 754 flow. Second operand has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:44,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:44,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 07:32:44,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:47,071 INFO L124 PetriNetUnfolderBase]: 6637/13990 cut-off events. [2023-08-25 07:32:47,071 INFO L125 PetriNetUnfolderBase]: For 14965/15099 co-relation queries the response was YES. [2023-08-25 07:32:47,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32584 conditions, 13990 events. 6637/13990 cut-off events. For 14965/15099 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 104743 event pairs, 3596 based on Foata normal form. 71/13638 useless extension candidates. Maximal degree in co-relation 32561. Up to 4938 conditions per place. [2023-08-25 07:32:47,199 INFO L140 encePairwiseOnDemand]: 1221/1228 looper letters, 256 selfloop transitions, 21 changer transitions 0/329 dead transitions. [2023-08-25 07:32:47,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 329 transitions, 1727 flow [2023-08-25 07:32:47,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:32:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:32:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3593 transitions. [2023-08-25 07:32:47,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48764929424538545 [2023-08-25 07:32:47,207 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3593 transitions. [2023-08-25 07:32:47,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3593 transitions. [2023-08-25 07:32:47,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:47,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3593 transitions. [2023-08-25 07:32:47,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 598.8333333333334) internal successors, (3593), 6 states have internal predecessors, (3593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:47,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:47,218 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:47,218 INFO L175 Difference]: Start difference. First operand has 181 places, 179 transitions, 754 flow. Second operand 6 states and 3593 transitions. [2023-08-25 07:32:47,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 329 transitions, 1727 flow [2023-08-25 07:32:47,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 329 transitions, 1691 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 07:32:47,287 INFO L231 Difference]: Finished difference. Result has 184 places, 182 transitions, 808 flow [2023-08-25 07:32:47,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=808, PETRI_PLACES=184, PETRI_TRANSITIONS=182} [2023-08-25 07:32:47,288 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -36 predicate places. [2023-08-25 07:32:47,289 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 182 transitions, 808 flow [2023-08-25 07:32:47,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:47,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:47,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:47,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-25 07:32:47,290 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:47,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:47,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1440772431, now seen corresponding path program 2 times [2023-08-25 07:32:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:47,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279128536] [2023-08-25 07:32:47,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:47,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:47,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279128536] [2023-08-25 07:32:47,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279128536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:47,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:47,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:32:47,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771936036] [2023-08-25 07:32:47,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:47,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 07:32:47,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:47,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 07:32:47,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-25 07:32:47,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 07:32:47,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 182 transitions, 808 flow. Second operand has 5 states, 5 states have (on average 566.0) internal successors, (2830), 5 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:47,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:47,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 07:32:47,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:49,333 INFO L124 PetriNetUnfolderBase]: 6373/13353 cut-off events. [2023-08-25 07:32:49,333 INFO L125 PetriNetUnfolderBase]: For 16138/16234 co-relation queries the response was YES. [2023-08-25 07:32:49,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31762 conditions, 13353 events. 6373/13353 cut-off events. For 16138/16234 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 98473 event pairs, 4344 based on Foata normal form. 44/12963 useless extension candidates. Maximal degree in co-relation 31736. Up to 8635 conditions per place. [2023-08-25 07:32:49,391 INFO L140 encePairwiseOnDemand]: 1221/1228 looper letters, 165 selfloop transitions, 17 changer transitions 1/235 dead transitions. [2023-08-25 07:32:49,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 235 transitions, 1315 flow [2023-08-25 07:32:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 07:32:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 07:32:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2949 transitions. [2023-08-25 07:32:49,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4802931596091205 [2023-08-25 07:32:49,396 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2949 transitions. [2023-08-25 07:32:49,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2949 transitions. [2023-08-25 07:32:49,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:49,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2949 transitions. [2023-08-25 07:32:49,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 589.8) internal successors, (2949), 5 states have internal predecessors, (2949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:49,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1228.0) internal successors, (7368), 6 states have internal predecessors, (7368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:49,404 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1228.0) internal successors, (7368), 6 states have internal predecessors, (7368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:49,404 INFO L175 Difference]: Start difference. First operand has 184 places, 182 transitions, 808 flow. Second operand 5 states and 2949 transitions. [2023-08-25 07:32:49,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 235 transitions, 1315 flow [2023-08-25 07:32:49,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 235 transitions, 1283 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 07:32:49,439 INFO L231 Difference]: Finished difference. Result has 186 places, 181 transitions, 798 flow [2023-08-25 07:32:49,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=798, PETRI_PLACES=186, PETRI_TRANSITIONS=181} [2023-08-25 07:32:49,440 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -34 predicate places. [2023-08-25 07:32:49,440 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 181 transitions, 798 flow [2023-08-25 07:32:49,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 566.0) internal successors, (2830), 5 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:49,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:49,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:49,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-25 07:32:49,441 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:49,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash -547913123, now seen corresponding path program 3 times [2023-08-25 07:32:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:49,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427089559] [2023-08-25 07:32:49,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:49,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:49,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:49,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427089559] [2023-08-25 07:32:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427089559] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:49,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:49,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 07:32:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437979672] [2023-08-25 07:32:49,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:49,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:32:49,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:49,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:32:49,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:32:49,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 07:32:49,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 181 transitions, 798 flow. Second operand has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:49,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:49,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 07:32:49,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:51,143 INFO L124 PetriNetUnfolderBase]: 6983/14594 cut-off events. [2023-08-25 07:32:51,143 INFO L125 PetriNetUnfolderBase]: For 16287/16361 co-relation queries the response was YES. [2023-08-25 07:32:51,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34199 conditions, 14594 events. 6983/14594 cut-off events. For 16287/16361 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 109525 event pairs, 4286 based on Foata normal form. 59/14171 useless extension candidates. Maximal degree in co-relation 34173. Up to 8607 conditions per place. [2023-08-25 07:32:51,208 INFO L140 encePairwiseOnDemand]: 1221/1228 looper letters, 202 selfloop transitions, 21 changer transitions 0/275 dead transitions. [2023-08-25 07:32:51,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 275 transitions, 1526 flow [2023-08-25 07:32:51,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:32:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:32:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3545 transitions. [2023-08-25 07:32:51,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811346362649294 [2023-08-25 07:32:51,214 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3545 transitions. [2023-08-25 07:32:51,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3545 transitions. [2023-08-25 07:32:51,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:51,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3545 transitions. [2023-08-25 07:32:51,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 590.8333333333334) internal successors, (3545), 6 states have internal predecessors, (3545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:51,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:51,223 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:51,224 INFO L175 Difference]: Start difference. First operand has 186 places, 181 transitions, 798 flow. Second operand 6 states and 3545 transitions. [2023-08-25 07:32:51,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 275 transitions, 1526 flow [2023-08-25 07:32:51,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 275 transitions, 1469 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-25 07:32:51,272 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 831 flow [2023-08-25 07:32:51,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=831, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2023-08-25 07:32:51,272 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -34 predicate places. [2023-08-25 07:32:51,272 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 831 flow [2023-08-25 07:32:51,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:51,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:51,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:51,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-25 07:32:51,273 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:51,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:51,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1225315153, now seen corresponding path program 4 times [2023-08-25 07:32:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:51,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223981007] [2023-08-25 07:32:51,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:51,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223981007] [2023-08-25 07:32:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223981007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:51,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 07:32:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329605167] [2023-08-25 07:32:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:51,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:32:51,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:51,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:32:51,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:32:51,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 07:32:51,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 831 flow. Second operand has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:51,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:51,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 07:32:51,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:53,257 INFO L124 PetriNetUnfolderBase]: 7418/15528 cut-off events. [2023-08-25 07:32:53,257 INFO L125 PetriNetUnfolderBase]: For 17653/17729 co-relation queries the response was YES. [2023-08-25 07:32:53,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36193 conditions, 15528 events. 7418/15528 cut-off events. For 17653/17729 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 118352 event pairs, 4690 based on Foata normal form. 64/15064 useless extension candidates. Maximal degree in co-relation 36169. Up to 9421 conditions per place. [2023-08-25 07:32:53,348 INFO L140 encePairwiseOnDemand]: 1221/1228 looper letters, 191 selfloop transitions, 20 changer transitions 0/263 dead transitions. [2023-08-25 07:32:53,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 263 transitions, 1495 flow [2023-08-25 07:32:53,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:32:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:32:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3529 transitions. [2023-08-25 07:32:53,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789630836047774 [2023-08-25 07:32:53,353 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3529 transitions. [2023-08-25 07:32:53,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3529 transitions. [2023-08-25 07:32:53,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:53,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3529 transitions. [2023-08-25 07:32:53,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 588.1666666666666) internal successors, (3529), 6 states have internal predecessors, (3529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:53,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:53,362 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1228.0) internal successors, (8596), 7 states have internal predecessors, (8596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:53,362 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 831 flow. Second operand 6 states and 3529 transitions. [2023-08-25 07:32:53,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 263 transitions, 1495 flow [2023-08-25 07:32:53,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 263 transitions, 1458 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-25 07:32:53,410 INFO L231 Difference]: Finished difference. Result has 189 places, 187 transitions, 864 flow [2023-08-25 07:32:53,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=189, PETRI_TRANSITIONS=187} [2023-08-25 07:32:53,410 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -31 predicate places. [2023-08-25 07:32:53,411 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 187 transitions, 864 flow [2023-08-25 07:32:53,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:53,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:53,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:53,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-25 07:32:53,411 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:53,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash -73785211, now seen corresponding path program 5 times [2023-08-25 07:32:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444157606] [2023-08-25 07:32:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:53,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:53,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444157606] [2023-08-25 07:32:53,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444157606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:53,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:32:53,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 07:32:53,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710796444] [2023-08-25 07:32:53,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:53,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:32:53,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:53,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:32:53,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:32:53,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 07:32:53,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 187 transitions, 864 flow. Second operand has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:53,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:53,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 07:32:53,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:55,527 INFO L124 PetriNetUnfolderBase]: 7381/15465 cut-off events. [2023-08-25 07:32:55,527 INFO L125 PetriNetUnfolderBase]: For 18058/18152 co-relation queries the response was YES. [2023-08-25 07:32:55,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35918 conditions, 15465 events. 7381/15465 cut-off events. For 18058/18152 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 117752 event pairs, 3225 based on Foata normal form. 62/15027 useless extension candidates. Maximal degree in co-relation 35894. Up to 5945 conditions per place. [2023-08-25 07:32:55,645 INFO L140 encePairwiseOnDemand]: 1221/1228 looper letters, 219 selfloop transitions, 24 changer transitions 0/295 dead transitions. [2023-08-25 07:32:55,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 295 transitions, 1647 flow [2023-08-25 07:32:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 07:32:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 07:32:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4125 transitions. [2023-08-25 07:32:55,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798743601675198 [2023-08-25 07:32:55,653 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 4125 transitions. [2023-08-25 07:32:55,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 4125 transitions. [2023-08-25 07:32:55,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:55,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 4125 transitions. [2023-08-25 07:32:55,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 589.2857142857143) internal successors, (4125), 7 states have internal predecessors, (4125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:55,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 1228.0) internal successors, (9824), 8 states have internal predecessors, (9824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:55,664 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 1228.0) internal successors, (9824), 8 states have internal predecessors, (9824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:55,664 INFO L175 Difference]: Start difference. First operand has 189 places, 187 transitions, 864 flow. Second operand 7 states and 4125 transitions. [2023-08-25 07:32:55,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 295 transitions, 1647 flow [2023-08-25 07:32:55,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 295 transitions, 1597 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-25 07:32:55,719 INFO L231 Difference]: Finished difference. Result has 190 places, 186 transitions, 843 flow [2023-08-25 07:32:55,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=843, PETRI_PLACES=190, PETRI_TRANSITIONS=186} [2023-08-25 07:32:55,719 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -30 predicate places. [2023-08-25 07:32:55,719 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 186 transitions, 843 flow [2023-08-25 07:32:55,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 564.8333333333334) internal successors, (3389), 6 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:55,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:55,720 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:55,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-25 07:32:55,721 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:55,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:55,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1571069376, now seen corresponding path program 1 times [2023-08-25 07:32:55,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:55,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183111188] [2023-08-25 07:32:55,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:55,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:56,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:56,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183111188] [2023-08-25 07:32:56,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183111188] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:32:56,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386149541] [2023-08-25 07:32:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:56,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:32:56,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:32:56,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:32:56,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 07:32:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:56,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 07:32:56,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:32:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 07:32:56,282 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 07:32:56,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386149541] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:32:56,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 07:32:56,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-08-25 07:32:56,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240788509] [2023-08-25 07:32:56,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:32:56,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:32:56,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:32:56,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:32:56,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-25 07:32:56,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 07:32:56,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 186 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 572.0) internal successors, (1716), 3 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:56,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:32:56,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 07:32:56,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:32:57,921 INFO L124 PetriNetUnfolderBase]: 7111/15277 cut-off events. [2023-08-25 07:32:57,921 INFO L125 PetriNetUnfolderBase]: For 15733/15788 co-relation queries the response was YES. [2023-08-25 07:32:57,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34704 conditions, 15277 events. 7111/15277 cut-off events. For 15733/15788 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 118391 event pairs, 5827 based on Foata normal form. 256/14989 useless extension candidates. Maximal degree in co-relation 34681. Up to 11594 conditions per place. [2023-08-25 07:32:58,025 INFO L140 encePairwiseOnDemand]: 1224/1228 looper letters, 127 selfloop transitions, 3 changer transitions 16/206 dead transitions. [2023-08-25 07:32:58,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 206 transitions, 1285 flow [2023-08-25 07:32:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:32:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:32:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1776 transitions. [2023-08-25 07:32:58,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820846905537459 [2023-08-25 07:32:58,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1776 transitions. [2023-08-25 07:32:58,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1776 transitions. [2023-08-25 07:32:58,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:32:58,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1776 transitions. [2023-08-25 07:32:58,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:58,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:58,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1228.0) internal successors, (4912), 4 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:58,033 INFO L175 Difference]: Start difference. First operand has 190 places, 186 transitions, 843 flow. Second operand 3 states and 1776 transitions. [2023-08-25 07:32:58,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 206 transitions, 1285 flow [2023-08-25 07:32:58,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 206 transitions, 1195 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-25 07:32:58,070 INFO L231 Difference]: Finished difference. Result has 186 places, 186 transitions, 786 flow [2023-08-25 07:32:58,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=186, PETRI_TRANSITIONS=186} [2023-08-25 07:32:58,070 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, -34 predicate places. [2023-08-25 07:32:58,071 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 186 transitions, 786 flow [2023-08-25 07:32:58,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 572.0) internal successors, (1716), 3 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:32:58,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:32:58,071 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:32:58,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-25 07:32:58,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-25 07:32:58,273 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:32:58,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:32:58,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1635720040, now seen corresponding path program 1 times [2023-08-25 07:32:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:32:58,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658960462] [2023-08-25 07:32:58,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:58,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:32:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:32:58,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:32:58,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658960462] [2023-08-25 07:32:58,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658960462] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:32:58,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648099006] [2023-08-25 07:32:58,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:32:58,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:32:58,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:32:58,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:32:58,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 07:32:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:32:59,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-25 07:32:59,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:32:59,546 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 07:32:59,549 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:32:59,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 10 [2023-08-25 07:32:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:32:59,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:33:00,087 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 07:33:00,087 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2023-08-25 07:33:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:33:00,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648099006] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 07:33:00,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 07:33:00,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2023-08-25 07:33:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338409080] [2023-08-25 07:33:00,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 07:33:00,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-25 07:33:00,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:33:00,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-25 07:33:00,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2023-08-25 07:33:00,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 1228 [2023-08-25 07:33:00,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 186 transitions, 786 flow. Second operand has 26 states, 26 states have (on average 392.5) internal successors, (10205), 26 states have internal predecessors, (10205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:33:00,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:33:00,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 1228 [2023-08-25 07:33:00,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:33:16,764 INFO L124 PetriNetUnfolderBase]: 48436/86172 cut-off events. [2023-08-25 07:33:16,764 INFO L125 PetriNetUnfolderBase]: For 67354/67488 co-relation queries the response was YES. [2023-08-25 07:33:17,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205368 conditions, 86172 events. 48436/86172 cut-off events. For 67354/67488 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 709188 event pairs, 6152 based on Foata normal form. 107/85471 useless extension candidates. Maximal degree in co-relation 205345. Up to 15744 conditions per place. [2023-08-25 07:33:17,290 INFO L140 encePairwiseOnDemand]: 1187/1228 looper letters, 1733 selfloop transitions, 228 changer transitions 145/2126 dead transitions. [2023-08-25 07:33:17,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 2126 transitions, 11200 flow [2023-08-25 07:33:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-08-25 07:33:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2023-08-25 07:33:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 27043 transitions. [2023-08-25 07:33:17,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387997995489852 [2023-08-25 07:33:17,313 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 27043 transitions. [2023-08-25 07:33:17,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 27043 transitions. [2023-08-25 07:33:17,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:33:17,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 27043 transitions. [2023-08-25 07:33:17,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 416.04615384615386) internal successors, (27043), 65 states have internal predecessors, (27043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:33:17,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 1228.0) internal successors, (81048), 66 states have internal predecessors, (81048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:33:17,396 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 1228.0) internal successors, (81048), 66 states have internal predecessors, (81048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:33:17,397 INFO L175 Difference]: Start difference. First operand has 186 places, 186 transitions, 786 flow. Second operand 65 states and 27043 transitions. [2023-08-25 07:33:17,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 2126 transitions, 11200 flow [2023-08-25 07:33:17,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 2126 transitions, 11173 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:33:17,981 INFO L231 Difference]: Finished difference. Result has 294 places, 389 transitions, 3130 flow [2023-08-25 07:33:17,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=3130, PETRI_PLACES=294, PETRI_TRANSITIONS=389} [2023-08-25 07:33:17,982 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, 74 predicate places. [2023-08-25 07:33:17,982 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 389 transitions, 3130 flow [2023-08-25 07:33:17,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 392.5) internal successors, (10205), 26 states have internal predecessors, (10205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:33:17,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:33:17,983 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:33:17,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 07:33:18,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-25 07:33:18,184 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:33:18,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:33:18,184 INFO L85 PathProgramCache]: Analyzing trace with hash -209681590, now seen corresponding path program 2 times [2023-08-25 07:33:18,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:33:18,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031753641] [2023-08-25 07:33:18,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:33:18,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:33:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:33:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:33:19,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:33:19,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031753641] [2023-08-25 07:33:19,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031753641] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:33:19,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:33:19,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 07:33:19,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650560149] [2023-08-25 07:33:19,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:33:19,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-25 07:33:19,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:33:19,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-25 07:33:19,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-25 07:33:19,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 1228 [2023-08-25 07:33:19,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 389 transitions, 3130 flow. Second operand has 8 states, 8 states have (on average 564.625) internal successors, (4517), 8 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:33:19,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:33:19,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 1228 [2023-08-25 07:33:19,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:33:29,434 INFO L124 PetriNetUnfolderBase]: 24279/53911 cut-off events. [2023-08-25 07:33:29,435 INFO L125 PetriNetUnfolderBase]: For 293535/294122 co-relation queries the response was YES. [2023-08-25 07:33:29,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178561 conditions, 53911 events. 24279/53911 cut-off events. For 293535/294122 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 527096 event pairs, 12618 based on Foata normal form. 163/53585 useless extension candidates. Maximal degree in co-relation 178493. Up to 20216 conditions per place. [2023-08-25 07:33:30,117 INFO L140 encePairwiseOnDemand]: 1218/1228 looper letters, 491 selfloop transitions, 109 changer transitions 2/654 dead transitions. [2023-08-25 07:33:30,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 654 transitions, 5929 flow [2023-08-25 07:33:30,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 07:33:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 07:33:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 5324 transitions. [2023-08-25 07:33:30,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48172276511038725 [2023-08-25 07:33:30,121 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 5324 transitions. [2023-08-25 07:33:30,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 5324 transitions. [2023-08-25 07:33:30,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:33:30,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 5324 transitions. [2023-08-25 07:33:30,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 591.5555555555555) internal successors, (5324), 9 states have internal predecessors, (5324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:33:30,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1228.0) internal successors, (12280), 10 states have internal predecessors, (12280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:33:30,131 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1228.0) internal successors, (12280), 10 states have internal predecessors, (12280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:33:30,131 INFO L175 Difference]: Start difference. First operand has 294 places, 389 transitions, 3130 flow. Second operand 9 states and 5324 transitions. [2023-08-25 07:33:30,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 654 transitions, 5929 flow [2023-08-25 07:33:31,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 654 transitions, 5722 flow, removed 89 selfloop flow, removed 2 redundant places. [2023-08-25 07:33:31,869 INFO L231 Difference]: Finished difference. Result has 300 places, 403 transitions, 3383 flow [2023-08-25 07:33:31,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=2976, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3383, PETRI_PLACES=300, PETRI_TRANSITIONS=403} [2023-08-25 07:33:31,870 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, 80 predicate places. [2023-08-25 07:33:31,870 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 403 transitions, 3383 flow [2023-08-25 07:33:31,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 564.625) internal successors, (4517), 8 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:33:31,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:33:31,871 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:33:31,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-25 07:33:31,871 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:33:31,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:33:31,872 INFO L85 PathProgramCache]: Analyzing trace with hash -256421234, now seen corresponding path program 3 times [2023-08-25 07:33:31,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:33:31,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705190444] [2023-08-25 07:33:31,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:33:31,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:33:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:33:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:33:32,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:33:32,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705190444] [2023-08-25 07:33:32,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705190444] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:33:32,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009469693] [2023-08-25 07:33:32,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 07:33:32,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:33:32,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:33:32,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:33:32,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 07:33:32,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-25 07:33:32,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 07:33:32,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-25 07:33:32,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:33:32,833 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 07:33:32,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 10 [2023-08-25 07:33:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:33:32,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:33:33,228 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 07:33:33,229 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2023-08-25 07:33:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:33:33,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009469693] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 07:33:33,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 07:33:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2023-08-25 07:33:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530530433] [2023-08-25 07:33:33,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 07:33:33,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-25 07:33:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:33:33,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-25 07:33:33,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2023-08-25 07:33:33,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 1228 [2023-08-25 07:33:33,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 403 transitions, 3383 flow. Second operand has 25 states, 25 states have (on average 394.56) internal successors, (9864), 25 states have internal predecessors, (9864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:33:33,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:33:33,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 1228 [2023-08-25 07:33:33,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:34:02,617 INFO L124 PetriNetUnfolderBase]: 74885/132186 cut-off events. [2023-08-25 07:34:02,617 INFO L125 PetriNetUnfolderBase]: For 591286/591445 co-relation queries the response was YES. [2023-08-25 07:34:03,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429723 conditions, 132186 events. 74885/132186 cut-off events. For 591286/591445 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 1158856 event pairs, 18422 based on Foata normal form. 478/132405 useless extension candidates. Maximal degree in co-relation 429651. Up to 50075 conditions per place. [2023-08-25 07:34:04,361 INFO L140 encePairwiseOnDemand]: 1187/1228 looper letters, 1862 selfloop transitions, 413 changer transitions 70/2365 dead transitions. [2023-08-25 07:34:04,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 2365 transitions, 17414 flow [2023-08-25 07:34:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-08-25 07:34:04,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2023-08-25 07:34:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 32217 transitions. [2023-08-25 07:34:04,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33635053871210224 [2023-08-25 07:34:04,391 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 32217 transitions. [2023-08-25 07:34:04,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 32217 transitions. [2023-08-25 07:34:04,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:34:04,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 32217 transitions. [2023-08-25 07:34:04,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 413.03846153846155) internal successors, (32217), 78 states have internal predecessors, (32217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:34:04,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 1228.0) internal successors, (97012), 79 states have internal predecessors, (97012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:34:04,501 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 1228.0) internal successors, (97012), 79 states have internal predecessors, (97012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:34:04,501 INFO L175 Difference]: Start difference. First operand has 300 places, 403 transitions, 3383 flow. Second operand 78 states and 32217 transitions. [2023-08-25 07:34:04,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 2365 transitions, 17414 flow [2023-08-25 07:34:09,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 2365 transitions, 17044 flow, removed 71 selfloop flow, removed 3 redundant places. [2023-08-25 07:34:09,684 INFO L231 Difference]: Finished difference. Result has 409 places, 668 transitions, 7824 flow [2023-08-25 07:34:09,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=3257, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=7824, PETRI_PLACES=409, PETRI_TRANSITIONS=668} [2023-08-25 07:34:09,684 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, 189 predicate places. [2023-08-25 07:34:09,685 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 668 transitions, 7824 flow [2023-08-25 07:34:09,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 394.56) internal successors, (9864), 25 states have internal predecessors, (9864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:34:09,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:34:09,686 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:34:09,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-25 07:34:09,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:34:09,889 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:34:09,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:34:09,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1130514234, now seen corresponding path program 4 times [2023-08-25 07:34:09,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:34:09,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003898327] [2023-08-25 07:34:09,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:34:09,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:34:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:34:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:34:10,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:34:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003898327] [2023-08-25 07:34:10,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003898327] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:34:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564572226] [2023-08-25 07:34:10,269 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-25 07:34:10,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:34:10,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:34:10,273 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:34:10,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 07:34:12,407 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-25 07:34:12,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 07:34:12,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-25 07:34:12,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:34:12,765 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 07:34:12,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 10 [2023-08-25 07:34:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:34:12,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:34:13,114 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 07:34:13,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2023-08-25 07:34:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:34:13,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564572226] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 07:34:13,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 07:34:13,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 25 [2023-08-25 07:34:13,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877885508] [2023-08-25 07:34:13,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 07:34:13,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-25 07:34:13,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:34:13,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-25 07:34:13,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2023-08-25 07:34:13,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 1228 [2023-08-25 07:34:13,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 668 transitions, 7824 flow. Second operand has 25 states, 25 states have (on average 394.76) internal successors, (9869), 25 states have internal predecessors, (9869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:34:13,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:34:13,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 1228 [2023-08-25 07:34:13,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:34:56,889 INFO L124 PetriNetUnfolderBase]: 89018/157686 cut-off events. [2023-08-25 07:34:56,889 INFO L125 PetriNetUnfolderBase]: For 1123737/1123927 co-relation queries the response was YES. [2023-08-25 07:35:00,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577773 conditions, 157686 events. 89018/157686 cut-off events. For 1123737/1123927 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 1422739 event pairs, 14964 based on Foata normal form. 587/157898 useless extension candidates. Maximal degree in co-relation 577666. Up to 42603 conditions per place. [2023-08-25 07:35:01,554 INFO L140 encePairwiseOnDemand]: 1190/1228 looper letters, 1727 selfloop transitions, 555 changer transitions 63/2365 dead transitions. [2023-08-25 07:35:01,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 2365 transitions, 21880 flow [2023-08-25 07:35:01,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-08-25 07:35:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-08-25 07:35:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 23896 transitions. [2023-08-25 07:35:01,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34139093662495 [2023-08-25 07:35:01,628 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 23896 transitions. [2023-08-25 07:35:01,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 23896 transitions. [2023-08-25 07:35:01,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:35:01,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 23896 transitions. [2023-08-25 07:35:01,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 419.2280701754386) internal successors, (23896), 57 states have internal predecessors, (23896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:35:01,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 1228.0) internal successors, (71224), 58 states have internal predecessors, (71224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:35:01,796 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 1228.0) internal successors, (71224), 58 states have internal predecessors, (71224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:35:01,796 INFO L175 Difference]: Start difference. First operand has 409 places, 668 transitions, 7824 flow. Second operand 57 states and 23896 transitions. [2023-08-25 07:35:01,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 2365 transitions, 21880 flow [2023-08-25 07:35:24,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 2365 transitions, 19636 flow, removed 889 selfloop flow, removed 29 redundant places. [2023-08-25 07:35:24,100 INFO L231 Difference]: Finished difference. Result has 452 places, 840 transitions, 10147 flow [2023-08-25 07:35:24,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1228, PETRI_DIFFERENCE_MINUEND_FLOW=6603, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=393, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=10147, PETRI_PLACES=452, PETRI_TRANSITIONS=840} [2023-08-25 07:35:24,101 INFO L281 CegarLoopForPetriNet]: 220 programPoint places, 232 predicate places. [2023-08-25 07:35:24,102 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 840 transitions, 10147 flow [2023-08-25 07:35:24,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 394.76) internal successors, (9869), 25 states have internal predecessors, (9869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:35:24,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:35:24,103 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:35:24,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 07:35:24,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-25 07:35:24,308 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 161 more)] === [2023-08-25 07:35:24,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:35:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash 729770896, now seen corresponding path program 5 times [2023-08-25 07:35:24,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:35:24,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710231398] [2023-08-25 07:35:24,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:35:24,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:35:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:35:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:35:24,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:35:24,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710231398] [2023-08-25 07:35:24,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710231398] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:35:24,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928452924] [2023-08-25 07:35:24,702 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-25 07:35:24,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:35:24,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:35:24,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:35:24,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 07:35:24,928 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 07:35:24,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 07:35:24,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 70 conjunts are in the unsatisfiable core [2023-08-25 07:35:24,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:35:24,980 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 07:35:25,019 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 07:35:25,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:35:25,249 INFO L351 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 16 treesize of output 18 [2023-08-25 07:35:26,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 07:35:26,301 INFO L322 Elim1Store]: treesize reduction 38, result has 20.8 percent of original size [2023-08-25 07:35:26,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 30 [2023-08-25 07:35:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:35:26,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:35:27,388 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1524 (Array Int Int)) (v_~x2~0_581 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset)))) (or (<= c_~size~0 .cse0) (< v_~x2~0_581 (select .cse1 (+ c_~f~0.offset (* .cse0 4)))) (= (select .cse1 (+ (* v_~x2~0_581 4) c_~f~0.offset)) |c_thread1Thread1of1ForFork1_#t~mem2#1|) (< .cse0 0) (<= c_~size~0 v_~x2~0_581))))) is different from false [2023-08-25 07:35:27,465 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1524 (Array Int Int)) (v_~x2~0_581 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset)))) (or (<= c_~size~0 .cse0) (< v_~x2~0_581 (select .cse1 (+ c_~f~0.offset (* .cse0 4)))) (= (select .cse1 (+ (* v_~x2~0_581 4) c_~f~0.offset)) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset))) (< .cse0 0) (<= c_~size~0 v_~x2~0_581))))) is different from false [2023-08-25 07:35:27,927 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:35:27,927 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 106 [2023-08-25 07:35:27,966 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:35:27,966 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 429 treesize of output 417 [2023-08-25 07:35:28,008 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:35:28,009 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 247 [2023-08-25 07:35:28,071 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:35:28,072 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 149 [2023-08-25 07:35:33,065 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-25 07:35:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:35:33,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928452924] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 07:35:33,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 07:35:33,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 19] total 47 [2023-08-25 07:35:33,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571997071] [2023-08-25 07:35:33,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 07:35:33,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-08-25 07:35:33,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:35:33,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-08-25 07:35:33,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1790, Unknown=5, NotChecked=174, Total=2162 [2023-08-25 07:35:33,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 1228 [2023-08-25 07:35:33,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 840 transitions, 10147 flow. Second operand has 47 states, 47 states have (on average 369.27659574468083) internal successors, (17356), 47 states have internal predecessors, (17356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:35:33,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:35:33,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 1228 [2023-08-25 07:35:33,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:35:50,764 WARN L234 SmtUtils]: Spent 12.49s on a formula simplification. DAG size of input: 78 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:36:02,591 WARN L234 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 103 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:36:04,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:36:06,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:36:09,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:36:11,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:36:13,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:36:28,336 WARN L234 SmtUtils]: Spent 12.73s on a formula simplification. DAG size of input: 106 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:36:45,143 WARN L234 SmtUtils]: Spent 10.21s on a formula simplification. DAG size of input: 107 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:36:48,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:36:50,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:36:52,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:36:54,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:36:56,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:36:58,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:37:12,451 WARN L234 SmtUtils]: Spent 12.41s on a formula simplification. DAG size of input: 89 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:37:14,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:37:22,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:37:24,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:37:39,946 WARN L234 SmtUtils]: Spent 14.43s on a formula simplification. DAG size of input: 114 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:37:56,613 WARN L234 SmtUtils]: Spent 16.17s on a formula simplification. DAG size of input: 117 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:37:59,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:38:01,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:38:03,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:05,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:07,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:10,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:13,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:15,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:17,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:19,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:21,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:23,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:25,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:27,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:30,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:32,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:34,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:38:47,142 WARN L234 SmtUtils]: Spent 10.57s on a formula simplification. DAG size of input: 71 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:38:49,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:38:51,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:00,071 WARN L234 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 121 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:39:16,785 WARN L234 SmtUtils]: Spent 14.09s on a formula simplification. DAG size of input: 100 DAG size of output: 94 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:39:20,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:22,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:24,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:26,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:28,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:31,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:32,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:34,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:44,888 WARN L234 SmtUtils]: Spent 9.51s on a formula simplification. DAG size of input: 118 DAG size of output: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:39:47,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:49,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:51,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:53,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:55,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:57,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:39:59,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:01,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:15,321 WARN L234 SmtUtils]: Spent 13.29s on a formula simplification. DAG size of input: 99 DAG size of output: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:40:17,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:19,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:21,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:23,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:25,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:28,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:31,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:33,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:35,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:37,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:39,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:41,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:43,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:46,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:48,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:40:52,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:05,517 WARN L234 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 99 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:41:08,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:12,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:41:14,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:41:16,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:18,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:20,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:23,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:25,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:27,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:29,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:31,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:33,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:35,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:37,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:39,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:42,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:44,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:46,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:51,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:41:54,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:57,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:41:59,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:42:01,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:42:21,756 WARN L234 SmtUtils]: Spent 14.83s on a formula simplification. DAG size of input: 82 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:42:27,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:42:49,519 WARN L234 SmtUtils]: Spent 21.52s on a formula simplification. DAG size of input: 111 DAG size of output: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:42:56,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:42:58,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:02,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:04,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:06,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:09,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:11,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:13,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:15,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:17,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:19,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:21,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:23,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:25,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:27,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:29,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:31,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:32,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:34,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:36,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:38,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:41,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:43,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:45,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:43:47,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:05,279 WARN L234 SmtUtils]: Spent 17.90s on a formula simplification. DAG size of input: 110 DAG size of output: 101 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:44:07,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:18,627 WARN L234 SmtUtils]: Spent 10.74s on a formula simplification. DAG size of input: 113 DAG size of output: 94 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:44:20,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:25,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:27,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:29,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:31,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:33,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:35,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:37,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:39,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:41,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:43,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:45,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:47,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:49,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:51,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:53,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:55,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:57,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:44:59,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:45:01,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:45:03,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:45:05,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:45:07,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:45:09,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:45:11,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:45:13,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Received shutdown request... [2023-08-25 07:45:14,858 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-08-25 07:45:14,858 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 07:45:15,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:45:15,871 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-08-25 07:45:16,059 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-25 07:45:16,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-25 07:45:16,085 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONASSERT (164 of 165 remaining) [2023-08-25 07:45:16,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-25 07:45:16,086 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-25 07:45:16,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (163 of 165 remaining) [2023-08-25 07:45:16,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (162 of 165 remaining) [2023-08-25 07:45:16,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (161 of 165 remaining) [2023-08-25 07:45:16,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (160 of 165 remaining) [2023-08-25 07:45:16,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (159 of 165 remaining) [2023-08-25 07:45:16,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (158 of 165 remaining) [2023-08-25 07:45:16,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (157 of 165 remaining) [2023-08-25 07:45:16,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (156 of 165 remaining) [2023-08-25 07:45:16,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (155 of 165 remaining) [2023-08-25 07:45:16,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err36ASSERT_VIOLATIONDATA_RACE (154 of 165 remaining) [2023-08-25 07:45:16,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (153 of 165 remaining) [2023-08-25 07:45:16,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err37ASSERT_VIOLATIONDATA_RACE (152 of 165 remaining) [2023-08-25 07:45:16,088 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err44ASSERT_VIOLATIONDATA_RACE (151 of 165 remaining) [2023-08-25 07:45:16,088 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (150 of 165 remaining) [2023-08-25 07:45:16,088 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err45ASSERT_VIOLATIONDATA_RACE (149 of 165 remaining) [2023-08-25 07:45:16,088 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err52ASSERT_VIOLATIONDATA_RACE (148 of 165 remaining) [2023-08-25 07:45:16,088 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err38ASSERT_VIOLATIONDATA_RACE (147 of 165 remaining) [2023-08-25 07:45:16,088 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (146 of 165 remaining) [2023-08-25 07:45:16,088 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err39ASSERT_VIOLATIONDATA_RACE (145 of 165 remaining) [2023-08-25 07:45:16,088 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err53ASSERT_VIOLATIONDATA_RACE (144 of 165 remaining) [2023-08-25 07:45:16,088 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err60ASSERT_VIOLATIONDATA_RACE (143 of 165 remaining) [2023-08-25 07:45:16,088 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err46ASSERT_VIOLATIONDATA_RACE (142 of 165 remaining) [2023-08-25 07:45:16,088 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (141 of 165 remaining) [2023-08-25 07:45:16,089 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err40ASSERT_VIOLATIONDATA_RACE (140 of 165 remaining) [2023-08-25 07:45:16,089 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err47ASSERT_VIOLATIONDATA_RACE (139 of 165 remaining) [2023-08-25 07:45:16,089 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err61ASSERT_VIOLATIONDATA_RACE (138 of 165 remaining) [2023-08-25 07:45:16,089 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (137 of 165 remaining) [2023-08-25 07:45:16,089 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err54ASSERT_VIOLATIONDATA_RACE (136 of 165 remaining) [2023-08-25 07:45:16,089 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err41ASSERT_VIOLATIONDATA_RACE (135 of 165 remaining) [2023-08-25 07:45:16,089 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err48ASSERT_VIOLATIONDATA_RACE (134 of 165 remaining) [2023-08-25 07:45:16,089 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err55ASSERT_VIOLATIONDATA_RACE (133 of 165 remaining) [2023-08-25 07:45:16,089 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err62ASSERT_VIOLATIONDATA_RACE (132 of 165 remaining) [2023-08-25 07:45:16,089 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err49ASSERT_VIOLATIONDATA_RACE (131 of 165 remaining) [2023-08-25 07:45:16,089 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err56ASSERT_VIOLATIONDATA_RACE (130 of 165 remaining) [2023-08-25 07:45:16,089 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err63ASSERT_VIOLATIONDATA_RACE (129 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (128 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err42ASSERT_VIOLATIONDATA_RACE (127 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err57ASSERT_VIOLATIONDATA_RACE (126 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err64ASSERT_VIOLATIONDATA_RACE (125 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (124 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err50ASSERT_VIOLATIONDATA_RACE (123 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err65ASSERT_VIOLATIONDATA_RACE (122 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err43ASSERT_VIOLATIONDATA_RACE (121 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err58ASSERT_VIOLATIONDATA_RACE (120 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err51ASSERT_VIOLATIONDATA_RACE (119 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err66ASSERT_VIOLATIONDATA_RACE (118 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (117 of 165 remaining) [2023-08-25 07:45:16,090 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err59ASSERT_VIOLATIONDATA_RACE (116 of 165 remaining) [2023-08-25 07:45:16,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err67ASSERT_VIOLATIONDATA_RACE (115 of 165 remaining) [2023-08-25 07:45:16,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (114 of 165 remaining) [2023-08-25 07:45:16,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (113 of 165 remaining) [2023-08-25 07:45:16,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (112 of 165 remaining) [2023-08-25 07:45:16,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (111 of 165 remaining) [2023-08-25 07:45:16,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (110 of 165 remaining) [2023-08-25 07:45:16,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (109 of 165 remaining) [2023-08-25 07:45:16,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (108 of 165 remaining) [2023-08-25 07:45:16,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (107 of 165 remaining) [2023-08-25 07:45:16,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (106 of 165 remaining) [2023-08-25 07:45:16,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (105 of 165 remaining) [2023-08-25 07:45:16,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (104 of 165 remaining) [2023-08-25 07:45:16,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (103 of 165 remaining) [2023-08-25 07:45:16,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (102 of 165 remaining) [2023-08-25 07:45:16,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (101 of 165 remaining) [2023-08-25 07:45:16,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (100 of 165 remaining) [2023-08-25 07:45:16,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (99 of 165 remaining) [2023-08-25 07:45:16,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err25ASSERT_VIOLATIONDATA_RACE (98 of 165 remaining) [2023-08-25 07:45:16,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err26ASSERT_VIOLATIONDATA_RACE (97 of 165 remaining) [2023-08-25 07:45:16,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err27ASSERT_VIOLATIONDATA_RACE (96 of 165 remaining) [2023-08-25 07:45:16,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err28ASSERT_VIOLATIONDATA_RACE (95 of 165 remaining) [2023-08-25 07:45:16,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err29ASSERT_VIOLATIONDATA_RACE (94 of 165 remaining) [2023-08-25 07:45:16,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err30ASSERT_VIOLATIONDATA_RACE (93 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err31ASSERT_VIOLATIONDATA_RACE (92 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err32ASSERT_VIOLATIONDATA_RACE (91 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err33ASSERT_VIOLATIONDATA_RACE (90 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err34ASSERT_VIOLATIONDATA_RACE (89 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err35ASSERT_VIOLATIONDATA_RACE (88 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (87 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (86 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (85 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (84 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (83 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (82 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (81 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (80 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (79 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (78 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (77 of 165 remaining) [2023-08-25 07:45:16,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (76 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (75 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (74 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (73 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (72 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (71 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (69 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (68 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (67 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err36ASSERT_VIOLATIONDATA_RACE (66 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (65 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err37ASSERT_VIOLATIONDATA_RACE (64 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err44ASSERT_VIOLATIONDATA_RACE (63 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (62 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err45ASSERT_VIOLATIONDATA_RACE (61 of 165 remaining) [2023-08-25 07:45:16,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err52ASSERT_VIOLATIONDATA_RACE (60 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err38ASSERT_VIOLATIONDATA_RACE (59 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err39ASSERT_VIOLATIONDATA_RACE (57 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err53ASSERT_VIOLATIONDATA_RACE (56 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err60ASSERT_VIOLATIONDATA_RACE (55 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err46ASSERT_VIOLATIONDATA_RACE (54 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (53 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err40ASSERT_VIOLATIONDATA_RACE (52 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err47ASSERT_VIOLATIONDATA_RACE (51 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err61ASSERT_VIOLATIONDATA_RACE (50 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err54ASSERT_VIOLATIONDATA_RACE (48 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err41ASSERT_VIOLATIONDATA_RACE (47 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err48ASSERT_VIOLATIONDATA_RACE (46 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err55ASSERT_VIOLATIONDATA_RACE (45 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err62ASSERT_VIOLATIONDATA_RACE (44 of 165 remaining) [2023-08-25 07:45:16,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err49ASSERT_VIOLATIONDATA_RACE (43 of 165 remaining) [2023-08-25 07:45:16,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err56ASSERT_VIOLATIONDATA_RACE (42 of 165 remaining) [2023-08-25 07:45:16,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err63ASSERT_VIOLATIONDATA_RACE (41 of 165 remaining) [2023-08-25 07:45:16,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (40 of 165 remaining) [2023-08-25 07:45:16,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err42ASSERT_VIOLATIONDATA_RACE (39 of 165 remaining) [2023-08-25 07:45:16,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err57ASSERT_VIOLATIONDATA_RACE (38 of 165 remaining) [2023-08-25 07:45:16,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err64ASSERT_VIOLATIONDATA_RACE (37 of 165 remaining) [2023-08-25 07:45:16,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (36 of 165 remaining) [2023-08-25 07:45:16,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err50ASSERT_VIOLATIONDATA_RACE (35 of 165 remaining) [2023-08-25 07:45:16,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err65ASSERT_VIOLATIONDATA_RACE (34 of 165 remaining) [2023-08-25 07:45:16,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err43ASSERT_VIOLATIONDATA_RACE (33 of 165 remaining) [2023-08-25 07:45:16,096 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err58ASSERT_VIOLATIONDATA_RACE (32 of 165 remaining) [2023-08-25 07:45:16,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err51ASSERT_VIOLATIONDATA_RACE (31 of 165 remaining) [2023-08-25 07:45:16,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err66ASSERT_VIOLATIONDATA_RACE (30 of 165 remaining) [2023-08-25 07:45:16,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (29 of 165 remaining) [2023-08-25 07:45:16,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err59ASSERT_VIOLATIONDATA_RACE (28 of 165 remaining) [2023-08-25 07:45:16,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err67ASSERT_VIOLATIONDATA_RACE (27 of 165 remaining) [2023-08-25 07:45:16,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 165 remaining) [2023-08-25 07:45:16,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (25 of 165 remaining) [2023-08-25 07:45:16,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (24 of 165 remaining) [2023-08-25 07:45:16,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 165 remaining) [2023-08-25 07:45:16,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 165 remaining) [2023-08-25 07:45:16,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (17 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (16 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (15 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (14 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (13 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (12 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (11 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err25ASSERT_VIOLATIONDATA_RACE (10 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err26ASSERT_VIOLATIONDATA_RACE (9 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err27ASSERT_VIOLATIONDATA_RACE (8 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err28ASSERT_VIOLATIONDATA_RACE (7 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err29ASSERT_VIOLATIONDATA_RACE (6 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err30ASSERT_VIOLATIONDATA_RACE (5 of 165 remaining) [2023-08-25 07:45:16,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err31ASSERT_VIOLATIONDATA_RACE (4 of 165 remaining) [2023-08-25 07:45:16,099 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err32ASSERT_VIOLATIONDATA_RACE (3 of 165 remaining) [2023-08-25 07:45:16,099 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err33ASSERT_VIOLATIONDATA_RACE (2 of 165 remaining) [2023-08-25 07:45:16,099 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err34ASSERT_VIOLATIONDATA_RACE (1 of 165 remaining) [2023-08-25 07:45:16,099 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err35ASSERT_VIOLATIONDATA_RACE (0 of 165 remaining) [2023-08-25 07:45:16,099 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:45:16,104 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 07:45:16,104 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 07:45:16,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 07:45:16 BasicIcfg [2023-08-25 07:45:16,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 07:45:16,107 INFO L158 Benchmark]: Toolchain (without parser) took 793853.03ms. Allocated memory was 339.7MB in the beginning and 15.3GB in the end (delta: 15.0GB). Free memory was 316.3MB in the beginning and 9.3GB in the end (delta: -9.0GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2023-08-25 07:45:16,107 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 339.7MB. Free memory is still 316.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 07:45:16,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.62ms. Allocated memory is still 339.7MB. Free memory was 315.8MB in the beginning and 302.4MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-25 07:45:16,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.04ms. Allocated memory is still 339.7MB. Free memory was 302.4MB in the beginning and 298.7MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 07:45:16,107 INFO L158 Benchmark]: Boogie Preprocessor took 81.58ms. Allocated memory is still 339.7MB. Free memory was 298.7MB in the beginning and 295.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 07:45:16,107 INFO L158 Benchmark]: RCFGBuilder took 976.53ms. Allocated memory is still 339.7MB. Free memory was 295.1MB in the beginning and 301.1MB in the end (delta: -6.0MB). Peak memory consumption was 36.5MB. Max. memory is 16.0GB. [2023-08-25 07:45:16,108 INFO L158 Benchmark]: TraceAbstraction took 792389.35ms. Allocated memory was 339.7MB in the beginning and 15.3GB in the end (delta: 15.0GB). Free memory was 301.1MB in the beginning and 9.3GB in the end (delta: -9.0GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2023-08-25 07:45:16,109 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.12ms. Allocated memory is still 339.7MB. Free memory is still 316.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 328.62ms. Allocated memory is still 339.7MB. Free memory was 315.8MB in the beginning and 302.4MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.04ms. Allocated memory is still 339.7MB. Free memory was 302.4MB in the beginning and 298.7MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 81.58ms. Allocated memory is still 339.7MB. Free memory was 298.7MB in the beginning and 295.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 976.53ms. Allocated memory is still 339.7MB. Free memory was 295.1MB in the beginning and 301.1MB in the end (delta: -6.0MB). Peak memory consumption was 36.5MB. Max. memory is 16.0GB. * TraceAbstraction took 792389.35ms. Allocated memory was 339.7MB in the beginning and 15.3GB in the end (delta: 15.0GB). Free memory was 301.1MB in the beginning and 9.3GB in the end (delta: -9.0GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.0s, 579 PlacesBefore, 220 PlacesAfterwards, 606 TransitionsBefore, 232 TransitionsAfterwards, 59800 CoEnabledTransitionPairs, 8 FixpointIterations, 122 TrivialSequentialCompositions, 386 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 75 ConcurrentYvCompositions, 15 ChoiceCompositions, 611 TotalNumberOfCompositions, 241078 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 69585, independent: 67153, independent conditional: 0, independent unconditional: 67153, dependent: 2432, dependent conditional: 0, dependent unconditional: 2432, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 33928, independent: 33520, independent conditional: 0, independent unconditional: 33520, dependent: 408, dependent conditional: 0, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 69585, independent: 33633, independent conditional: 0, independent unconditional: 33633, dependent: 2024, dependent conditional: 0, dependent unconditional: 2024, unknown: 33928, unknown conditional: 0, unknown unconditional: 33928] , Statistics on independence cache: Total cache size (in pairs): 3184, Positive cache size: 2941, Positive conditional cache size: 0, Positive unconditional cache size: 2941, Negative cache size: 243, Negative conditional cache size: 0, Negative unconditional cache size: 243, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1028 locations, 165 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: 792.2s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 758.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.3s, HoareTripleCheckerStatistics: 285 mSolverCounterUnknown, 10789 SdHoareTripleChecker+Valid, 337.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10789 mSDsluCounter, 7478 SdHoareTripleChecker+Invalid, 330.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3668 IncrementalHoareTripleChecker+Unchecked, 6828 mSDsCounter, 866 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60193 IncrementalHoareTripleChecker+Invalid, 65013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 866 mSolverCounterUnsat, 650 mSDtfsCounter, 60193 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1166 GetRequests, 674 SyntacticMatches, 10 SemanticMatches, 482 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13147 ImplicationChecksByTransitivity, 258.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10147occurred in iteration=26, InterpolantAutomatonStates: 319, 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.2s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 1440 NumberOfCodeBlocks, 1440 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1692 ConstructedInterpolants, 188 QuantifiedInterpolants, 19095 SizeOfPredicates, 77 NumberOfNonLiveVariables, 2344 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 36 InterpolantComputations, 23 PerfectInterpolantSequences, 27/61 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