/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 20:33:31,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 20:33:31,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 20:33:31,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 20:33:31,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 20:33:31,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 20:33:31,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 20:33:31,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 20:33:31,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 20:33:31,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 20:33:31,956 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 20:33:31,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 20:33:31,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 20:33:31,958 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 20:33:31,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 20:33:31,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 20:33:31,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 20:33:31,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 20:33:31,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 20:33:31,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 20:33:31,959 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 20:33:31,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 20:33:31,960 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 20:33:31,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 20:33:31,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 20:33:31,961 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 20:33:31,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 20:33:31,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 20:33:31,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 20:33:31,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 20:33:31,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 20:33:31,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 20:33:31,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 20:33:31,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 20:33:31,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 20:33:31,963 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 20:33:32,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 20:33:32,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 20:33:32,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 20:33:32,269 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 20:33:32,270 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 20:33:32,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-08-25 20:33:33,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 20:33:33,655 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 20:33:33,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-08-25 20:33:33,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b54c9771/7bd06366ad2c4a8fb1f2aa42c98ce995/FLAG0f1fc4a1b [2023-08-25 20:33:33,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b54c9771/7bd06366ad2c4a8fb1f2aa42c98ce995 [2023-08-25 20:33:33,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 20:33:33,678 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 20:33:33,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 20:33:33,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 20:33:33,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 20:33:33,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:33,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b0f17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33, skipping insertion in model container [2023-08-25 20:33:33,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:33,706 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 20:33:33,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 20:33:33,859 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 20:33:33,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 20:33:33,896 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 20:33:33,896 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 20:33:33,902 INFO L206 MainTranslator]: Completed translation [2023-08-25 20:33:33,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33 WrapperNode [2023-08-25 20:33:33,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 20:33:33,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 20:33:33,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 20:33:33,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 20:33:33,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:33,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:33,959 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 12, calls inlined = 14, statements flattened = 428 [2023-08-25 20:33:33,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 20:33:33,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 20:33:33,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 20:33:33,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 20:33:33,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:33,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:33,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:33,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:34,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:34,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:34,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:34,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:34,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 20:33:34,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 20:33:34,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 20:33:34,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 20:33:34,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33" (1/1) ... [2023-08-25 20:33:34,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 20:33:34,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:33:34,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 20:33:34,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 20:33:34,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 20:33:34,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 20:33:34,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 20:33:34,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 20:33:34,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 20:33:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 20:33:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 20:33:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 20:33:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 20:33:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 20:33:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 20:33:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 20:33:34,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 20:33:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 20:33:34,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 20:33:34,081 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 20:33:34,220 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 20:33:34,221 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 20:33:34,838 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 20:33:35,145 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 20:33:35,146 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-25 20:33:35,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:33:35 BoogieIcfgContainer [2023-08-25 20:33:35,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 20:33:35,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 20:33:35,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 20:33:35,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 20:33:35,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:33:33" (1/3) ... [2023-08-25 20:33:35,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477c2ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:33:35, skipping insertion in model container [2023-08-25 20:33:35,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:33:33" (2/3) ... [2023-08-25 20:33:35,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477c2ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:33:35, skipping insertion in model container [2023-08-25 20:33:35,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:33:35" (3/3) ... [2023-08-25 20:33:35,158 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2023-08-25 20:33:35,174 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 20:33:35,175 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2023-08-25 20:33:35,175 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 20:33:35,304 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-25 20:33:35,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 368 places, 377 transitions, 770 flow [2023-08-25 20:33:35,469 INFO L124 PetriNetUnfolderBase]: 16/375 cut-off events. [2023-08-25 20:33:35,469 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 20:33:35,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 375 events. 16/375 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 622 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 280. Up to 2 conditions per place. [2023-08-25 20:33:35,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 368 places, 377 transitions, 770 flow [2023-08-25 20:33:35,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 366 transitions, 744 flow [2023-08-25 20:33:35,488 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 20:33:35,499 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 366 transitions, 744 flow [2023-08-25 20:33:35,503 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 366 transitions, 744 flow [2023-08-25 20:33:35,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 366 transitions, 744 flow [2023-08-25 20:33:35,576 INFO L124 PetriNetUnfolderBase]: 16/366 cut-off events. [2023-08-25 20:33:35,576 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 20:33:35,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 366 events. 16/366 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 621 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 280. Up to 2 conditions per place. [2023-08-25 20:33:35,587 INFO L119 LiptonReduction]: Number of co-enabled transitions 11388 [2023-08-25 20:33:49,287 INFO L134 LiptonReduction]: Checked pairs total: 60421 [2023-08-25 20:33:49,288 INFO L136 LiptonReduction]: Total number of compositions: 429 [2023-08-25 20:33:49,300 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 20:33:49,305 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;@4de57489, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 20:33:49,305 INFO L358 AbstractCegarLoop]: Starting to check reachability of 120 error locations. [2023-08-25 20:33:49,306 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 20:33:49,306 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 20:33:49,306 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 20:33:49,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:49,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 20:33:49,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:49,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:49,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1773, now seen corresponding path program 1 times [2023-08-25 20:33:49,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:49,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952152721] [2023-08-25 20:33:49,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:49,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:33:49,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:49,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952152721] [2023-08-25 20:33:49,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952152721] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:33:49,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:33:49,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 20:33:49,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089059208] [2023-08-25 20:33:49,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:33:49,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 20:33:49,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:33:49,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 20:33:49,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 20:33:49,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 806 [2023-08-25 20:33:49,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 250 flow. Second operand has 2 states, 2 states have (on average 325.5) internal successors, (651), 2 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:49,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:33:49,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 806 [2023-08-25 20:33:49,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:33:49,570 INFO L124 PetriNetUnfolderBase]: 133/441 cut-off events. [2023-08-25 20:33:49,570 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-25 20:33:49,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 441 events. 133/441 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2276 event pairs, 93 based on Foata normal form. 38/402 useless extension candidates. Maximal degree in co-relation 615. Up to 227 conditions per place. [2023-08-25 20:33:49,574 INFO L140 encePairwiseOnDemand]: 744/806 looper letters, 26 selfloop transitions, 0 changer transitions 0/57 dead transitions. [2023-08-25 20:33:49,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 178 flow [2023-08-25 20:33:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 20:33:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 20:33:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 738 transitions. [2023-08-25 20:33:49,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45781637717121587 [2023-08-25 20:33:49,593 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 738 transitions. [2023-08-25 20:33:49,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 738 transitions. [2023-08-25 20:33:49,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:33:49,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 738 transitions. [2023-08-25 20:33:49,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 369.0) internal successors, (738), 2 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:49,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 806.0) internal successors, (2418), 3 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:49,612 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 806.0) internal successors, (2418), 3 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:49,614 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 250 flow. Second operand 2 states and 738 transitions. [2023-08-25 20:33:49,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 178 flow [2023-08-25 20:33:49,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 170 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 20:33:49,619 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 118 flow [2023-08-25 20:33:49,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2023-08-25 20:33:49,629 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -64 predicate places. [2023-08-25 20:33:49,629 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 118 flow [2023-08-25 20:33:49,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 325.5) internal successors, (651), 2 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:49,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:49,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 20:33:49,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 20:33:49,631 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:49,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1805276190, now seen corresponding path program 1 times [2023-08-25 20:33:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:49,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164801439] [2023-08-25 20:33:49,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:33:49,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:49,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164801439] [2023-08-25 20:33:49,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164801439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:33:49,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:33:49,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 20:33:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589540399] [2023-08-25 20:33:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:33:49,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 20:33:49,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:33:49,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 20:33:49,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 20:33:49,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 806 [2023-08-25 20:33:49,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:49,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:33:49,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 806 [2023-08-25 20:33:49,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:33:49,949 INFO L124 PetriNetUnfolderBase]: 198/505 cut-off events. [2023-08-25 20:33:49,949 INFO L125 PetriNetUnfolderBase]: For 5/18 co-relation queries the response was YES. [2023-08-25 20:33:49,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 505 events. 198/505 cut-off events. For 5/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2297 event pairs, 69 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 855. Up to 311 conditions per place. [2023-08-25 20:33:49,952 INFO L140 encePairwiseOnDemand]: 799/806 looper letters, 34 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2023-08-25 20:33:49,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 205 flow [2023-08-25 20:33:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 20:33:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 20:33:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 989 transitions. [2023-08-25 20:33:49,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40901571546732834 [2023-08-25 20:33:49,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 989 transitions. [2023-08-25 20:33:49,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 989 transitions. [2023-08-25 20:33:49,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:33:49,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 989 transitions. [2023-08-25 20:33:49,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 329.6666666666667) internal successors, (989), 3 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:49,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:49,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:49,966 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 118 flow. Second operand 3 states and 989 transitions. [2023-08-25 20:33:49,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 205 flow [2023-08-25 20:33:49,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 205 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 20:33:49,968 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 136 flow [2023-08-25 20:33:49,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2023-08-25 20:33:49,969 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -64 predicate places. [2023-08-25 20:33:49,970 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 136 flow [2023-08-25 20:33:49,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:49,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:49,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:33:49,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 20:33:49,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:49,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash -296328895, now seen corresponding path program 1 times [2023-08-25 20:33:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:49,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901738236] [2023-08-25 20:33:49,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:49,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:50,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:33:50,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:50,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901738236] [2023-08-25 20:33:50,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901738236] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:33:50,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:33:50,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 20:33:50,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949973127] [2023-08-25 20:33:50,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:33:50,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 20:33:50,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:33:50,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 20:33:50,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 20:33:50,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 806 [2023-08-25 20:33:50,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:50,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:33:50,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 806 [2023-08-25 20:33:50,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:33:50,149 INFO L124 PetriNetUnfolderBase]: 162/464 cut-off events. [2023-08-25 20:33:50,150 INFO L125 PetriNetUnfolderBase]: For 50/86 co-relation queries the response was YES. [2023-08-25 20:33:50,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 464 events. 162/464 cut-off events. For 50/86 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2185 event pairs, 115 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 819. Up to 268 conditions per place. [2023-08-25 20:33:50,152 INFO L140 encePairwiseOnDemand]: 804/806 looper letters, 28 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-08-25 20:33:50,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 192 flow [2023-08-25 20:33:50,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 20:33:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 20:33:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2023-08-25 20:33:50,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3999172870140612 [2023-08-25 20:33:50,155 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 967 transitions. [2023-08-25 20:33:50,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 967 transitions. [2023-08-25 20:33:50,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:33:50,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 967 transitions. [2023-08-25 20:33:50,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:50,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:50,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:50,163 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 136 flow. Second operand 3 states and 967 transitions. [2023-08-25 20:33:50,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 192 flow [2023-08-25 20:33:50,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 20:33:50,167 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 132 flow [2023-08-25 20:33:50,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2023-08-25 20:33:50,169 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -64 predicate places. [2023-08-25 20:33:50,169 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 132 flow [2023-08-25 20:33:50,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:50,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:50,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:33:50,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 20:33:50,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:50,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:50,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2117193164, now seen corresponding path program 1 times [2023-08-25 20:33:50,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:50,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366121970] [2023-08-25 20:33:50,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:33:50,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:50,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366121970] [2023-08-25 20:33:50,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366121970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:33:50,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:33:50,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 20:33:50,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738920601] [2023-08-25 20:33:50,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:33:50,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 20:33:50,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:33:50,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 20:33:50,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 20:33:50,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 806 [2023-08-25 20:33:50,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 132 flow. Second operand has 6 states, 6 states have (on average 278.8333333333333) internal successors, (1673), 6 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:50,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:33:50,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 806 [2023-08-25 20:33:50,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:33:51,181 INFO L124 PetriNetUnfolderBase]: 928/1508 cut-off events. [2023-08-25 20:33:51,181 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2023-08-25 20:33:51,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3273 conditions, 1508 events. 928/1508 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6679 event pairs, 87 based on Foata normal form. 0/1270 useless extension candidates. Maximal degree in co-relation 3268. Up to 524 conditions per place. [2023-08-25 20:33:51,190 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 143 selfloop transitions, 4 changer transitions 0/155 dead transitions. [2023-08-25 20:33:51,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 155 transitions, 664 flow [2023-08-25 20:33:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 20:33:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 20:33:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1800 transitions. [2023-08-25 20:33:51,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37220843672456577 [2023-08-25 20:33:51,195 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1800 transitions. [2023-08-25 20:33:51,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1800 transitions. [2023-08-25 20:33:51,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:33:51,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1800 transitions. [2023-08-25 20:33:51,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:51,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:51,209 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:51,210 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 132 flow. Second operand 6 states and 1800 transitions. [2023-08-25 20:33:51,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 155 transitions, 664 flow [2023-08-25 20:33:51,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 155 transitions, 663 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 20:33:51,214 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 137 flow [2023-08-25 20:33:51,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-08-25 20:33:51,215 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -61 predicate places. [2023-08-25 20:33:51,215 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 137 flow [2023-08-25 20:33:51,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 278.8333333333333) internal successors, (1673), 6 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:51,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:51,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:33:51,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 20:33:51,216 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:51,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:51,217 INFO L85 PathProgramCache]: Analyzing trace with hash -978371210, now seen corresponding path program 1 times [2023-08-25 20:33:51,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:51,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807719117] [2023-08-25 20:33:51,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:51,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:33:51,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807719117] [2023-08-25 20:33:51,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807719117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:33:51,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:33:51,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 20:33:51,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92783888] [2023-08-25 20:33:51,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:33:51,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 20:33:51,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:33:51,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 20:33:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 20:33:51,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 806 [2023-08-25 20:33:51,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 270.4) internal successors, (1352), 5 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:51,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:33:51,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 806 [2023-08-25 20:33:51,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:33:51,508 INFO L124 PetriNetUnfolderBase]: 317/594 cut-off events. [2023-08-25 20:33:51,509 INFO L125 PetriNetUnfolderBase]: For 165/172 co-relation queries the response was YES. [2023-08-25 20:33:51,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 594 events. 317/594 cut-off events. For 165/172 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2161 event pairs, 229 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 1352. Up to 492 conditions per place. [2023-08-25 20:33:51,512 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 44 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-08-25 20:33:51,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 256 flow [2023-08-25 20:33:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 20:33:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 20:33:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1387 transitions. [2023-08-25 20:33:51,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34416873449131513 [2023-08-25 20:33:51,517 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1387 transitions. [2023-08-25 20:33:51,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1387 transitions. [2023-08-25 20:33:51,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:33:51,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1387 transitions. [2023-08-25 20:33:51,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 277.4) internal successors, (1387), 5 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:51,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:51,529 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:51,530 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 137 flow. Second operand 5 states and 1387 transitions. [2023-08-25 20:33:51,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 256 flow [2023-08-25 20:33:51,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 247 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 20:33:51,532 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 146 flow [2023-08-25 20:33:51,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2023-08-25 20:33:51,533 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -60 predicate places. [2023-08-25 20:33:51,533 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 146 flow [2023-08-25 20:33:51,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 270.4) internal successors, (1352), 5 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:51,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:51,534 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 20:33:51,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 20:33:51,534 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:51,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash -322824960, now seen corresponding path program 1 times [2023-08-25 20:33:51,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:51,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221440530] [2023-08-25 20:33:51,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:51,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:51,823 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 20:33:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:51,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221440530] [2023-08-25 20:33:51,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221440530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:33:51,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:33:51,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 20:33:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732048350] [2023-08-25 20:33:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:33:51,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 20:33:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:33:51,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 20:33:51,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 20:33:51,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 806 [2023-08-25 20:33:51,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 277.1666666666667) internal successors, (1663), 6 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:51,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:33:51,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 806 [2023-08-25 20:33:51,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:33:52,246 INFO L124 PetriNetUnfolderBase]: 940/1525 cut-off events. [2023-08-25 20:33:52,247 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2023-08-25 20:33:52,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3414 conditions, 1525 events. 940/1525 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6157 event pairs, 238 based on Foata normal form. 0/1357 useless extension candidates. Maximal degree in co-relation 3408. Up to 746 conditions per place. [2023-08-25 20:33:52,255 INFO L140 encePairwiseOnDemand]: 799/806 looper letters, 87 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2023-08-25 20:33:52,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 98 transitions, 438 flow [2023-08-25 20:33:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 20:33:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 20:33:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1741 transitions. [2023-08-25 20:33:52,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36000827129859386 [2023-08-25 20:33:52,261 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1741 transitions. [2023-08-25 20:33:52,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1741 transitions. [2023-08-25 20:33:52,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:33:52,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1741 transitions. [2023-08-25 20:33:52,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 290.1666666666667) internal successors, (1741), 6 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:52,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:52,273 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:52,273 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 146 flow. Second operand 6 states and 1741 transitions. [2023-08-25 20:33:52,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 98 transitions, 438 flow [2023-08-25 20:33:52,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 431 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-25 20:33:52,276 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 145 flow [2023-08-25 20:33:52,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2023-08-25 20:33:52,277 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -59 predicate places. [2023-08-25 20:33:52,277 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 145 flow [2023-08-25 20:33:52,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.1666666666667) internal successors, (1663), 6 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:52,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:52,278 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] [2023-08-25 20:33:52,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 20:33:52,278 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:52,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:52,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1079415241, now seen corresponding path program 1 times [2023-08-25 20:33:52,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:52,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6780068] [2023-08-25 20:33:52,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:52,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:33:52,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:52,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6780068] [2023-08-25 20:33:52,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6780068] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 20:33:52,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866063097] [2023-08-25 20:33:52,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:52,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:33:52,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:33:52,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 20:33:52,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 20:33:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:52,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 20:33:52,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 20:33:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:33:52,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 20:33:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:33:52,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866063097] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 20:33:52,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 20:33:52,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2023-08-25 20:33:52,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988585014] [2023-08-25 20:33:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:33:52,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 20:33:52,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:33:52,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 20:33:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-25 20:33:52,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 806 [2023-08-25 20:33:52,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 270.2) internal successors, (1351), 5 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:52,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:33:52,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 806 [2023-08-25 20:33:52,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:33:52,880 INFO L124 PetriNetUnfolderBase]: 536/1017 cut-off events. [2023-08-25 20:33:52,880 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-08-25 20:33:52,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 1017 events. 536/1017 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3910 event pairs, 198 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 2267. Up to 423 conditions per place. [2023-08-25 20:33:52,886 INFO L140 encePairwiseOnDemand]: 800/806 looper letters, 66 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2023-08-25 20:33:52,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 379 flow [2023-08-25 20:33:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 20:33:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 20:33:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1678 transitions. [2023-08-25 20:33:52,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3469809760132341 [2023-08-25 20:33:52,891 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1678 transitions. [2023-08-25 20:33:52,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1678 transitions. [2023-08-25 20:33:52,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:33:52,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1678 transitions. [2023-08-25 20:33:52,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 279.6666666666667) internal successors, (1678), 6 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:52,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:52,903 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:52,903 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 145 flow. Second operand 6 states and 1678 transitions. [2023-08-25 20:33:52,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 379 flow [2023-08-25 20:33:52,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 359 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 20:33:52,906 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 163 flow [2023-08-25 20:33:52,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2023-08-25 20:33:52,907 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -57 predicate places. [2023-08-25 20:33:52,907 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 163 flow [2023-08-25 20:33:52,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 270.2) internal successors, (1351), 5 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:52,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:52,908 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:33:52,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-25 20:33:53,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:33:53,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:53,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:53,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1896999279, now seen corresponding path program 1 times [2023-08-25 20:33:53,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:53,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592922732] [2023-08-25 20:33:53,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 20:33:53,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:53,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592922732] [2023-08-25 20:33:53,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592922732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:33:53,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:33:53,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 20:33:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764817665] [2023-08-25 20:33:53,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:33:53,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 20:33:53,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:33:53,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 20:33:53,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 20:33:53,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 806 [2023-08-25 20:33:53,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:53,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:33:53,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 806 [2023-08-25 20:33:53,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:33:53,922 INFO L124 PetriNetUnfolderBase]: 1560/2705 cut-off events. [2023-08-25 20:33:53,922 INFO L125 PetriNetUnfolderBase]: For 621/621 co-relation queries the response was YES. [2023-08-25 20:33:53,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6015 conditions, 2705 events. 1560/2705 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 12478 event pairs, 1248 based on Foata normal form. 0/2437 useless extension candidates. Maximal degree in co-relation 6008. Up to 2384 conditions per place. [2023-08-25 20:33:53,937 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 59 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-08-25 20:33:53,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 71 transitions, 335 flow [2023-08-25 20:33:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 20:33:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 20:33:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1721 transitions. [2023-08-25 20:33:53,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35587262200165426 [2023-08-25 20:33:53,943 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1721 transitions. [2023-08-25 20:33:53,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1721 transitions. [2023-08-25 20:33:53,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:33:53,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1721 transitions. [2023-08-25 20:33:53,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 286.8333333333333) internal successors, (1721), 6 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:53,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:53,967 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:53,968 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 163 flow. Second operand 6 states and 1721 transitions. [2023-08-25 20:33:53,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 71 transitions, 335 flow [2023-08-25 20:33:53,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 71 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 20:33:53,970 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 165 flow [2023-08-25 20:33:53,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2023-08-25 20:33:53,971 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -55 predicate places. [2023-08-25 20:33:53,971 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 165 flow [2023-08-25 20:33:53,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:53,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:53,972 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:33:53,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 20:33:53,972 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:53,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash -815923960, now seen corresponding path program 1 times [2023-08-25 20:33:53,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:53,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559402115] [2023-08-25 20:33:53,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:53,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 20:33:54,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:54,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559402115] [2023-08-25 20:33:54,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559402115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:33:54,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:33:54,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 20:33:54,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107167880] [2023-08-25 20:33:54,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:33:54,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 20:33:54,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:33:54,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 20:33:54,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 20:33:54,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 806 [2023-08-25 20:33:54,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:54,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:33:54,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 806 [2023-08-25 20:33:54,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:33:54,490 INFO L124 PetriNetUnfolderBase]: 760/1384 cut-off events. [2023-08-25 20:33:54,490 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2023-08-25 20:33:54,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3113 conditions, 1384 events. 760/1384 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5937 event pairs, 46 based on Foata normal form. 0/1265 useless extension candidates. Maximal degree in co-relation 3105. Up to 660 conditions per place. [2023-08-25 20:33:54,498 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 66 selfloop transitions, 11 changer transitions 0/91 dead transitions. [2023-08-25 20:33:54,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 422 flow [2023-08-25 20:33:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 20:33:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 20:33:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1582 transitions. [2023-08-25 20:33:54,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925558312655087 [2023-08-25 20:33:54,503 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1582 transitions. [2023-08-25 20:33:54,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1582 transitions. [2023-08-25 20:33:54,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:33:54,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1582 transitions. [2023-08-25 20:33:54,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 316.4) internal successors, (1582), 5 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:54,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:54,512 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:54,512 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 165 flow. Second operand 5 states and 1582 transitions. [2023-08-25 20:33:54,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 422 flow [2023-08-25 20:33:54,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 413 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 20:33:54,515 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 244 flow [2023-08-25 20:33:54,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2023-08-25 20:33:54,517 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -52 predicate places. [2023-08-25 20:33:54,517 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 244 flow [2023-08-25 20:33:54,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:54,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:54,518 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:33:54,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 20:33:54,518 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:54,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash -635856298, now seen corresponding path program 2 times [2023-08-25 20:33:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:54,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026342308] [2023-08-25 20:33:54,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 20:33:54,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:54,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026342308] [2023-08-25 20:33:54,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026342308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:33:54,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:33:54,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 20:33:54,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502633528] [2023-08-25 20:33:54,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:33:54,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 20:33:54,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:33:54,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 20:33:54,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 20:33:54,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 806 [2023-08-25 20:33:54,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:54,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:33:54,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 806 [2023-08-25 20:33:54,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:33:54,941 INFO L124 PetriNetUnfolderBase]: 523/1243 cut-off events. [2023-08-25 20:33:54,941 INFO L125 PetriNetUnfolderBase]: For 1028/1035 co-relation queries the response was YES. [2023-08-25 20:33:54,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2931 conditions, 1243 events. 523/1243 cut-off events. For 1028/1035 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6912 event pairs, 176 based on Foata normal form. 2/1185 useless extension candidates. Maximal degree in co-relation 2920. Up to 505 conditions per place. [2023-08-25 20:33:54,949 INFO L140 encePairwiseOnDemand]: 803/806 looper letters, 55 selfloop transitions, 2 changer transitions 1/82 dead transitions. [2023-08-25 20:33:54,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 82 transitions, 463 flow [2023-08-25 20:33:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 20:33:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 20:33:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1002 transitions. [2023-08-25 20:33:54,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4143920595533499 [2023-08-25 20:33:54,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1002 transitions. [2023-08-25 20:33:54,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1002 transitions. [2023-08-25 20:33:54,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:33:54,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1002 transitions. [2023-08-25 20:33:54,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:54,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:54,960 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:54,960 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 244 flow. Second operand 3 states and 1002 transitions. [2023-08-25 20:33:54,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 82 transitions, 463 flow [2023-08-25 20:33:54,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 82 transitions, 459 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-25 20:33:54,965 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 252 flow [2023-08-25 20:33:54,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2023-08-25 20:33:54,968 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -49 predicate places. [2023-08-25 20:33:54,968 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 252 flow [2023-08-25 20:33:54,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:54,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:54,968 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:33:54,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 20:33:54,968 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:54,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1520055367, now seen corresponding path program 1 times [2023-08-25 20:33:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:54,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212782733] [2023-08-25 20:33:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 20:33:55,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:55,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212782733] [2023-08-25 20:33:55,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212782733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:33:55,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:33:55,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 20:33:55,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495426915] [2023-08-25 20:33:55,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:33:55,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 20:33:55,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:33:55,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 20:33:55,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 20:33:55,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 806 [2023-08-25 20:33:55,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:55,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:33:55,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 806 [2023-08-25 20:33:55,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:33:55,320 INFO L124 PetriNetUnfolderBase]: 507/1376 cut-off events. [2023-08-25 20:33:55,320 INFO L125 PetriNetUnfolderBase]: For 1277/1285 co-relation queries the response was YES. [2023-08-25 20:33:55,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 1376 events. 507/1376 cut-off events. For 1277/1285 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7935 event pairs, 184 based on Foata normal form. 52/1360 useless extension candidates. Maximal degree in co-relation 3299. Up to 616 conditions per place. [2023-08-25 20:33:55,327 INFO L140 encePairwiseOnDemand]: 803/806 looper letters, 54 selfloop transitions, 2 changer transitions 4/84 dead transitions. [2023-08-25 20:33:55,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 483 flow [2023-08-25 20:33:55,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 20:33:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 20:33:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2023-08-25 20:33:55,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41563275434243174 [2023-08-25 20:33:55,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1005 transitions. [2023-08-25 20:33:55,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1005 transitions. [2023-08-25 20:33:55,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:33:55,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1005 transitions. [2023-08-25 20:33:55,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:55,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:55,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:55,337 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 252 flow. Second operand 3 states and 1005 transitions. [2023-08-25 20:33:55,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 483 flow [2023-08-25 20:33:55,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 20:33:55,340 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 262 flow [2023-08-25 20:33:55,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2023-08-25 20:33:55,341 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -47 predicate places. [2023-08-25 20:33:55,341 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 262 flow [2023-08-25 20:33:55,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:55,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:55,341 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:33:55,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 20:33:55,342 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:55,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:55,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1734987576, now seen corresponding path program 1 times [2023-08-25 20:33:55,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:55,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824037008] [2023-08-25 20:33:55,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:55,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 20:33:55,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:55,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824037008] [2023-08-25 20:33:55,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824037008] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:33:55,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:33:55,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 20:33:55,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69461418] [2023-08-25 20:33:55,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:33:55,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 20:33:55,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:33:55,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 20:33:55,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 20:33:55,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 806 [2023-08-25 20:33:55,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:55,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:33:55,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 806 [2023-08-25 20:33:55,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:33:55,738 INFO L124 PetriNetUnfolderBase]: 638/1719 cut-off events. [2023-08-25 20:33:55,738 INFO L125 PetriNetUnfolderBase]: For 1672/1684 co-relation queries the response was YES. [2023-08-25 20:33:55,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4288 conditions, 1719 events. 638/1719 cut-off events. For 1672/1684 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10471 event pairs, 481 based on Foata normal form. 20/1628 useless extension candidates. Maximal degree in co-relation 4274. Up to 876 conditions per place. [2023-08-25 20:33:55,748 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 39 selfloop transitions, 2 changer transitions 26/91 dead transitions. [2023-08-25 20:33:55,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 534 flow [2023-08-25 20:33:55,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 20:33:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 20:33:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1477 transitions. [2023-08-25 20:33:55,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36650124069478907 [2023-08-25 20:33:55,753 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1477 transitions. [2023-08-25 20:33:55,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1477 transitions. [2023-08-25 20:33:55,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:33:55,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1477 transitions. [2023-08-25 20:33:55,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 295.4) internal successors, (1477), 5 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:55,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:55,762 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:55,762 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 262 flow. Second operand 5 states and 1477 transitions. [2023-08-25 20:33:55,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 534 flow [2023-08-25 20:33:55,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 20:33:55,767 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 276 flow [2023-08-25 20:33:55,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2023-08-25 20:33:55,768 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -41 predicate places. [2023-08-25 20:33:55,768 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 276 flow [2023-08-25 20:33:55,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:33:55,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:33:55,768 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:33:55,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 20:33:55,769 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:33:55,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:33:55,769 INFO L85 PathProgramCache]: Analyzing trace with hash -533027293, now seen corresponding path program 1 times [2023-08-25 20:33:55,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:33:55,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207698644] [2023-08-25 20:33:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:55,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:33:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 20:33:57,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:33:57,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207698644] [2023-08-25 20:33:57,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207698644] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 20:33:57,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353671113] [2023-08-25 20:33:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:33:57,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:33:57,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:33:57,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 20:33:57,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 20:33:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:33:57,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 51 conjunts are in the unsatisfiable core [2023-08-25 20:33:57,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 20:33:57,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 20:33:57,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 20:33:57,332 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 20:33:57,333 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-25 20:33:57,385 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 15 treesize of output 11 [2023-08-25 20:33:57,439 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 20:33:57,440 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-08-25 20:33:57,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 20:33:57,511 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 20:33:57,663 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 20:33:58,444 INFO L322 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-08-25 20:33:58,445 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 22 [2023-08-25 20:33:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 20:33:58,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 20:33:58,820 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:33:58,821 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 223 treesize of output 224 [2023-08-25 20:34:00,622 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:00,623 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 126 treesize of output 90 [2023-08-25 20:34:00,659 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 20:34:00,661 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 13676 treesize of output 13167 [2023-08-25 20:34:00,824 INFO L322 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2023-08-25 20:34:00,825 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1628 treesize of output 1276 [2023-08-25 20:34:00,862 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 20:34:00,878 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:00,879 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1244 treesize of output 1132 [2023-08-25 20:34:00,914 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 20:34:00,929 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:00,930 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1100 treesize of output 940 [2023-08-25 20:34:02,531 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:02,532 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 62 treesize of output 51 [2023-08-25 20:34:02,539 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3350 treesize of output 3222 [2023-08-25 20:34:02,577 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:02,578 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 798 treesize of output 743 [2023-08-25 20:34:02,609 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:02,610 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 726 treesize of output 551 [2023-08-25 20:34:02,635 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:02,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 534 treesize of output 455 [2023-08-25 20:34:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 20:34:03,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353671113] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 20:34:03,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 20:34:03,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2023-08-25 20:34:03,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50749310] [2023-08-25 20:34:03,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 20:34:03,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-25 20:34:03,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:34:03,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-25 20:34:03,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=613, Unknown=8, NotChecked=0, Total=812 [2023-08-25 20:34:03,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 806 [2023-08-25 20:34:03,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 276 flow. Second operand has 29 states, 29 states have (on average 203.44827586206895) internal successors, (5900), 29 states have internal predecessors, (5900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:34:03,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:34:03,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 806 [2023-08-25 20:34:03,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:34:18,385 INFO L124 PetriNetUnfolderBase]: 16106/27050 cut-off events. [2023-08-25 20:34:18,386 INFO L125 PetriNetUnfolderBase]: For 28614/28686 co-relation queries the response was YES. [2023-08-25 20:34:18,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76633 conditions, 27050 events. 16106/27050 cut-off events. For 28614/28686 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 186270 event pairs, 1520 based on Foata normal form. 4/26487 useless extension candidates. Maximal degree in co-relation 76616. Up to 4522 conditions per place. [2023-08-25 20:34:18,572 INFO L140 encePairwiseOnDemand]: 790/806 looper letters, 745 selfloop transitions, 92 changer transitions 65/908 dead transitions. [2023-08-25 20:34:18,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 908 transitions, 5120 flow [2023-08-25 20:34:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-25 20:34:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-25 20:34:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 8557 transitions. [2023-08-25 20:34:18,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2722211617993256 [2023-08-25 20:34:18,594 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 8557 transitions. [2023-08-25 20:34:18,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 8557 transitions. [2023-08-25 20:34:18,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:34:18,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 8557 transitions. [2023-08-25 20:34:18,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 219.4102564102564) internal successors, (8557), 39 states have internal predecessors, (8557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:34:18,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 806.0) internal successors, (32240), 40 states have internal predecessors, (32240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:34:18,659 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 806.0) internal successors, (32240), 40 states have internal predecessors, (32240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:34:18,659 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 276 flow. Second operand 39 states and 8557 transitions. [2023-08-25 20:34:18,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 908 transitions, 5120 flow [2023-08-25 20:34:18,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 908 transitions, 5094 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-25 20:34:18,727 INFO L231 Difference]: Finished difference. Result has 134 places, 174 transitions, 1207 flow [2023-08-25 20:34:18,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=1207, PETRI_PLACES=134, PETRI_TRANSITIONS=174} [2023-08-25 20:34:18,728 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 14 predicate places. [2023-08-25 20:34:18,728 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 174 transitions, 1207 flow [2023-08-25 20:34:18,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 203.44827586206895) internal successors, (5900), 29 states have internal predecessors, (5900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:34:18,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:34:18,730 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:34:18,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-25 20:34:18,935 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,SelfDestructingSolverStorable12 [2023-08-25 20:34:18,936 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:34:18,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:34:18,937 INFO L85 PathProgramCache]: Analyzing trace with hash 942924050, now seen corresponding path program 2 times [2023-08-25 20:34:18,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:34:18,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251234849] [2023-08-25 20:34:18,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:34:18,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:34:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:34:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 20:34:21,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:34:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251234849] [2023-08-25 20:34:21,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251234849] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 20:34:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519254574] [2023-08-25 20:34:21,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 20:34:21,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:34:21,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:34:21,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 20:34:21,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 20:34:22,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 20:34:22,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 20:34:22,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 63 conjunts are in the unsatisfiable core [2023-08-25 20:34:22,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 20:34:22,241 INFO L322 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-08-25 20:34:22,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 27 [2023-08-25 20:34:22,369 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 20:34:22,369 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 20:34:22,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 20:34:22,469 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-25 20:34:22,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 20:34:22,705 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 14 treesize of output 16 [2023-08-25 20:34:23,230 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-08-25 20:34:23,230 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 54 treesize of output 19 [2023-08-25 20:34:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 20:34:23,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 20:34:34,069 WARN L234 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 20:34:38,626 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:38,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 74 [2023-08-25 20:34:38,640 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:38,640 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 979 treesize of output 951 [2023-08-25 20:34:38,693 INFO L322 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2023-08-25 20:34:38,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 667 treesize of output 672 [2023-08-25 20:34:38,742 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:38,742 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 569 treesize of output 543 [2023-08-25 20:34:38,779 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:38,780 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 586 treesize of output 494 [2023-08-25 20:34:43,565 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 20:34:43,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2023-08-25 20:34:43,583 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:43,583 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 30 [2023-08-25 20:34:43,592 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:43,592 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 22 [2023-08-25 20:34:43,620 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-08-25 20:34:43,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-08-25 20:34:43,647 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-25 20:34:43,647 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2023-08-25 20:34:43,655 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-25 20:34:43,694 INFO L322 Elim1Store]: treesize reduction 21, result has 71.2 percent of original size [2023-08-25 20:34:43,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 61 [2023-08-25 20:34:43,752 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-25 20:34:43,788 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-25 20:34:43,793 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-25 20:34:43,805 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:43,806 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 56 treesize of output 45 [2023-08-25 20:34:43,809 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 20:34:43,810 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 20:34:43,818 INFO L322 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-08-25 20:34:43,819 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 218 treesize of output 138 [2023-08-25 20:34:43,826 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-08-25 20:34:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 20:34:44,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519254574] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 20:34:44,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 20:34:44,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 27 [2023-08-25 20:34:44,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71860150] [2023-08-25 20:34:44,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 20:34:44,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-25 20:34:44,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:34:44,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-25 20:34:44,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=658, Unknown=8, NotChecked=0, Total=812 [2023-08-25 20:34:44,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 806 [2023-08-25 20:34:44,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 174 transitions, 1207 flow. Second operand has 29 states, 29 states have (on average 205.51724137931035) internal successors, (5960), 29 states have internal predecessors, (5960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:34:44,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:34:44,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 806 [2023-08-25 20:34:44,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:34:51,641 INFO L124 PetriNetUnfolderBase]: 25735/43307 cut-off events. [2023-08-25 20:34:51,641 INFO L125 PetriNetUnfolderBase]: For 108289/108409 co-relation queries the response was YES. [2023-08-25 20:34:52,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150115 conditions, 43307 events. 25735/43307 cut-off events. For 108289/108409 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 315554 event pairs, 3455 based on Foata normal form. 2/43212 useless extension candidates. Maximal degree in co-relation 150078. Up to 13782 conditions per place. [2023-08-25 20:34:52,296 INFO L140 encePairwiseOnDemand]: 792/806 looper letters, 414 selfloop transitions, 98 changer transitions 53/571 dead transitions. [2023-08-25 20:34:52,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 571 transitions, 4431 flow [2023-08-25 20:34:52,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-25 20:34:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-25 20:34:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4556 transitions. [2023-08-25 20:34:52,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26917168852652723 [2023-08-25 20:34:52,306 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4556 transitions. [2023-08-25 20:34:52,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4556 transitions. [2023-08-25 20:34:52,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:34:52,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4556 transitions. [2023-08-25 20:34:52,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 216.95238095238096) internal successors, (4556), 21 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:34:52,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 806.0) internal successors, (17732), 22 states have internal predecessors, (17732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:34:52,337 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 806.0) internal successors, (17732), 22 states have internal predecessors, (17732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:34:52,337 INFO L175 Difference]: Start difference. First operand has 134 places, 174 transitions, 1207 flow. Second operand 21 states and 4556 transitions. [2023-08-25 20:34:52,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 571 transitions, 4431 flow [2023-08-25 20:34:53,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 571 transitions, 4208 flow, removed 77 selfloop flow, removed 4 redundant places. [2023-08-25 20:34:53,571 INFO L231 Difference]: Finished difference. Result has 160 places, 239 transitions, 1981 flow [2023-08-25 20:34:53,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1981, PETRI_PLACES=160, PETRI_TRANSITIONS=239} [2023-08-25 20:34:53,571 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 40 predicate places. [2023-08-25 20:34:53,572 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 239 transitions, 1981 flow [2023-08-25 20:34:53,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 205.51724137931035) internal successors, (5960), 29 states have internal predecessors, (5960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:34:53,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:34:53,574 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:34:53,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 20:34:53,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:34:53,779 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:34:53,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:34:53,780 INFO L85 PathProgramCache]: Analyzing trace with hash 868638532, now seen corresponding path program 3 times [2023-08-25 20:34:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:34:53,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153157083] [2023-08-25 20:34:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:34:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:34:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:34:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 20:34:55,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:34:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153157083] [2023-08-25 20:34:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153157083] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 20:34:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917737269] [2023-08-25 20:34:55,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 20:34:55,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:34:55,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:34:55,735 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 20:34:55,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 20:34:55,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-25 20:34:55,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 20:34:55,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-25 20:34:55,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 20:34:56,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 20:34:56,406 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-25 20:34:56,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2023-08-25 20:34:56,414 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-08-25 20:34:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 20:34:56,770 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 20:34:56,991 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:56,991 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 223 treesize of output 224 [2023-08-25 20:34:57,868 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:34:57,868 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 137 [2023-08-25 20:34:57,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2023-08-25 20:34:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 20:34:58,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917737269] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 20:34:58,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 20:34:58,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 30 [2023-08-25 20:34:58,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483157528] [2023-08-25 20:34:58,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 20:34:58,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-25 20:34:58,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:34:58,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-25 20:34:58,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2023-08-25 20:34:58,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 806 [2023-08-25 20:34:58,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 239 transitions, 1981 flow. Second operand has 32 states, 32 states have (on average 206.09375) internal successors, (6595), 32 states have internal predecessors, (6595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:34:58,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:34:58,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 806 [2023-08-25 20:34:58,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:35:10,227 INFO L124 PetriNetUnfolderBase]: 38830/64776 cut-off events. [2023-08-25 20:35:10,227 INFO L125 PetriNetUnfolderBase]: For 249966/250297 co-relation queries the response was YES. [2023-08-25 20:35:10,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244700 conditions, 64776 events. 38830/64776 cut-off events. For 249966/250297 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 499202 event pairs, 4595 based on Foata normal form. 16/64542 useless extension candidates. Maximal degree in co-relation 244656. Up to 18478 conditions per place. [2023-08-25 20:35:10,956 INFO L140 encePairwiseOnDemand]: 790/806 looper letters, 488 selfloop transitions, 166 changer transitions 52/712 dead transitions. [2023-08-25 20:35:10,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 712 transitions, 6281 flow [2023-08-25 20:35:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-25 20:35:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-25 20:35:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 6053 transitions. [2023-08-25 20:35:10,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26821162708259483 [2023-08-25 20:35:10,968 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 6053 transitions. [2023-08-25 20:35:10,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 6053 transitions. [2023-08-25 20:35:10,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:35:10,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 6053 transitions. [2023-08-25 20:35:10,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 216.17857142857142) internal successors, (6053), 28 states have internal predecessors, (6053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:10,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 806.0) internal successors, (23374), 29 states have internal predecessors, (23374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:11,002 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 806.0) internal successors, (23374), 29 states have internal predecessors, (23374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:11,002 INFO L175 Difference]: Start difference. First operand has 160 places, 239 transitions, 1981 flow. Second operand 28 states and 6053 transitions. [2023-08-25 20:35:11,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 712 transitions, 6281 flow [2023-08-25 20:35:14,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 712 transitions, 6159 flow, removed 54 selfloop flow, removed 6 redundant places. [2023-08-25 20:35:14,621 INFO L231 Difference]: Finished difference. Result has 194 places, 331 transitions, 3515 flow [2023-08-25 20:35:14,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3515, PETRI_PLACES=194, PETRI_TRANSITIONS=331} [2023-08-25 20:35:14,621 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 74 predicate places. [2023-08-25 20:35:14,621 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 331 transitions, 3515 flow [2023-08-25 20:35:14,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 206.09375) internal successors, (6595), 32 states have internal predecessors, (6595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:14,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:35:14,623 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:35:14,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 20:35:14,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-25 20:35:14,831 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:35:14,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:35:14,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1097406076, now seen corresponding path program 4 times [2023-08-25 20:35:14,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:35:14,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308142048] [2023-08-25 20:35:14,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:35:14,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:35:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:35:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 20:35:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:35:15,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308142048] [2023-08-25 20:35:15,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308142048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:35:15,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:35:15,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 20:35:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839118668] [2023-08-25 20:35:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:35:15,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 20:35:15,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:35:15,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 20:35:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-25 20:35:15,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 806 [2023-08-25 20:35:15,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 331 transitions, 3515 flow. Second operand has 4 states, 4 states have (on average 327.75) internal successors, (1311), 4 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:15,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:35:15,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 806 [2023-08-25 20:35:15,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:35:19,584 INFO L124 PetriNetUnfolderBase]: 9709/25508 cut-off events. [2023-08-25 20:35:19,584 INFO L125 PetriNetUnfolderBase]: For 145943/146466 co-relation queries the response was YES. [2023-08-25 20:35:19,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98266 conditions, 25508 events. 9709/25508 cut-off events. For 145943/146466 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 254574 event pairs, 2660 based on Foata normal form. 486/25293 useless extension candidates. Maximal degree in co-relation 98208. Up to 7124 conditions per place. [2023-08-25 20:35:19,833 INFO L140 encePairwiseOnDemand]: 803/806 looper letters, 389 selfloop transitions, 81 changer transitions 55/557 dead transitions. [2023-08-25 20:35:19,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 557 transitions, 6993 flow [2023-08-25 20:35:19,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 20:35:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 20:35:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1350 transitions. [2023-08-25 20:35:19,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41873449131513646 [2023-08-25 20:35:19,836 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1350 transitions. [2023-08-25 20:35:19,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1350 transitions. [2023-08-25 20:35:19,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:35:19,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1350 transitions. [2023-08-25 20:35:19,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 337.5) internal successors, (1350), 4 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:19,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 806.0) internal successors, (4030), 5 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:19,840 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 806.0) internal successors, (4030), 5 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:19,840 INFO L175 Difference]: Start difference. First operand has 194 places, 331 transitions, 3515 flow. Second operand 4 states and 1350 transitions. [2023-08-25 20:35:19,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 557 transitions, 6993 flow [2023-08-25 20:35:20,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 557 transitions, 6845 flow, removed 44 selfloop flow, removed 9 redundant places. [2023-08-25 20:35:20,685 INFO L231 Difference]: Finished difference. Result has 190 places, 377 transitions, 4353 flow [2023-08-25 20:35:20,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=3397, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4353, PETRI_PLACES=190, PETRI_TRANSITIONS=377} [2023-08-25 20:35:20,685 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 70 predicate places. [2023-08-25 20:35:20,686 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 377 transitions, 4353 flow [2023-08-25 20:35:20,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 327.75) internal successors, (1311), 4 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:20,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:35:20,686 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:35:20,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 20:35:20,686 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:35:20,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:35:20,687 INFO L85 PathProgramCache]: Analyzing trace with hash 952197668, now seen corresponding path program 1 times [2023-08-25 20:35:20,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:35:20,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388258462] [2023-08-25 20:35:20,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:35:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:35:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:35:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 20:35:20,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:35:20,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388258462] [2023-08-25 20:35:20,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388258462] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 20:35:20,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47386092] [2023-08-25 20:35:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:35:20,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:35:20,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:35:20,903 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 20:35:20,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 20:35:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:35:21,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-25 20:35:21,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 20:35:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 20:35:21,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 20:35:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 20:35:21,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47386092] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 20:35:21,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 20:35:21,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-25 20:35:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137601519] [2023-08-25 20:35:21,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 20:35:21,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 20:35:21,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:35:21,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 20:35:21,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-08-25 20:35:21,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 806 [2023-08-25 20:35:21,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 377 transitions, 4353 flow. Second operand has 13 states, 13 states have (on average 272.6923076923077) internal successors, (3545), 13 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 20:35:21,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:35:21,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 806 [2023-08-25 20:35:21,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:35:27,760 INFO L124 PetriNetUnfolderBase]: 17449/34737 cut-off events. [2023-08-25 20:35:27,760 INFO L125 PetriNetUnfolderBase]: For 240162/240713 co-relation queries the response was YES. [2023-08-25 20:35:28,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152329 conditions, 34737 events. 17449/34737 cut-off events. For 240162/240713 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 288054 event pairs, 10961 based on Foata normal form. 194/34679 useless extension candidates. Maximal degree in co-relation 152268. Up to 24350 conditions per place. [2023-08-25 20:35:28,135 INFO L140 encePairwiseOnDemand]: 799/806 looper letters, 343 selfloop transitions, 20 changer transitions 190/567 dead transitions. [2023-08-25 20:35:28,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 567 transitions, 7631 flow [2023-08-25 20:35:28,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 20:35:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 20:35:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2228 transitions. [2023-08-25 20:35:28,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3455334987593052 [2023-08-25 20:35:28,139 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2228 transitions. [2023-08-25 20:35:28,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2228 transitions. [2023-08-25 20:35:28,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:35:28,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2228 transitions. [2023-08-25 20:35:28,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 278.5) internal successors, (2228), 8 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:28,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 806.0) internal successors, (7254), 9 states have internal predecessors, (7254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:28,146 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 806.0) internal successors, (7254), 9 states have internal predecessors, (7254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:28,146 INFO L175 Difference]: Start difference. First operand has 190 places, 377 transitions, 4353 flow. Second operand 8 states and 2228 transitions. [2023-08-25 20:35:28,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 567 transitions, 7631 flow [2023-08-25 20:35:30,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 567 transitions, 7489 flow, removed 29 selfloop flow, removed 1 redundant places. [2023-08-25 20:35:30,621 INFO L231 Difference]: Finished difference. Result has 199 places, 336 transitions, 3811 flow [2023-08-25 20:35:30,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=3940, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3811, PETRI_PLACES=199, PETRI_TRANSITIONS=336} [2023-08-25 20:35:30,622 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 79 predicate places. [2023-08-25 20:35:30,622 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 336 transitions, 3811 flow [2023-08-25 20:35:30,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 272.6923076923077) internal successors, (3545), 13 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 20:35:30,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:35:30,622 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:35:30,630 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 20:35:30,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-25 20:35:30,828 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:35:30,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:35:30,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1695524578, now seen corresponding path program 2 times [2023-08-25 20:35:30,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:35:30,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020874875] [2023-08-25 20:35:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:35:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:35:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:35:31,329 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-25 20:35:31,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:35:31,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020874875] [2023-08-25 20:35:31,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020874875] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 20:35:31,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 20:35:31,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 20:35:31,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963741835] [2023-08-25 20:35:31,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 20:35:31,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 20:35:31,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:35:31,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 20:35:31,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-25 20:35:31,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 806 [2023-08-25 20:35:31,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 336 transitions, 3811 flow. Second operand has 6 states, 6 states have (on average 259.8333333333333) internal successors, (1559), 6 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:31,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:35:31,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 806 [2023-08-25 20:35:31,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:35:45,086 INFO L124 PetriNetUnfolderBase]: 45538/76991 cut-off events. [2023-08-25 20:35:45,086 INFO L125 PetriNetUnfolderBase]: For 486886/487703 co-relation queries the response was YES. [2023-08-25 20:35:45,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332883 conditions, 76991 events. 45538/76991 cut-off events. For 486886/487703 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 591425 event pairs, 11384 based on Foata normal form. 138/76677 useless extension candidates. Maximal degree in co-relation 332818. Up to 64477 conditions per place. [2023-08-25 20:35:46,129 INFO L140 encePairwiseOnDemand]: 798/806 looper letters, 317 selfloop transitions, 38 changer transitions 4/369 dead transitions. [2023-08-25 20:35:46,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 369 transitions, 4448 flow [2023-08-25 20:35:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 20:35:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 20:35:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1614 transitions. [2023-08-25 20:35:46,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3337468982630273 [2023-08-25 20:35:46,132 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1614 transitions. [2023-08-25 20:35:46,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1614 transitions. [2023-08-25 20:35:46,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:35:46,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1614 transitions. [2023-08-25 20:35:46,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:46,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:46,138 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:46,138 INFO L175 Difference]: Start difference. First operand has 199 places, 336 transitions, 3811 flow. Second operand 6 states and 1614 transitions. [2023-08-25 20:35:46,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 369 transitions, 4448 flow [2023-08-25 20:35:50,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 369 transitions, 4299 flow, removed 34 selfloop flow, removed 10 redundant places. [2023-08-25 20:35:50,799 INFO L231 Difference]: Finished difference. Result has 190 places, 303 transitions, 3360 flow [2023-08-25 20:35:50,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=3193, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3360, PETRI_PLACES=190, PETRI_TRANSITIONS=303} [2023-08-25 20:35:50,800 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 70 predicate places. [2023-08-25 20:35:50,800 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 303 transitions, 3360 flow [2023-08-25 20:35:50,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.8333333333333) internal successors, (1559), 6 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:35:50,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:35:50,800 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:35:50,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-25 20:35:50,800 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:35:50,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:35:50,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1491383471, now seen corresponding path program 5 times [2023-08-25 20:35:50,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:35:50,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42424503] [2023-08-25 20:35:50,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:35:50,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:35:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:35:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 20:35:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:35:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42424503] [2023-08-25 20:35:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42424503] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 20:35:50,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693466899] [2023-08-25 20:35:50,986 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-25 20:35:50,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:35:50,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:35:50,987 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 20:35:51,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-25 20:36:06,726 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-25 20:36:06,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 20:36:06,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-25 20:36:06,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 20:36:06,856 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-25 20:36:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 20:36:06,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 20:36:07,029 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-25 20:36:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 20:36:07,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693466899] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 20:36:07,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 20:36:07,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 11 [2023-08-25 20:36:07,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6097113] [2023-08-25 20:36:07,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 20:36:07,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 20:36:07,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 20:36:07,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 20:36:07,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-08-25 20:36:07,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 806 [2023-08-25 20:36:07,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 303 transitions, 3360 flow. Second operand has 12 states, 12 states have (on average 288.4166666666667) internal successors, (3461), 12 states have internal predecessors, (3461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:36:07,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 20:36:07,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 806 [2023-08-25 20:36:07,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 20:36:08,929 INFO L124 PetriNetUnfolderBase]: 4501/11573 cut-off events. [2023-08-25 20:36:08,929 INFO L125 PetriNetUnfolderBase]: For 66367/66779 co-relation queries the response was YES. [2023-08-25 20:36:08,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47738 conditions, 11573 events. 4501/11573 cut-off events. For 66367/66779 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 99478 event pairs, 2573 based on Foata normal form. 68/11138 useless extension candidates. Maximal degree in co-relation 47676. Up to 6156 conditions per place. [2023-08-25 20:36:09,011 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 140 selfloop transitions, 3 changer transitions 110/281 dead transitions. [2023-08-25 20:36:09,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 281 transitions, 3626 flow [2023-08-25 20:36:09,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 20:36:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 20:36:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2054 transitions. [2023-08-25 20:36:09,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3640552995391705 [2023-08-25 20:36:09,014 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2054 transitions. [2023-08-25 20:36:09,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2054 transitions. [2023-08-25 20:36:09,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 20:36:09,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2054 transitions. [2023-08-25 20:36:09,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 293.42857142857144) internal successors, (2054), 7 states have internal predecessors, (2054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:36:09,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 806.0) internal successors, (6448), 8 states have internal predecessors, (6448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:36:09,018 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 806.0) internal successors, (6448), 8 states have internal predecessors, (6448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:36:09,018 INFO L175 Difference]: Start difference. First operand has 190 places, 303 transitions, 3360 flow. Second operand 7 states and 2054 transitions. [2023-08-25 20:36:09,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 281 transitions, 3626 flow [2023-08-25 20:36:09,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 281 transitions, 3574 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-25 20:36:09,158 INFO L231 Difference]: Finished difference. Result has 183 places, 171 transitions, 1826 flow [2023-08-25 20:36:09,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1826, PETRI_PLACES=183, PETRI_TRANSITIONS=171} [2023-08-25 20:36:09,159 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 63 predicate places. [2023-08-25 20:36:09,159 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 171 transitions, 1826 flow [2023-08-25 20:36:09,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 288.4166666666667) internal successors, (3461), 12 states have internal predecessors, (3461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 20:36:09,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 20:36:09,160 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:36:09,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-25 20:36:09,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:36:09,370 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 20:36:09,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 20:36:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash 671756240, now seen corresponding path program 6 times [2023-08-25 20:36:09,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 20:36:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329313904] [2023-08-25 20:36:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 20:36:09,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 20:36:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 20:36:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 20:36:12,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 20:36:12,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329313904] [2023-08-25 20:36:12,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329313904] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 20:36:12,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652806812] [2023-08-25 20:36:12,444 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-25 20:36:12,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:36:12,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 20:36:12,445 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 20:36:12,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-25 20:36:12,984 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-25 20:36:12,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 20:36:12,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-25 20:36:12,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 20:36:13,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 20:36:13,218 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 14 treesize of output 16 [2023-08-25 20:36:13,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 20:36:13,282 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 14 treesize of output 16 [2023-08-25 20:36:15,315 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 20:36:15,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 20:36:15,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 20:36:15,319 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 20:36:15,334 INFO L322 Elim1Store]: treesize reduction 50, result has 19.4 percent of original size [2023-08-25 20:36:15,335 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 36 [2023-08-25 20:36:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 20:36:15,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 20:36:16,827 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:36:16,828 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 223 treesize of output 224 [2023-08-25 20:36:22,770 INFO L322 Elim1Store]: treesize reduction 158, result has 87.4 percent of original size [2023-08-25 20:36:22,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 9602 treesize of output 9265 [2023-08-25 20:36:23,300 INFO L217 Elim1Store]: Index analysis took 112 ms [2023-08-25 20:36:23,859 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:36:23,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 44 case distinctions, treesize of input 2583 treesize of output 2797 [2023-08-25 20:36:24,265 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:36:24,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 2240 treesize of output 2181 [2023-08-25 20:36:24,663 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:36:24,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1998 treesize of output 1899 [2023-08-25 20:36:25,047 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 20:36:25,048 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1770 treesize of output 1635 Received shutdown request... [2023-08-25 20:47:03,393 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 20:47:03,395 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 20:47:03,433 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-25 20:47:03,435 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONASSERT (119 of 120 remaining) [2023-08-25 20:47:03,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-25 20:47:03,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 20:47:03,636 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. [2023-08-25 20:47:03,637 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (118 of 120 remaining) [2023-08-25 20:47:03,637 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (117 of 120 remaining) [2023-08-25 20:47:03,637 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (116 of 120 remaining) [2023-08-25 20:47:03,637 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (115 of 120 remaining) [2023-08-25 20:47:03,637 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (114 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (113 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (112 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (111 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (110 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (109 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONDATA_RACE (108 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONDATA_RACE (107 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONDATA_RACE (106 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONDATA_RACE (105 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14ASSERT_VIOLATIONDATA_RACE (104 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15ASSERT_VIOLATIONDATA_RACE (103 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err16ASSERT_VIOLATIONDATA_RACE (102 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err21ASSERT_VIOLATIONDATA_RACE (101 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err22ASSERT_VIOLATIONDATA_RACE (100 of 120 remaining) [2023-08-25 20:47:03,638 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err17ASSERT_VIOLATIONDATA_RACE (99 of 120 remaining) [2023-08-25 20:47:03,639 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err18ASSERT_VIOLATIONDATA_RACE (98 of 120 remaining) [2023-08-25 20:47:03,639 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err19ASSERT_VIOLATIONDATA_RACE (97 of 120 remaining) [2023-08-25 20:47:03,639 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err20ASSERT_VIOLATIONDATA_RACE (96 of 120 remaining) [2023-08-25 20:47:03,639 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (95 of 120 remaining) [2023-08-25 20:47:03,639 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (94 of 120 remaining) [2023-08-25 20:47:03,639 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (93 of 120 remaining) [2023-08-25 20:47:03,639 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (92 of 120 remaining) [2023-08-25 20:47:03,639 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (91 of 120 remaining) [2023-08-25 20:47:03,639 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (90 of 120 remaining) [2023-08-25 20:47:03,639 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (89 of 120 remaining) [2023-08-25 20:47:03,639 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (88 of 120 remaining) [2023-08-25 20:47:03,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (87 of 120 remaining) [2023-08-25 20:47:03,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (86 of 120 remaining) [2023-08-25 20:47:03,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (85 of 120 remaining) [2023-08-25 20:47:03,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (84 of 120 remaining) [2023-08-25 20:47:03,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (83 of 120 remaining) [2023-08-25 20:47:03,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (82 of 120 remaining) [2023-08-25 20:47:03,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (81 of 120 remaining) [2023-08-25 20:47:03,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (80 of 120 remaining) [2023-08-25 20:47:03,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (79 of 120 remaining) [2023-08-25 20:47:03,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (78 of 120 remaining) [2023-08-25 20:47:03,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (77 of 120 remaining) [2023-08-25 20:47:03,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (76 of 120 remaining) [2023-08-25 20:47:03,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (75 of 120 remaining) [2023-08-25 20:47:03,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (74 of 120 remaining) [2023-08-25 20:47:03,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (73 of 120 remaining) [2023-08-25 20:47:03,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (72 of 120 remaining) [2023-08-25 20:47:03,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (71 of 120 remaining) [2023-08-25 20:47:03,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (70 of 120 remaining) [2023-08-25 20:47:03,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (69 of 120 remaining) [2023-08-25 20:47:03,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (68 of 120 remaining) [2023-08-25 20:47:03,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (67 of 120 remaining) [2023-08-25 20:47:03,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (66 of 120 remaining) [2023-08-25 20:47:03,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (65 of 120 remaining) [2023-08-25 20:47:03,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (64 of 120 remaining) [2023-08-25 20:47:03,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (63 of 120 remaining) [2023-08-25 20:47:03,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (62 of 120 remaining) [2023-08-25 20:47:03,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (61 of 120 remaining) [2023-08-25 20:47:03,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (60 of 120 remaining) [2023-08-25 20:47:03,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (59 of 120 remaining) [2023-08-25 20:47:03,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (58 of 120 remaining) [2023-08-25 20:47:03,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (57 of 120 remaining) [2023-08-25 20:47:03,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (56 of 120 remaining) [2023-08-25 20:47:03,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (55 of 120 remaining) [2023-08-25 20:47:03,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (54 of 120 remaining) [2023-08-25 20:47:03,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (53 of 120 remaining) [2023-08-25 20:47:03,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (52 of 120 remaining) [2023-08-25 20:47:03,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (51 of 120 remaining) [2023-08-25 20:47:03,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (50 of 120 remaining) [2023-08-25 20:47:03,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 120 remaining) [2023-08-25 20:47:03,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 120 remaining) [2023-08-25 20:47:03,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 120 remaining) [2023-08-25 20:47:03,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 120 remaining) [2023-08-25 20:47:03,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 120 remaining) [2023-08-25 20:47:03,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 120 remaining) [2023-08-25 20:47:03,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 120 remaining) [2023-08-25 20:47:03,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (42 of 120 remaining) [2023-08-25 20:47:03,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 120 remaining) [2023-08-25 20:47:03,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (40 of 120 remaining) [2023-08-25 20:47:03,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (39 of 120 remaining) [2023-08-25 20:47:03,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (38 of 120 remaining) [2023-08-25 20:47:03,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 120 remaining) [2023-08-25 20:47:03,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 120 remaining) [2023-08-25 20:47:03,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 120 remaining) [2023-08-25 20:47:03,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 120 remaining) [2023-08-25 20:47:03,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14ASSERT_VIOLATIONDATA_RACE (33 of 120 remaining) [2023-08-25 20:47:03,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15ASSERT_VIOLATIONDATA_RACE (32 of 120 remaining) [2023-08-25 20:47:03,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 120 remaining) [2023-08-25 20:47:03,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err21ASSERT_VIOLATIONDATA_RACE (30 of 120 remaining) [2023-08-25 20:47:03,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err22ASSERT_VIOLATIONDATA_RACE (29 of 120 remaining) [2023-08-25 20:47:03,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err17ASSERT_VIOLATIONDATA_RACE (28 of 120 remaining) [2023-08-25 20:47:03,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err18ASSERT_VIOLATIONDATA_RACE (27 of 120 remaining) [2023-08-25 20:47:03,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err19ASSERT_VIOLATIONDATA_RACE (26 of 120 remaining) [2023-08-25 20:47:03,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err20ASSERT_VIOLATIONDATA_RACE (25 of 120 remaining) [2023-08-25 20:47:03,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 120 remaining) [2023-08-25 20:47:03,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 120 remaining) [2023-08-25 20:47:03,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 120 remaining) [2023-08-25 20:47:03,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 120 remaining) [2023-08-25 20:47:03,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 120 remaining) [2023-08-25 20:47:03,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 120 remaining) [2023-08-25 20:47:03,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 120 remaining) [2023-08-25 20:47:03,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (17 of 120 remaining) [2023-08-25 20:47:03,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (16 of 120 remaining) [2023-08-25 20:47:03,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (15 of 120 remaining) [2023-08-25 20:47:03,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (14 of 120 remaining) [2023-08-25 20:47:03,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (13 of 120 remaining) [2023-08-25 20:47:03,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 120 remaining) [2023-08-25 20:47:03,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (11 of 120 remaining) [2023-08-25 20:47:03,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (10 of 120 remaining) [2023-08-25 20:47:03,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (9 of 120 remaining) [2023-08-25 20:47:03,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (8 of 120 remaining) [2023-08-25 20:47:03,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (7 of 120 remaining) [2023-08-25 20:47:03,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (6 of 120 remaining) [2023-08-25 20:47:03,646 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (5 of 120 remaining) [2023-08-25 20:47:03,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (4 of 120 remaining) [2023-08-25 20:47:03,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (3 of 120 remaining) [2023-08-25 20:47:03,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (2 of 120 remaining) [2023-08-25 20:47:03,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (1 of 120 remaining) [2023-08-25 20:47:03,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (0 of 120 remaining) [2023-08-25 20:47:03,647 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:47:03,652 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 20:47:03,653 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 20:47:03,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:47:03 BasicIcfg [2023-08-25 20:47:03,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 20:47:03,656 INFO L158 Benchmark]: Toolchain (without parser) took 809977.53ms. Allocated memory was 398.5MB in the beginning and 13.1GB in the end (delta: 12.7GB). Free memory was 374.9MB in the beginning and 5.6GB in the end (delta: -5.2GB). Peak memory consumption was 9.6GB. Max. memory is 16.0GB. [2023-08-25 20:47:03,656 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 398.5MB. Free memory was 376.1MB in the beginning and 376.0MB in the end (delta: 86.1kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 20:47:03,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.72ms. Allocated memory is still 398.5MB. Free memory was 374.4MB in the beginning and 361.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-25 20:47:03,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.51ms. Allocated memory is still 398.5MB. Free memory was 361.6MB in the beginning and 358.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 20:47:03,656 INFO L158 Benchmark]: Boogie Preprocessor took 65.28ms. Allocated memory is still 398.5MB. Free memory was 358.4MB in the beginning and 355.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 20:47:03,657 INFO L158 Benchmark]: RCFGBuilder took 1122.79ms. Allocated memory was 398.5MB in the beginning and 478.2MB in the end (delta: 79.7MB). Free memory was 355.3MB in the beginning and 427.6MB in the end (delta: -72.3MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. [2023-08-25 20:47:03,657 INFO L158 Benchmark]: TraceAbstraction took 808502.63ms. Allocated memory was 478.2MB in the beginning and 13.1GB in the end (delta: 12.6GB). Free memory was 426.6MB in the beginning and 5.6GB in the end (delta: -5.2GB). Peak memory consumption was 9.6GB. Max. memory is 16.0GB. [2023-08-25 20:47:03,658 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 398.5MB. Free memory was 376.1MB in the beginning and 376.0MB in the end (delta: 86.1kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 222.72ms. Allocated memory is still 398.5MB. Free memory was 374.4MB in the beginning and 361.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.51ms. Allocated memory is still 398.5MB. Free memory was 361.6MB in the beginning and 358.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 65.28ms. Allocated memory is still 398.5MB. Free memory was 358.4MB in the beginning and 355.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1122.79ms. Allocated memory was 398.5MB in the beginning and 478.2MB in the end (delta: 79.7MB). Free memory was 355.3MB in the beginning and 427.6MB in the end (delta: -72.3MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. * TraceAbstraction took 808502.63ms. Allocated memory was 478.2MB in the beginning and 13.1GB in the end (delta: 12.6GB). Free memory was 426.6MB in the beginning and 5.6GB in the end (delta: -5.2GB). Peak memory consumption was 9.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.8s, 357 PlacesBefore, 120 PlacesAfterwards, 366 TransitionsBefore, 119 TransitionsAfterwards, 11388 CoEnabledTransitionPairs, 9 FixpointIterations, 251 TrivialSequentialCompositions, 134 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 8 ConcurrentYvCompositions, 10 ChoiceCompositions, 429 TotalNumberOfCompositions, 60421 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19213, independent: 18167, independent conditional: 0, independent unconditional: 18167, dependent: 1046, dependent conditional: 0, dependent unconditional: 1046, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5528, independent: 5385, independent conditional: 0, independent unconditional: 5385, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 19213, independent: 12782, independent conditional: 0, independent unconditional: 12782, dependent: 903, dependent conditional: 0, dependent unconditional: 903, unknown: 5528, unknown conditional: 0, unknown unconditional: 5528] , Statistics on independence cache: Total cache size (in pairs): 701, Positive cache size: 618, Positive conditional cache size: 0, Positive unconditional cache size: 618, Negative cache size: 83, Negative conditional cache size: 0, Negative unconditional cache size: 83, 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 CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 79ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 482 locations, 120 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: 808.3s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 81.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.0s, HoareTripleCheckerStatistics: 83 mSolverCounterUnknown, 3064 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3064 mSDsluCounter, 1035 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 946 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7720 IncrementalHoareTripleChecker+Invalid, 8022 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 89 mSDtfsCounter, 7720 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 794 GetRequests, 568 SyntacticMatches, 5 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 27.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4353occurred in iteration=16, InterpolantAutomatonStates: 166, 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, 16.7s SatisfiabilityAnalysisTime, 39.3s InterpolantComputationTime, 1018 NumberOfCodeBlocks, 1018 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1305 ConstructedInterpolants, 86 QuantifiedInterpolants, 21798 SizeOfPredicates, 185 NumberOfNonLiveVariables, 2925 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 31 InterpolantComputations, 14 PerfectInterpolantSequences, 240/336 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