/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/goblint-regression/06-symbeq_06-tricky_address1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 17:18:06,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 17:18:06,597 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 17:18:06,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 17:18:06,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 17:18:06,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 17:18:06,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 17:18:06,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 17:18:06,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 17:18:06,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 17:18:06,644 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 17:18:06,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 17:18:06,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 17:18:06,646 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 17:18:06,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 17:18:06,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 17:18:06,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 17:18:06,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 17:18:06,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 17:18:06,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 17:18:06,648 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 17:18:06,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 17:18:06,649 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 17:18:06,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 17:18:06,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 17:18:06,650 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 17:18:06,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 17:18:06,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 17:18:06,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 17:18:06,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 17:18:06,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 17:18:06,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 17:18:06,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 17:18:06,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 17:18:06,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 17:18:06,653 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 17:18:06,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 17:18:07,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 17:18:07,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 17:18:07,005 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 17:18:07,006 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 17:18:07,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i [2023-08-25 17:18:08,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 17:18:08,489 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 17:18:08,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i [2023-08-25 17:18:08,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/196565e0d/e1b392dd190c4f4a93a8b8df32d4027e/FLAGa8b723f18 [2023-08-25 17:18:08,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/196565e0d/e1b392dd190c4f4a93a8b8df32d4027e [2023-08-25 17:18:08,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 17:18:08,543 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 17:18:08,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 17:18:08,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 17:18:08,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 17:18:08,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 05:18:08" (1/1) ... [2023-08-25 17:18:08,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157e06a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:08, skipping insertion in model container [2023-08-25 17:18:08,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 05:18:08" (1/1) ... [2023-08-25 17:18:08,611 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 17:18:09,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 17:18:09,042 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 17:18:09,071 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [249] [2023-08-25 17:18:09,072 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [249] [2023-08-25 17:18:09,078 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [741] [2023-08-25 17:18:09,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 17:18:09,166 INFO L206 MainTranslator]: Completed translation [2023-08-25 17:18:09,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09 WrapperNode [2023-08-25 17:18:09,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 17:18:09,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 17:18:09,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 17:18:09,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 17:18:09,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09" (1/1) ... [2023-08-25 17:18:09,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09" (1/1) ... [2023-08-25 17:18:09,238 INFO L138 Inliner]: procedures = 264, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2023-08-25 17:18:09,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 17:18:09,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 17:18:09,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 17:18:09,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 17:18:09,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09" (1/1) ... [2023-08-25 17:18:09,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09" (1/1) ... [2023-08-25 17:18:09,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09" (1/1) ... [2023-08-25 17:18:09,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09" (1/1) ... [2023-08-25 17:18:09,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09" (1/1) ... [2023-08-25 17:18:09,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09" (1/1) ... [2023-08-25 17:18:09,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09" (1/1) ... [2023-08-25 17:18:09,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09" (1/1) ... [2023-08-25 17:18:09,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 17:18:09,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 17:18:09,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 17:18:09,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 17:18:09,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09" (1/1) ... [2023-08-25 17:18:09,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 17:18:09,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:18:09,318 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 17:18:09,341 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 17:18:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 17:18:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 17:18:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 17:18:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 17:18:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-25 17:18:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 17:18:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-25 17:18:09,354 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-25 17:18:09,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 17:18:09,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 17:18:09,355 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 17:18:09,477 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 17:18:09,479 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 17:18:09,716 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 17:18:09,724 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 17:18:09,724 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-25 17:18:09,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 05:18:09 BoogieIcfgContainer [2023-08-25 17:18:09,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 17:18:09,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 17:18:09,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 17:18:09,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 17:18:09,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 05:18:08" (1/3) ... [2023-08-25 17:18:09,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cfee06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 05:18:09, skipping insertion in model container [2023-08-25 17:18:09,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:18:09" (2/3) ... [2023-08-25 17:18:09,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cfee06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 05:18:09, skipping insertion in model container [2023-08-25 17:18:09,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 05:18:09" (3/3) ... [2023-08-25 17:18:09,734 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.i [2023-08-25 17:18:09,750 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 17:18:09,750 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-08-25 17:18:09,750 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 17:18:09,835 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 17:18:09,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 99 transitions, 203 flow [2023-08-25 17:18:09,941 INFO L124 PetriNetUnfolderBase]: 4/98 cut-off events. [2023-08-25 17:18:09,941 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 17:18:09,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 98 events. 4/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-25 17:18:09,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 99 transitions, 203 flow [2023-08-25 17:18:09,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 98 transitions, 199 flow [2023-08-25 17:18:09,958 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 17:18:09,969 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 98 transitions, 199 flow [2023-08-25 17:18:09,973 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 98 transitions, 199 flow [2023-08-25 17:18:09,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 98 transitions, 199 flow [2023-08-25 17:18:10,013 INFO L124 PetriNetUnfolderBase]: 4/98 cut-off events. [2023-08-25 17:18:10,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 17:18:10,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 98 events. 4/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-25 17:18:10,016 INFO L119 LiptonReduction]: Number of co-enabled transitions 2088 [2023-08-25 17:18:11,838 INFO L134 LiptonReduction]: Checked pairs total: 8674 [2023-08-25 17:18:11,838 INFO L136 LiptonReduction]: Total number of compositions: 72 [2023-08-25 17:18:11,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 17:18:11,854 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;@ba3b4c2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 17:18:11,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-25 17:18:11,859 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 17:18:11,859 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-25 17:18:11,859 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 17:18:11,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:18:11,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:18:11,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:18:11,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:18:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash -909158832, now seen corresponding path program 1 times [2023-08-25 17:18:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:18:11,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207773639] [2023-08-25 17:18:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:18:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:18:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:18:12,143 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 17:18:12,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:18:12,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207773639] [2023-08-25 17:18:12,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207773639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:18:12,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:18:12,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 17:18:12,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132065612] [2023-08-25 17:18:12,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:18:12,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 17:18:12,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:18:12,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 17:18:12,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 17:18:12,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 171 [2023-08-25 17:18:12,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:12,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:18:12,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 171 [2023-08-25 17:18:12,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:18:12,276 INFO L124 PetriNetUnfolderBase]: 37/165 cut-off events. [2023-08-25 17:18:12,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 17:18:12,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 165 events. 37/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 626 event pairs, 36 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 244. Up to 89 conditions per place. [2023-08-25 17:18:12,278 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 15 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-25 17:18:12,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 111 flow [2023-08-25 17:18:12,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 17:18:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 17:18:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-08-25 17:18:12,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2023-08-25 17:18:12,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-08-25 17:18:12,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-08-25 17:18:12,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:18:12,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-08-25 17:18:12,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:12,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:12,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:12,302 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 75 flow. Second operand 3 states and 279 transitions. [2023-08-25 17:18:12,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 111 flow [2023-08-25 17:18:12,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 17:18:12,306 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 86 flow [2023-08-25 17:18:12,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-25 17:18:12,311 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-25 17:18:12,311 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 86 flow [2023-08-25 17:18:12,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:12,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:18:12,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:18:12,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 17:18:12,312 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:18:12,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:18:12,312 INFO L85 PathProgramCache]: Analyzing trace with hash 461640011, now seen corresponding path program 1 times [2023-08-25 17:18:12,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:18:12,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662754750] [2023-08-25 17:18:12,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:18:12,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:18:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:18:12,371 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 17:18:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:18:12,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662754750] [2023-08-25 17:18:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662754750] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:18:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152626061] [2023-08-25 17:18:12,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:18:12,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:18:12,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:18:12,375 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 17:18:12,383 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 17:18:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:18:12,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 17:18:12,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:18:12,508 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 17:18:12,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 17:18:12,525 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 17:18:12,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152626061] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 17:18:12,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 17:18:12,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-25 17:18:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903189603] [2023-08-25 17:18:12,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 17:18:12,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-25 17:18:12,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:18:12,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-25 17:18:12,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-25 17:18:12,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 171 [2023-08-25 17:18:12,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:12,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:18:12,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 171 [2023-08-25 17:18:12,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:18:12,596 INFO L124 PetriNetUnfolderBase]: 37/168 cut-off events. [2023-08-25 17:18:12,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 17:18:12,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 168 events. 37/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 626 event pairs, 36 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 263. Up to 89 conditions per place. [2023-08-25 17:18:12,598 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 15 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-08-25 17:18:12,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 138 flow [2023-08-25 17:18:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 17:18:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 17:18:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 545 transitions. [2023-08-25 17:18:12,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311890838206628 [2023-08-25 17:18:12,602 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 545 transitions. [2023-08-25 17:18:12,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 545 transitions. [2023-08-25 17:18:12,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:18:12,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 545 transitions. [2023-08-25 17:18:12,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:12,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:12,607 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:12,608 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 86 flow. Second operand 6 states and 545 transitions. [2023-08-25 17:18:12,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 138 flow [2023-08-25 17:18:12,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 134 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 17:18:12,609 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 118 flow [2023-08-25 17:18:12,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-25 17:18:12,610 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-25 17:18:12,610 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 118 flow [2023-08-25 17:18:12,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:12,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:18:12,611 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:18:12,625 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 17:18:12,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:18:12,818 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:18:12,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:18:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1407404646, now seen corresponding path program 2 times [2023-08-25 17:18:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:18:12,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052114446] [2023-08-25 17:18:12,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:18:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:18:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:18:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-25 17:18:13,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:18:13,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052114446] [2023-08-25 17:18:13,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052114446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:18:13,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:18:13,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 17:18:13,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544968635] [2023-08-25 17:18:13,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:18:13,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 17:18:13,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:18:13,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 17:18:13,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 17:18:13,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 171 [2023-08-25 17:18:13,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 61.833333333333336) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:13,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:18:13,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 171 [2023-08-25 17:18:13,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:18:13,443 INFO L124 PetriNetUnfolderBase]: 283/610 cut-off events. [2023-08-25 17:18:13,443 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 17:18:13,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 610 events. 283/610 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2584 event pairs, 147 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 1214. Up to 430 conditions per place. [2023-08-25 17:18:13,447 INFO L140 encePairwiseOnDemand]: 160/171 looper letters, 88 selfloop transitions, 22 changer transitions 0/110 dead transitions. [2023-08-25 17:18:13,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 110 transitions, 478 flow [2023-08-25 17:18:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 17:18:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 17:18:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 467 transitions. [2023-08-25 17:18:13,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551656920077973 [2023-08-25 17:18:13,450 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 467 transitions. [2023-08-25 17:18:13,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 467 transitions. [2023-08-25 17:18:13,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:18:13,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 467 transitions. [2023-08-25 17:18:13,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:13,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:13,454 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:13,454 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 118 flow. Second operand 6 states and 467 transitions. [2023-08-25 17:18:13,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 110 transitions, 478 flow [2023-08-25 17:18:13,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 110 transitions, 464 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-25 17:18:13,457 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 254 flow [2023-08-25 17:18:13,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2023-08-25 17:18:13,458 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2023-08-25 17:18:13,458 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 254 flow [2023-08-25 17:18:13,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.833333333333336) internal successors, (371), 6 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:13,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:18:13,459 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:18:13,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 17:18:13,459 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:18:13,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:18:13,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1537914768, now seen corresponding path program 1 times [2023-08-25 17:18:13,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:18:13,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839339670] [2023-08-25 17:18:13,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:18:13,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:18:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:18:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-25 17:18:13,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:18:13,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839339670] [2023-08-25 17:18:13,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839339670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:18:13,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:18:13,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 17:18:13,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288711382] [2023-08-25 17:18:13,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:18:13,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 17:18:13,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:18:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 17:18:13,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 17:18:13,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 171 [2023-08-25 17:18:13,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:13,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:18:13,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 171 [2023-08-25 17:18:13,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:18:14,015 INFO L124 PetriNetUnfolderBase]: 310/670 cut-off events. [2023-08-25 17:18:14,015 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2023-08-25 17:18:14,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1706 conditions, 670 events. 310/670 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2968 event pairs, 124 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 1675. Up to 502 conditions per place. [2023-08-25 17:18:14,021 INFO L140 encePairwiseOnDemand]: 160/171 looper letters, 101 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2023-08-25 17:18:14,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 127 transitions, 730 flow [2023-08-25 17:18:14,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 17:18:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 17:18:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2023-08-25 17:18:14,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48635477582846004 [2023-08-25 17:18:14,024 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 499 transitions. [2023-08-25 17:18:14,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 499 transitions. [2023-08-25 17:18:14,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:18:14,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 499 transitions. [2023-08-25 17:18:14,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:14,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:14,028 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:14,029 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 254 flow. Second operand 6 states and 499 transitions. [2023-08-25 17:18:14,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 127 transitions, 730 flow [2023-08-25 17:18:14,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 127 transitions, 730 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 17:18:14,037 INFO L231 Difference]: Finished difference. Result has 67 places, 82 transitions, 438 flow [2023-08-25 17:18:14,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=67, PETRI_TRANSITIONS=82} [2023-08-25 17:18:14,040 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 28 predicate places. [2023-08-25 17:18:14,040 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 82 transitions, 438 flow [2023-08-25 17:18:14,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:14,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:18:14,041 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:18:14,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 17:18:14,041 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:18:14,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:18:14,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1226470076, now seen corresponding path program 1 times [2023-08-25 17:18:14,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:18:14,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494424373] [2023-08-25 17:18:14,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:18:14,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:18:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:18:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:18:14,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:18:14,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494424373] [2023-08-25 17:18:14,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494424373] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:18:14,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732648351] [2023-08-25 17:18:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:18:14,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:18:14,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:18:14,134 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 17:18:14,136 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 17:18:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:18:14,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 17:18:14,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:18:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:18:14,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 17:18:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:18:14,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732648351] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 17:18:14,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 17:18:14,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-25 17:18:14,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779431838] [2023-08-25 17:18:14,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 17:18:14,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 17:18:14,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:18:14,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 17:18:14,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-25 17:18:14,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 171 [2023-08-25 17:18:14,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 82 transitions, 438 flow. Second operand has 13 states, 13 states have (on average 88.46153846153847) internal successors, (1150), 13 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:14,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:18:14,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 171 [2023-08-25 17:18:14,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:18:14,403 INFO L124 PetriNetUnfolderBase]: 124/387 cut-off events. [2023-08-25 17:18:14,404 INFO L125 PetriNetUnfolderBase]: For 240/247 co-relation queries the response was YES. [2023-08-25 17:18:14,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 387 events. 124/387 cut-off events. For 240/247 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1935 event pairs, 46 based on Foata normal form. 6/385 useless extension candidates. Maximal degree in co-relation 942. Up to 152 conditions per place. [2023-08-25 17:18:14,406 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 21 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-08-25 17:18:14,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 88 transitions, 538 flow [2023-08-25 17:18:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-25 17:18:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-25 17:18:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1076 transitions. [2023-08-25 17:18:14,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5243664717348928 [2023-08-25 17:18:14,410 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1076 transitions. [2023-08-25 17:18:14,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1076 transitions. [2023-08-25 17:18:14,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:18:14,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1076 transitions. [2023-08-25 17:18:14,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.66666666666667) internal successors, (1076), 12 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:14,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 171.0) internal successors, (2223), 13 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:14,417 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 171.0) internal successors, (2223), 13 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:14,418 INFO L175 Difference]: Start difference. First operand has 67 places, 82 transitions, 438 flow. Second operand 12 states and 1076 transitions. [2023-08-25 17:18:14,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 88 transitions, 538 flow [2023-08-25 17:18:14,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 88 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 17:18:14,424 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 522 flow [2023-08-25 17:18:14,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=522, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2023-08-25 17:18:14,426 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2023-08-25 17:18:14,426 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 522 flow [2023-08-25 17:18:14,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.46153846153847) internal successors, (1150), 13 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:14,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:18:14,427 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:18:14,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 17:18:14,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:18:14,633 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:18:14,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:18:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash 531476636, now seen corresponding path program 2 times [2023-08-25 17:18:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:18:14,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370363008] [2023-08-25 17:18:14,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:18:14,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:18:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:18:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:18:14,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:18:14,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370363008] [2023-08-25 17:18:14,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370363008] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:18:14,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:18:14,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 17:18:14,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597250187] [2023-08-25 17:18:14,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:18:14,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 17:18:14,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:18:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 17:18:14,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 17:18:14,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 171 [2023-08-25 17:18:14,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 60.833333333333336) internal successors, (365), 6 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:14,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:18:14,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 171 [2023-08-25 17:18:14,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:18:15,217 INFO L124 PetriNetUnfolderBase]: 364/788 cut-off events. [2023-08-25 17:18:15,217 INFO L125 PetriNetUnfolderBase]: For 582/582 co-relation queries the response was YES. [2023-08-25 17:18:15,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2426 conditions, 788 events. 364/788 cut-off events. For 582/582 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3624 event pairs, 145 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 2341. Up to 673 conditions per place. [2023-08-25 17:18:15,223 INFO L140 encePairwiseOnDemand]: 157/171 looper letters, 106 selfloop transitions, 49 changer transitions 8/163 dead transitions. [2023-08-25 17:18:15,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 163 transitions, 1144 flow [2023-08-25 17:18:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 17:18:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 17:18:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 453 transitions. [2023-08-25 17:18:15,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4415204678362573 [2023-08-25 17:18:15,225 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 453 transitions. [2023-08-25 17:18:15,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 453 transitions. [2023-08-25 17:18:15,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:18:15,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 453 transitions. [2023-08-25 17:18:15,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:15,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:15,228 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:15,228 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 522 flow. Second operand 6 states and 453 transitions. [2023-08-25 17:18:15,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 163 transitions, 1144 flow [2023-08-25 17:18:15,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 163 transitions, 1096 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-25 17:18:15,235 INFO L231 Difference]: Finished difference. Result has 88 places, 131 transitions, 869 flow [2023-08-25 17:18:15,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=88, PETRI_TRANSITIONS=131} [2023-08-25 17:18:15,236 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2023-08-25 17:18:15,236 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 131 transitions, 869 flow [2023-08-25 17:18:15,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.833333333333336) internal successors, (365), 6 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:15,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:18:15,237 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:18:15,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 17:18:15,237 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:18:15,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:18:15,237 INFO L85 PathProgramCache]: Analyzing trace with hash -62601877, now seen corresponding path program 1 times [2023-08-25 17:18:15,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:18:15,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056890573] [2023-08-25 17:18:15,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:18:15,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:18:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:18:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:18:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:18:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056890573] [2023-08-25 17:18:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056890573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:18:15,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:18:15,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 17:18:15,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597994370] [2023-08-25 17:18:15,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:18:15,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 17:18:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:18:15,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 17:18:15,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 17:18:15,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 171 [2023-08-25 17:18:15,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 131 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 66.83333333333333) internal successors, (401), 6 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:15,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:18:15,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 171 [2023-08-25 17:18:15,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:18:15,819 INFO L124 PetriNetUnfolderBase]: 436/937 cut-off events. [2023-08-25 17:18:15,819 INFO L125 PetriNetUnfolderBase]: For 1164/1164 co-relation queries the response was YES. [2023-08-25 17:18:15,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 937 events. 436/937 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4566 event pairs, 126 based on Foata normal form. 0/888 useless extension candidates. Maximal degree in co-relation 3266. Up to 761 conditions per place. [2023-08-25 17:18:15,827 INFO L140 encePairwiseOnDemand]: 156/171 looper letters, 141 selfloop transitions, 58 changer transitions 16/215 dead transitions. [2023-08-25 17:18:15,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 215 transitions, 1710 flow [2023-08-25 17:18:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 17:18:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 17:18:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 490 transitions. [2023-08-25 17:18:15,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775828460038986 [2023-08-25 17:18:15,829 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 490 transitions. [2023-08-25 17:18:15,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 490 transitions. [2023-08-25 17:18:15,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:18:15,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 490 transitions. [2023-08-25 17:18:15,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:15,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:15,833 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:15,833 INFO L175 Difference]: Start difference. First operand has 88 places, 131 transitions, 869 flow. Second operand 6 states and 490 transitions. [2023-08-25 17:18:15,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 215 transitions, 1710 flow [2023-08-25 17:18:15,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 215 transitions, 1646 flow, removed 32 selfloop flow, removed 0 redundant places. [2023-08-25 17:18:15,845 INFO L231 Difference]: Finished difference. Result has 98 places, 175 transitions, 1341 flow [2023-08-25 17:18:15,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1341, PETRI_PLACES=98, PETRI_TRANSITIONS=175} [2023-08-25 17:18:15,846 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2023-08-25 17:18:15,846 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 175 transitions, 1341 flow [2023-08-25 17:18:15,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.83333333333333) internal successors, (401), 6 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:15,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:18:15,847 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:18:15,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 17:18:15,847 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:18:15,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:18:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash -488170001, now seen corresponding path program 1 times [2023-08-25 17:18:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:18:15,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083870754] [2023-08-25 17:18:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:18:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:18:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:18:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:18:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:18:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083870754] [2023-08-25 17:18:20,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083870754] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:18:20,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615407436] [2023-08-25 17:18:20,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:18:20,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:18:20,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:18:20,810 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 17:18:20,813 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 17:18:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:18:20,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-25 17:18:20,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:18:21,157 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 16 treesize of output 12 [2023-08-25 17:18:21,210 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-25 17:18:21,210 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 22 treesize of output 15 [2023-08-25 17:18:21,289 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 17:18:21,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,341 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 24 treesize of output 23 [2023-08-25 17:18:21,364 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 21 treesize of output 20 [2023-08-25 17:18:21,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-25 17:18:21,469 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-25 17:18:21,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2023-08-25 17:18:21,585 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-25 17:18:21,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:18:21,833 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 17:18:21,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 98 treesize of output 115 [2023-08-25 17:18:44,092 WARN L234 SmtUtils]: Spent 14.07s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 17:18:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 17:18:44,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 17:18:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:18:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615407436] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 17:18:59,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 17:18:59,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [19, 16] total 45 [2023-08-25 17:18:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576332986] [2023-08-25 17:18:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:18:59,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 17:18:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:18:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 17:18:59,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1834, Unknown=4, NotChecked=0, Total=2070 [2023-08-25 17:18:59,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:18:59,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 175 transitions, 1341 flow. Second operand has 13 states, 13 states have (on average 57.53846153846154) internal successors, (748), 13 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:18:59,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:18:59,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:18:59,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:19:09,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:19:16,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:19:25,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:19:29,561 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))) (let ((.cse33 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4 0))) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse14 (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| |c_~#a~0.base|))) (.cse13 (select |c_#race| |c_~#a~0.base|)) (.cse7 (+ .cse0 |c_~#a~0.offset| 1)) (.cse3 (+ .cse0 |c_~#a~0.offset|)) (.cse9 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse5 (+ .cse0 3 |c_~#a~0.offset|)) (.cse12 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) (.cse34 (select .cse33 |c_~#a~0.base|)) (.cse6 (+ .cse0 2 |c_~#a~0.offset|))) (and (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse1 (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#race| |c_~#a~0.base| (store .cse13 .cse6 v_ArrVal_359)))) (store .cse11 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12 0))))) (store .cse10 |c_~#a~0.base| (store (select .cse10 |c_~#a~0.base|) .cse5 v_ArrVal_362))))) (store .cse8 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9 0))))) (let ((.cse2 (select .cse1 |c_~#a~0.base|))) (or (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse1 |c_~#a~0.base| (store .cse2 .cse3 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0)) (not (= (select .cse2 .cse5) 0)) (not (= (select .cse2 .cse6) 0)) (not (= (select .cse2 .cse7) 0)))))) (or (not (= .cse3 .cse4)) .cse14) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse16 (let ((.cse17 (let ((.cse18 (let ((.cse19 (store |c_#race| |c_~#a~0.base| (store .cse13 .cse6 v_ArrVal_359)))) (store .cse19 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse19 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12 0))))) (store .cse18 |c_~#a~0.base| (store (select .cse18 |c_~#a~0.base|) .cse5 v_ArrVal_362))))) (store .cse17 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse17 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9 0))))) (let ((.cse15 (select .cse16 |c_~#a~0.base|))) (or (not (= (select .cse15 .cse5) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse16 |c_~#a~0.base| (store .cse15 .cse3 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9) 0)) (not (= (select .cse15 .cse6) 0)) (not (= (select .cse15 .cse7) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse21 (let ((.cse22 (let ((.cse23 (let ((.cse24 (store |c_#race| |c_~#a~0.base| (store .cse13 .cse6 v_ArrVal_359)))) (store .cse24 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse24 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12 0))))) (store .cse23 |c_~#a~0.base| (store (select .cse23 |c_~#a~0.base|) .cse5 v_ArrVal_362))))) (store .cse22 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse22 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9 0))))) (let ((.cse20 (select .cse21 |c_~#a~0.base|))) (or (not (= (select .cse20 .cse5) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse21 |c_~#a~0.base| (store .cse20 .cse3 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12) 0)) (not (= (select .cse20 .cse6) 0)) (not (= (select .cse20 .cse7) 0)))))) (or .cse14 (not (= |c_t_funThread1of1ForFork0_~p~0#1.offset| .cse3))) (forall ((v_ArrVal_362 Int)) (let ((.cse26 (let ((.cse27 (store |c_#race| |c_~#a~0.base| (store .cse13 .cse5 v_ArrVal_362)))) (store .cse27 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse27 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9 0))))) (let ((.cse25 (select .cse26 |c_~#a~0.base|))) (or (not (= (select .cse25 .cse5) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse26 |c_~#a~0.base| (store .cse25 .cse3 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9) 0)) (not (= (select .cse25 .cse7) 0)) (not (= (select .cse25 .cse6) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse29 (let ((.cse30 (let ((.cse31 (let ((.cse32 (store .cse33 |c_~#a~0.base| (store .cse34 .cse6 v_ArrVal_359)))) (store .cse32 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse32 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12 0))))) (store .cse31 |c_~#a~0.base| (store (select .cse31 |c_~#a~0.base|) .cse5 v_ArrVal_362))))) (store .cse30 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse30 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9 0))))) (let ((.cse28 (select .cse29 |c_~#a~0.base|))) (or (not (= (select .cse28 .cse7) 0)) (forall ((v_ArrVal_367 Int)) (= 0 (select (select (store .cse29 |c_~#a~0.base| (store .cse28 .cse3 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9))) (not (= (select .cse28 .cse6) 0)) (not (= (select .cse28 .cse5) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse36 (let ((.cse37 (store |c_#race| |c_~#a~0.base| (store .cse13 .cse5 v_ArrVal_362)))) (store .cse37 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse37 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9 0))))) (let ((.cse35 (select .cse36 |c_~#a~0.base|))) (or (not (= (select .cse35 .cse5) 0)) (not (= (select .cse35 .cse7) 0)) (not (= (select .cse35 .cse6) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse36 |c_~#a~0.base| (store .cse35 .cse3 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) (or (not (= .cse3 .cse12)) .cse14) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse39 (let ((.cse40 (let ((.cse41 (let ((.cse42 (store .cse33 |c_~#a~0.base| (store .cse34 .cse6 v_ArrVal_359)))) (store .cse42 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse42 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12 0))))) (store .cse41 |c_~#a~0.base| (store (select .cse41 |c_~#a~0.base|) .cse5 v_ArrVal_362))))) (store .cse40 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse40 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9 0))))) (let ((.cse38 (select .cse39 |c_~#a~0.base|))) (or (not (= (select .cse38 .cse7) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse39 |c_~#a~0.base| (store .cse38 .cse3 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12) 0)) (not (= (select .cse38 .cse6) 0)) (not (= (select .cse38 .cse5) 0)))))) (or (not (= .cse3 .cse9)) .cse14) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse44 (let ((.cse45 (let ((.cse46 (let ((.cse47 (store |c_#race| |c_~#a~0.base| (store .cse13 .cse6 v_ArrVal_359)))) (store .cse47 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse47 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12 0))))) (store .cse46 |c_~#a~0.base| (store (select .cse46 |c_~#a~0.base|) .cse5 v_ArrVal_362))))) (store .cse45 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse45 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9 0))))) (let ((.cse43 (select .cse44 |c_~#a~0.base|))) (or (not (= (select .cse43 .cse5) 0)) (not (= (select .cse43 .cse6) 0)) (not (= (select .cse43 .cse7) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse44 |c_~#a~0.base| (store .cse43 .cse3 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse49 (let ((.cse50 (store |c_#race| |c_~#a~0.base| (store .cse13 .cse5 v_ArrVal_362)))) (store .cse50 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse50 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9 0))))) (let ((.cse48 (select .cse49 |c_~#a~0.base|))) (or (not (= (select .cse48 .cse5) 0)) (not (= (select .cse48 .cse7) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse49 |c_~#a~0.base| (store .cse48 .cse3 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0)) (not (= (select .cse48 .cse6) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse52 (let ((.cse53 (store |c_#race| |c_~#a~0.base| (store .cse13 .cse5 v_ArrVal_362)))) (store .cse53 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse53 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9 0))))) (let ((.cse51 (select .cse52 |c_~#a~0.base|))) (or (not (= (select .cse51 .cse5) 0)) (not (= (select .cse51 .cse7) 0)) (not (= (select .cse51 .cse6) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse52 |c_~#a~0.base| (store .cse51 .cse3 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse54 (let ((.cse56 (let ((.cse57 (let ((.cse58 (store .cse33 |c_~#a~0.base| (store .cse34 .cse6 v_ArrVal_359)))) (store .cse58 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse58 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12 0))))) (store .cse57 |c_~#a~0.base| (store (select .cse57 |c_~#a~0.base|) .cse5 v_ArrVal_362))))) (store .cse56 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse56 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9 0))))) (let ((.cse55 (select .cse54 |c_~#a~0.base|))) (or (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse54 |c_~#a~0.base| (store .cse55 .cse3 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse4) 0)) (not (= (select .cse55 .cse7) 0)) (not (= (select .cse55 .cse6) 0)) (not (= (select .cse55 .cse5) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse60 (let ((.cse61 (let ((.cse62 (let ((.cse63 (store .cse33 |c_~#a~0.base| (store .cse34 .cse6 v_ArrVal_359)))) (store .cse63 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse63 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12 0))))) (store .cse62 |c_~#a~0.base| (store (select .cse62 |c_~#a~0.base|) .cse5 v_ArrVal_362))))) (store .cse61 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse61 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse9 0))))) (let ((.cse59 (select .cse60 |c_~#a~0.base|))) (or (not (= (select .cse59 .cse7) 0)) (forall ((v_ArrVal_367 Int)) (= 0 (select (select (store .cse60 |c_~#a~0.base| (store .cse59 .cse3 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (not (= (select .cse59 .cse6) 0)) (not (= (select .cse59 .cse5) 0)))))))))) is different from true [2023-08-25 17:19:34,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:19:36,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:19:47,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:19:56,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:19:58,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:19:59,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:20:06,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:20:09,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:20:20,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:20:28,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:20:51,376 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse15 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse13 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse1 (+ .cse15 |c_~#a~0.offset| 1)) (.cse3 (+ .cse15 2 |c_~#a~0.offset|)) (.cse5 (+ .cse15 |c_~#a~0.offset|)) (.cse6 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) (.cse8 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse14 (select |c_#race| |c_~#a~0.base|)) (.cse2 (+ .cse15 3 |c_~#a~0.offset|))) (and (forall ((v_ArrVal_354 Int) (v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse4 (let ((.cse7 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse1 v_ArrVal_354)))) (store .cse12 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse12 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse11 |c_~#a~0.base| (store (select .cse11 |c_~#a~0.base|) .cse3 v_ArrVal_359))))) (store .cse10 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse9 |c_~#a~0.base| (store (select .cse9 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse0 (select .cse4 |c_~#a~0.base|))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (not (= 0 (select .cse0 .cse3))) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse4 |c_~#a~0.base| (store .cse0 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)))))) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse15 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse16 (let ((.cse18 (let ((.cse19 (let ((.cse20 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse3 v_ArrVal_359)))) (store .cse20 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse20 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse19 |c_~#a~0.base| (store (select .cse19 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse18 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse18 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse17 (select .cse16 |c_~#a~0.base|))) (or (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse16 |c_~#a~0.base| (store .cse17 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)) (not (= (select .cse17 .cse2) 0)) (not (= (select .cse17 .cse3) 0)) (not (= (select .cse17 .cse1) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse22 (let ((.cse23 (let ((.cse24 (let ((.cse25 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse3 v_ArrVal_359)))) (store .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse24 |c_~#a~0.base| (store (select .cse24 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse23 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse23 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse21 (select .cse22 |c_~#a~0.base|))) (or (not (= (select .cse21 .cse2) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse22 |c_~#a~0.base| (store .cse21 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse21 .cse3) 0)) (not (= (select .cse21 .cse1) 0)))))) (forall ((v_ArrVal_354 Int) (v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse27 (let ((.cse28 (let ((.cse29 (let ((.cse30 (let ((.cse31 (let ((.cse32 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse1 v_ArrVal_354)))) (store .cse32 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse32 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse31 |c_~#a~0.base| (store (select .cse31 |c_~#a~0.base|) .cse3 v_ArrVal_359))))) (store .cse30 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse30 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse29 |c_~#a~0.base| (store (select .cse29 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse26 (select .cse27 |c_~#a~0.base|))) (or (not (= (select .cse26 .cse1) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse27 |c_~#a~0.base| (store .cse26 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse26 .cse2) 0)) (not (= 0 (select .cse26 .cse3))))))) (forall ((v_ArrVal_354 Int) (v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (let ((.cse39 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse1 v_ArrVal_354)))) (store .cse39 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse39 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse38 |c_~#a~0.base| (store (select .cse38 |c_~#a~0.base|) .cse3 v_ArrVal_359))))) (store .cse37 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse37 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse36 |c_~#a~0.base| (store (select .cse36 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse35 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse35 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse33 (select .cse34 |c_~#a~0.base|))) (or (not (= (select .cse33 .cse1) 0)) (not (= (select .cse33 .cse2) 0)) (not (= 0 (select .cse33 .cse3))) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse34 |c_~#a~0.base| (store .cse33 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse41 (let ((.cse42 (let ((.cse43 (let ((.cse44 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse3 v_ArrVal_359)))) (store .cse44 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse44 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse43 |c_~#a~0.base| (store (select .cse43 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse42 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse42 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse40 (select .cse41 |c_~#a~0.base|))) (or (not (= (select .cse40 .cse2) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse41 |c_~#a~0.base| (store .cse40 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)) (not (= (select .cse40 .cse3) 0)) (not (= (select .cse40 .cse1) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse46 (let ((.cse47 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse2 v_ArrVal_362)))) (store .cse47 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse47 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse45 (select .cse46 |c_~#a~0.base|))) (or (not (= (select .cse45 .cse2) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse46 |c_~#a~0.base| (store .cse45 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse45 .cse1) 0)) (not (= (select .cse45 .cse3) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse49 (let ((.cse50 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse2 v_ArrVal_362)))) (store .cse50 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse50 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse48 (select .cse49 |c_~#a~0.base|))) (or (not (= (select .cse48 .cse2) 0)) (not (= (select .cse48 .cse1) 0)) (not (= (select .cse48 .cse3) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse49 |c_~#a~0.base| (store .cse48 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) (forall ((v_ArrVal_354 Int) (v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse52 (let ((.cse53 (let ((.cse54 (let ((.cse55 (let ((.cse56 (let ((.cse57 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse1 v_ArrVal_354)))) (store .cse57 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse57 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse56 |c_~#a~0.base| (store (select .cse56 |c_~#a~0.base|) .cse3 v_ArrVal_359))))) (store .cse55 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse55 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse54 |c_~#a~0.base| (store (select .cse54 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse53 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse53 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse51 (select .cse52 |c_~#a~0.base|))) (or (not (= (select .cse51 .cse1) 0)) (not (= (select .cse51 .cse2) 0)) (not (= 0 (select .cse51 .cse3))) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse52 |c_~#a~0.base| (store .cse51 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse59 (let ((.cse60 (let ((.cse61 (let ((.cse62 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse3 v_ArrVal_359)))) (store .cse62 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse62 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse61 |c_~#a~0.base| (store (select .cse61 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse60 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse60 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse58 (select .cse59 |c_~#a~0.base|))) (or (not (= (select .cse58 .cse2) 0)) (not (= (select .cse58 .cse3) 0)) (not (= (select .cse58 .cse1) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse59 |c_~#a~0.base| (store .cse58 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse64 (let ((.cse65 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse2 v_ArrVal_362)))) (store .cse65 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse65 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse63 (select .cse64 |c_~#a~0.base|))) (or (not (= (select .cse63 .cse2) 0)) (not (= (select .cse63 .cse1) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse64 |c_~#a~0.base| (store .cse63 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)) (not (= (select .cse63 .cse3) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse67 (let ((.cse68 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse2 v_ArrVal_362)))) (store .cse68 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse68 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse66 (select .cse67 |c_~#a~0.base|))) (or (not (= (select .cse66 .cse2) 0)) (not (= (select .cse66 .cse1) 0)) (not (= (select .cse66 .cse3) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse67 |c_~#a~0.base| (store .cse66 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0))))))))) is different from true [2023-08-25 17:20:56,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:20:58,819 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse56 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse13 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse1 (+ .cse56 |c_~#a~0.offset| 1)) (.cse5 (+ .cse56 |c_~#a~0.offset|)) (.cse8 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse2 (+ .cse56 3 |c_~#a~0.offset|)) (.cse6 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) (.cse14 (select |c_#race| |c_~#a~0.base|)) (.cse3 (+ .cse56 2 |c_~#a~0.offset|))) (and (forall ((v_ArrVal_354 Int) (v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse4 (let ((.cse7 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse1 v_ArrVal_354)))) (store .cse12 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse12 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse11 |c_~#a~0.base| (store (select .cse11 |c_~#a~0.base|) .cse3 v_ArrVal_359))))) (store .cse10 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse9 |c_~#a~0.base| (store (select .cse9 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse0 (select .cse4 |c_~#a~0.base|))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (not (= 0 (select .cse0 .cse3))) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse4 |c_~#a~0.base| (store .cse0 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse15 (let ((.cse17 (let ((.cse18 (let ((.cse19 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse3 v_ArrVal_359)))) (store .cse19 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse19 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse18 |c_~#a~0.base| (store (select .cse18 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse17 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse17 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse16 (select .cse15 |c_~#a~0.base|))) (or (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse15 |c_~#a~0.base| (store .cse16 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)) (not (= (select .cse16 .cse2) 0)) (not (= (select .cse16 .cse3) 0)) (not (= (select .cse16 .cse1) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse21 (let ((.cse22 (let ((.cse23 (let ((.cse24 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse3 v_ArrVal_359)))) (store .cse24 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse24 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse23 |c_~#a~0.base| (store (select .cse23 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse22 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse22 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse20 (select .cse21 |c_~#a~0.base|))) (or (not (= (select .cse20 .cse2) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse21 |c_~#a~0.base| (store .cse20 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse20 .cse3) 0)) (not (= (select .cse20 .cse1) 0)))))) (forall ((v_ArrVal_354 Int) (v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse26 (let ((.cse27 (let ((.cse28 (let ((.cse29 (let ((.cse30 (let ((.cse31 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse1 v_ArrVal_354)))) (store .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse30 |c_~#a~0.base| (store (select .cse30 |c_~#a~0.base|) .cse3 v_ArrVal_359))))) (store .cse29 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse29 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse28 |c_~#a~0.base| (store (select .cse28 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse27 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse27 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse25 (select .cse26 |c_~#a~0.base|))) (or (not (= (select .cse25 .cse1) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse26 |c_~#a~0.base| (store .cse25 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse25 .cse2) 0)) (not (= 0 (select .cse25 .cse3))))))) (forall ((v_ArrVal_354 Int) (v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse33 (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse1 v_ArrVal_354)))) (store .cse38 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse38 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse37 |c_~#a~0.base| (store (select .cse37 |c_~#a~0.base|) .cse3 v_ArrVal_359))))) (store .cse36 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse36 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse35 |c_~#a~0.base| (store (select .cse35 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse34 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse34 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse32 (select .cse33 |c_~#a~0.base|))) (or (not (= (select .cse32 .cse1) 0)) (not (= (select .cse32 .cse2) 0)) (not (= 0 (select .cse32 .cse3))) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse33 |c_~#a~0.base| (store .cse32 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse40 (let ((.cse41 (let ((.cse42 (let ((.cse43 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse3 v_ArrVal_359)))) (store .cse43 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse43 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse42 |c_~#a~0.base| (store (select .cse42 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse41 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse41 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse39 (select .cse40 |c_~#a~0.base|))) (or (not (= (select .cse39 .cse2) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse40 |c_~#a~0.base| (store .cse39 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)) (not (= (select .cse39 .cse3) 0)) (not (= (select .cse39 .cse1) 0)))))) (forall ((v_ArrVal_354 Int) (v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse45 (let ((.cse46 (let ((.cse47 (let ((.cse48 (let ((.cse49 (let ((.cse50 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse1 v_ArrVal_354)))) (store .cse50 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse50 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse49 |c_~#a~0.base| (store (select .cse49 |c_~#a~0.base|) .cse3 v_ArrVal_359))))) (store .cse48 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse48 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse47 |c_~#a~0.base| (store (select .cse47 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse46 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse46 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse44 (select .cse45 |c_~#a~0.base|))) (or (not (= (select .cse44 .cse1) 0)) (not (= (select .cse44 .cse2) 0)) (not (= 0 (select .cse44 .cse3))) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse45 |c_~#a~0.base| (store .cse44 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse52 (let ((.cse53 (let ((.cse54 (let ((.cse55 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse3 v_ArrVal_359)))) (store .cse55 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse55 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse54 |c_~#a~0.base| (store (select .cse54 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse53 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse53 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse51 (select .cse52 |c_~#a~0.base|))) (or (not (= (select .cse51 .cse2) 0)) (not (= (select .cse51 .cse3) 0)) (not (= (select .cse51 .cse1) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse52 |c_~#a~0.base| (store .cse51 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))))))))) is different from true [2023-08-25 17:21:18,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:21:21,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:21:27,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:21:40,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:21:49,606 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))) (let ((.cse32 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse3 0))) (.cse63 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse13 (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| |c_~#a~0.base|))) (.cse12 (select |c_#race| |c_~#a~0.base|)) (.cse6 (+ .cse63 |c_~#a~0.offset| 1)) (.cse2 (+ .cse63 |c_~#a~0.offset|)) (.cse8 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse4 (+ .cse63 3 |c_~#a~0.offset|)) (.cse11 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) (.cse33 (select .cse32 |c_~#a~0.base|)) (.cse5 (+ .cse63 2 |c_~#a~0.offset|))) (and (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse0 (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_~#a~0.base| (store .cse12 .cse5 v_ArrVal_359)))) (store .cse10 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11 0))))) (store .cse9 |c_~#a~0.base| (store (select .cse9 |c_~#a~0.base|) .cse4 v_ArrVal_362))))) (store .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (or (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse0 |c_~#a~0.base| (store .cse1 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse3) 0)) (not (= (select .cse1 .cse4) 0)) (not (= (select .cse1 .cse5) 0)) (not (= (select .cse1 .cse6) 0)))))) (or (and (forall ((v_ArrVal_367 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse12 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse12 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse12 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse12 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))) (not (= (select .cse12 .cse6) 0)) (not (= (select .cse12 .cse5) 0)) (not (= (select .cse12 .cse4) 0))) (or (not (= .cse2 .cse3)) .cse13) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#race| |c_~#a~0.base| (store .cse12 .cse5 v_ArrVal_359)))) (store .cse18 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse18 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11 0))))) (store .cse17 |c_~#a~0.base| (store (select .cse17 |c_~#a~0.base|) .cse4 v_ArrVal_362))))) (store .cse16 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse16 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse14 (select .cse15 |c_~#a~0.base|))) (or (not (= (select .cse14 .cse4) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse15 |c_~#a~0.base| (store .cse14 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse14 .cse5) 0)) (not (= (select .cse14 .cse6) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store |c_#race| |c_~#a~0.base| (store .cse12 .cse5 v_ArrVal_359)))) (store .cse23 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse23 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11 0))))) (store .cse22 |c_~#a~0.base| (store (select .cse22 |c_~#a~0.base|) .cse4 v_ArrVal_362))))) (store .cse21 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse19 (select .cse20 |c_~#a~0.base|))) (or (not (= (select .cse19 .cse4) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse20 |c_~#a~0.base| (store .cse19 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11) 0)) (not (= (select .cse19 .cse5) 0)) (not (= (select .cse19 .cse6) 0)))))) (or .cse13 (not (= |c_t_funThread1of1ForFork0_~p~0#1.offset| .cse2))) (forall ((v_ArrVal_362 Int)) (let ((.cse25 (let ((.cse26 (store |c_#race| |c_~#a~0.base| (store .cse12 .cse4 v_ArrVal_362)))) (store .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse24 (select .cse25 |c_~#a~0.base|))) (or (not (= (select .cse24 .cse4) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse25 |c_~#a~0.base| (store .cse24 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse24 .cse6) 0)) (not (= (select .cse24 .cse5) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse28 (let ((.cse29 (let ((.cse30 (let ((.cse31 (store .cse32 |c_~#a~0.base| (store .cse33 .cse5 v_ArrVal_359)))) (store .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse31 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11 0))))) (store .cse30 |c_~#a~0.base| (store (select .cse30 |c_~#a~0.base|) .cse4 v_ArrVal_362))))) (store .cse29 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse29 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse27 (select .cse28 |c_~#a~0.base|))) (or (not (= (select .cse27 .cse6) 0)) (forall ((v_ArrVal_367 Int)) (= 0 (select (select (store .cse28 |c_~#a~0.base| (store .cse27 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8))) (not (= (select .cse27 .cse5) 0)) (not (= (select .cse27 .cse4) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse35 (let ((.cse36 (store |c_#race| |c_~#a~0.base| (store .cse12 .cse4 v_ArrVal_362)))) (store .cse36 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse36 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse34 (select .cse35 |c_~#a~0.base|))) (or (not (= (select .cse34 .cse4) 0)) (not (= (select .cse34 .cse6) 0)) (not (= (select .cse34 .cse5) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse35 |c_~#a~0.base| (store .cse34 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) (or (not (= .cse2 .cse11)) .cse13) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse38 (let ((.cse39 (let ((.cse40 (let ((.cse41 (store .cse32 |c_~#a~0.base| (store .cse33 .cse5 v_ArrVal_359)))) (store .cse41 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse41 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11 0))))) (store .cse40 |c_~#a~0.base| (store (select .cse40 |c_~#a~0.base|) .cse4 v_ArrVal_362))))) (store .cse39 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse39 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse37 (select .cse38 |c_~#a~0.base|))) (or (not (= (select .cse37 .cse6) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse38 |c_~#a~0.base| (store .cse37 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11) 0)) (not (= (select .cse37 .cse5) 0)) (not (= (select .cse37 .cse4) 0)))))) (or (not (= .cse2 .cse8)) .cse13) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse43 (let ((.cse44 (let ((.cse45 (let ((.cse46 (store |c_#race| |c_~#a~0.base| (store .cse12 .cse5 v_ArrVal_359)))) (store .cse46 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse46 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11 0))))) (store .cse45 |c_~#a~0.base| (store (select .cse45 |c_~#a~0.base|) .cse4 v_ArrVal_362))))) (store .cse44 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse44 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse42 (select .cse43 |c_~#a~0.base|))) (or (not (= (select .cse42 .cse4) 0)) (not (= (select .cse42 .cse5) 0)) (not (= (select .cse42 .cse6) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse43 |c_~#a~0.base| (store .cse42 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse48 (let ((.cse49 (store |c_#race| |c_~#a~0.base| (store .cse12 .cse4 v_ArrVal_362)))) (store .cse49 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse49 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse47 (select .cse48 |c_~#a~0.base|))) (or (not (= (select .cse47 .cse4) 0)) (not (= (select .cse47 .cse6) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse48 |c_~#a~0.base| (store .cse47 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse3) 0)) (not (= (select .cse47 .cse5) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse51 (let ((.cse52 (store |c_#race| |c_~#a~0.base| (store .cse12 .cse4 v_ArrVal_362)))) (store .cse52 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse52 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse50 (select .cse51 |c_~#a~0.base|))) (or (not (= (select .cse50 .cse4) 0)) (not (= (select .cse50 .cse6) 0)) (not (= (select .cse50 .cse5) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse51 |c_~#a~0.base| (store .cse50 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse53 (let ((.cse55 (let ((.cse56 (let ((.cse57 (store .cse32 |c_~#a~0.base| (store .cse33 .cse5 v_ArrVal_359)))) (store .cse57 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse57 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11 0))))) (store .cse56 |c_~#a~0.base| (store (select .cse56 |c_~#a~0.base|) .cse4 v_ArrVal_362))))) (store .cse55 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse55 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse54 (select .cse53 |c_~#a~0.base|))) (or (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse53 |c_~#a~0.base| (store .cse54 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse3) 0)) (not (= (select .cse54 .cse6) 0)) (not (= (select .cse54 .cse5) 0)) (not (= (select .cse54 .cse4) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse59 (let ((.cse60 (let ((.cse61 (let ((.cse62 (store .cse32 |c_~#a~0.base| (store .cse33 .cse5 v_ArrVal_359)))) (store .cse62 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse62 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse11 0))))) (store .cse61 |c_~#a~0.base| (store (select .cse61 |c_~#a~0.base|) .cse4 v_ArrVal_362))))) (store .cse60 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse60 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse58 (select .cse59 |c_~#a~0.base|))) (or (not (= (select .cse58 .cse6) 0)) (forall ((v_ArrVal_367 Int)) (= 0 (select (select (store .cse59 |c_~#a~0.base| (store .cse58 .cse2 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (not (= (select .cse58 .cse5) 0)) (not (= (select .cse58 .cse4) 0)))))))))) is different from true [2023-08-25 17:21:51,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:21:55,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:22:11,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:22:16,910 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse15 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse13 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse1 (+ .cse15 |c_~#a~0.offset| 1)) (.cse3 (+ .cse15 2 |c_~#a~0.offset|)) (.cse5 (+ .cse15 |c_~#a~0.offset|)) (.cse6 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) (.cse8 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse14 (select |c_#race| |c_~#a~0.base|)) (.cse2 (+ .cse15 3 |c_~#a~0.offset|))) (and (forall ((v_ArrVal_354 Int) (v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse4 (let ((.cse7 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse1 v_ArrVal_354)))) (store .cse12 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse12 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse11 |c_~#a~0.base| (store (select .cse11 |c_~#a~0.base|) .cse3 v_ArrVal_359))))) (store .cse10 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse9 |c_~#a~0.base| (store (select .cse9 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse0 (select .cse4 |c_~#a~0.base|))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (not (= 0 (select .cse0 .cse3))) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse4 |c_~#a~0.base| (store .cse0 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)))))) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse15 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse16 (let ((.cse18 (let ((.cse19 (let ((.cse20 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse3 v_ArrVal_359)))) (store .cse20 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse20 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse19 |c_~#a~0.base| (store (select .cse19 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse18 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse18 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse17 (select .cse16 |c_~#a~0.base|))) (or (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse16 |c_~#a~0.base| (store .cse17 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)) (not (= (select .cse17 .cse2) 0)) (not (= (select .cse17 .cse3) 0)) (not (= (select .cse17 .cse1) 0)))))) (or (and (forall ((v_ArrVal_367 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse14 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse14 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse14 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse14 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))) (not (= (select .cse14 .cse1) 0)) (not (= (select .cse14 .cse3) 0)) (not (= (select .cse14 .cse2) 0))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse22 (let ((.cse23 (let ((.cse24 (let ((.cse25 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse3 v_ArrVal_359)))) (store .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse25 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse24 |c_~#a~0.base| (store (select .cse24 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse23 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse23 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse21 (select .cse22 |c_~#a~0.base|))) (or (not (= (select .cse21 .cse2) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse22 |c_~#a~0.base| (store .cse21 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse21 .cse3) 0)) (not (= (select .cse21 .cse1) 0)))))) (forall ((v_ArrVal_354 Int) (v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse27 (let ((.cse28 (let ((.cse29 (let ((.cse30 (let ((.cse31 (let ((.cse32 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse1 v_ArrVal_354)))) (store .cse32 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse32 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse31 |c_~#a~0.base| (store (select .cse31 |c_~#a~0.base|) .cse3 v_ArrVal_359))))) (store .cse30 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse30 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse29 |c_~#a~0.base| (store (select .cse29 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse26 (select .cse27 |c_~#a~0.base|))) (or (not (= (select .cse26 .cse1) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse27 |c_~#a~0.base| (store .cse26 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse26 .cse2) 0)) (not (= 0 (select .cse26 .cse3))))))) (forall ((v_ArrVal_354 Int) (v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (let ((.cse39 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse1 v_ArrVal_354)))) (store .cse39 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse39 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse38 |c_~#a~0.base| (store (select .cse38 |c_~#a~0.base|) .cse3 v_ArrVal_359))))) (store .cse37 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse37 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse36 |c_~#a~0.base| (store (select .cse36 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse35 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse35 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse33 (select .cse34 |c_~#a~0.base|))) (or (not (= (select .cse33 .cse1) 0)) (not (= (select .cse33 .cse2) 0)) (not (= 0 (select .cse33 .cse3))) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse34 |c_~#a~0.base| (store .cse33 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse41 (let ((.cse42 (let ((.cse43 (let ((.cse44 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse3 v_ArrVal_359)))) (store .cse44 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse44 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse43 |c_~#a~0.base| (store (select .cse43 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse42 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse42 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse40 (select .cse41 |c_~#a~0.base|))) (or (not (= (select .cse40 .cse2) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse41 |c_~#a~0.base| (store .cse40 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)) (not (= (select .cse40 .cse3) 0)) (not (= (select .cse40 .cse1) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse46 (let ((.cse47 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse2 v_ArrVal_362)))) (store .cse47 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse47 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse45 (select .cse46 |c_~#a~0.base|))) (or (not (= (select .cse45 .cse2) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse46 |c_~#a~0.base| (store .cse45 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse45 .cse1) 0)) (not (= (select .cse45 .cse3) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse49 (let ((.cse50 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse2 v_ArrVal_362)))) (store .cse50 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse50 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse48 (select .cse49 |c_~#a~0.base|))) (or (not (= (select .cse48 .cse2) 0)) (not (= (select .cse48 .cse1) 0)) (not (= (select .cse48 .cse3) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse49 |c_~#a~0.base| (store .cse48 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) (forall ((v_ArrVal_354 Int) (v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse52 (let ((.cse53 (let ((.cse54 (let ((.cse55 (let ((.cse56 (let ((.cse57 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse1 v_ArrVal_354)))) (store .cse57 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse57 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse56 |c_~#a~0.base| (store (select .cse56 |c_~#a~0.base|) .cse3 v_ArrVal_359))))) (store .cse55 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse55 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse54 |c_~#a~0.base| (store (select .cse54 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse53 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse53 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse51 (select .cse52 |c_~#a~0.base|))) (or (not (= (select .cse51 .cse1) 0)) (not (= (select .cse51 .cse2) 0)) (not (= 0 (select .cse51 .cse3))) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse52 |c_~#a~0.base| (store .cse51 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse59 (let ((.cse60 (let ((.cse61 (let ((.cse62 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse3 v_ArrVal_359)))) (store .cse62 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse62 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (store .cse61 |c_~#a~0.base| (store (select .cse61 |c_~#a~0.base|) .cse2 v_ArrVal_362))))) (store .cse60 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse60 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse58 (select .cse59 |c_~#a~0.base|))) (or (not (= (select .cse58 .cse2) 0)) (not (= (select .cse58 .cse3) 0)) (not (= (select .cse58 .cse1) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse59 |c_~#a~0.base| (store .cse58 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse64 (let ((.cse65 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse2 v_ArrVal_362)))) (store .cse65 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse65 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse63 (select .cse64 |c_~#a~0.base|))) (or (not (= (select .cse63 .cse2) 0)) (not (= (select .cse63 .cse1) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse64 |c_~#a~0.base| (store .cse63 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)) (not (= (select .cse63 .cse3) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse67 (let ((.cse68 (store |c_#race| |c_~#a~0.base| (store .cse14 .cse2 v_ArrVal_362)))) (store .cse68 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse68 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse66 (select .cse67 |c_~#a~0.base|))) (or (not (= (select .cse66 .cse2) 0)) (not (= (select .cse66 .cse1) 0)) (not (= (select .cse66 .cse3) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse67 |c_~#a~0.base| (store .cse66 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0))))))))) is different from true [2023-08-25 17:22:18,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:22:20,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:22:23,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:22:37,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:22:40,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:22:54,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:22:58,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:23:00,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:23:03,029 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse58 (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|)) (.cse13 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (let ((.cse9 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store .cse58 .cse13 0))) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse23 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store .cse58 .cse12 0)))) (let ((.cse14 (not (= |c_t_funThread1of1ForFork0_~p~0#1.base| |c_~#a~0.base|))) (.cse11 (select |c_#race| |c_~#a~0.base|)) (.cse24 (select .cse23 |c_~#a~0.base|)) (.cse5 (+ .cse0 |c_~#a~0.offset|)) (.cse2 (+ .cse0 |c_~#a~0.offset| 1)) (.cse7 (+ .cse0 2 |c_~#a~0.offset|)) (.cse6 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse10 (select .cse9 |c_~#a~0.base|)) (.cse3 (+ .cse0 3 |c_~#a~0.offset|))) (and (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_362 Int)) (let ((.cse4 (let ((.cse8 (store .cse9 |c_~#a~0.base| (store .cse10 .cse3 v_ArrVal_362)))) (store .cse8 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse1 (select .cse4 |c_~#a~0.base|))) (or (not (= 0 (select .cse1 .cse2))) (not (= (select .cse1 .cse3) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse4 |c_~#a~0.base| (store .cse1 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)) (not (= 0 (select .cse1 .cse7))))))) (or (and (forall ((v_ArrVal_367 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse11 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse11 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse11 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse11 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0))) (not (= (select .cse11 .cse2) 0)) (not (= (select .cse11 .cse7) 0)) (not (= (select .cse11 .cse3) 0))) (or (not (= .cse5 .cse12)) .cse14) (or .cse14 (not (= |c_t_funThread1of1ForFork0_~p~0#1.offset| .cse5))) (forall ((v_ArrVal_362 Int)) (let ((.cse16 (let ((.cse17 (store |c_#race| |c_~#a~0.base| (store .cse11 .cse3 v_ArrVal_362)))) (store .cse17 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse17 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse15 (select .cse16 |c_~#a~0.base|))) (or (not (= (select .cse15 .cse3) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse16 |c_~#a~0.base| (store .cse15 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)) (not (= (select .cse15 .cse2) 0)) (not (= (select .cse15 .cse7) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse19 (let ((.cse20 (let ((.cse21 (let ((.cse22 (store .cse23 |c_~#a~0.base| (store .cse24 .cse7 v_ArrVal_359)))) (store .cse22 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse22 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse21 |c_~#a~0.base| (store (select .cse21 |c_~#a~0.base|) .cse3 v_ArrVal_362))))) (store .cse20 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse20 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse18 (select .cse19 |c_~#a~0.base|))) (or (not (= (select .cse18 .cse2) 0)) (forall ((v_ArrVal_367 Int)) (= 0 (select (select (store .cse19 |c_~#a~0.base| (store .cse18 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6))) (not (= (select .cse18 .cse7) 0)) (not (= (select .cse18 .cse3) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse26 (let ((.cse27 (store |c_#race| |c_~#a~0.base| (store .cse11 .cse3 v_ArrVal_362)))) (store .cse27 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse27 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse25 (select .cse26 |c_~#a~0.base|))) (or (not (= (select .cse25 .cse3) 0)) (not (= (select .cse25 .cse2) 0)) (not (= (select .cse25 .cse7) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse26 |c_~#a~0.base| (store .cse25 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)))))) (or (not (= .cse5 .cse13)) .cse14) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse29 (let ((.cse30 (let ((.cse31 (let ((.cse32 (store .cse23 |c_~#a~0.base| (store .cse24 .cse7 v_ArrVal_359)))) (store .cse32 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse32 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse31 |c_~#a~0.base| (store (select .cse31 |c_~#a~0.base|) .cse3 v_ArrVal_362))))) (store .cse30 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse30 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse28 (select .cse29 |c_~#a~0.base|))) (or (not (= (select .cse28 .cse2) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse29 |c_~#a~0.base| (store .cse28 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)) (not (= (select .cse28 .cse7) 0)) (not (= (select .cse28 .cse3) 0)))))) (or (not (= .cse5 .cse6)) .cse14) (forall ((v_ArrVal_362 Int)) (let ((.cse34 (let ((.cse35 (store .cse9 |c_~#a~0.base| (store .cse10 .cse3 v_ArrVal_362)))) (store .cse35 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse35 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse33 (select .cse34 |c_~#a~0.base|))) (or (not (= 0 (select .cse33 .cse2))) (not (= (select .cse33 .cse3) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse34 |c_~#a~0.base| (store .cse33 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)) (not (= 0 (select .cse33 .cse7))))))) (forall ((v_ArrVal_362 Int)) (let ((.cse37 (let ((.cse38 (store |c_#race| |c_~#a~0.base| (store .cse11 .cse3 v_ArrVal_362)))) (store .cse38 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse38 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse36 (select .cse37 |c_~#a~0.base|))) (or (not (= (select .cse36 .cse3) 0)) (not (= (select .cse36 .cse2) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse37 |c_~#a~0.base| (store .cse36 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12) 0)) (not (= (select .cse36 .cse7) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse40 (let ((.cse41 (store |c_#race| |c_~#a~0.base| (store .cse11 .cse3 v_ArrVal_362)))) (store .cse41 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse41 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse39 (select .cse40 |c_~#a~0.base|))) (or (not (= (select .cse39 .cse3) 0)) (not (= (select .cse39 .cse2) 0)) (not (= (select .cse39 .cse7) 0)) (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse40 |c_~#a~0.base| (store .cse39 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse42 (let ((.cse44 (let ((.cse45 (let ((.cse46 (store .cse23 |c_~#a~0.base| (store .cse24 .cse7 v_ArrVal_359)))) (store .cse46 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse46 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse45 |c_~#a~0.base| (store (select .cse45 |c_~#a~0.base|) .cse3 v_ArrVal_362))))) (store .cse44 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse44 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse43 (select .cse42 |c_~#a~0.base|))) (or (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse42 |c_~#a~0.base| (store .cse43 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12) 0)) (not (= (select .cse43 .cse2) 0)) (not (= (select .cse43 .cse7) 0)) (not (= (select .cse43 .cse3) 0)))))) (forall ((v_ArrVal_362 Int) (v_ArrVal_359 Int)) (let ((.cse48 (let ((.cse49 (let ((.cse50 (let ((.cse51 (store .cse23 |c_~#a~0.base| (store .cse24 .cse7 v_ArrVal_359)))) (store .cse51 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse51 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse13 0))))) (store .cse50 |c_~#a~0.base| (store (select .cse50 |c_~#a~0.base|) .cse3 v_ArrVal_362))))) (store .cse49 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse49 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse47 (select .cse48 |c_~#a~0.base|))) (or (not (= (select .cse47 .cse2) 0)) (forall ((v_ArrVal_367 Int)) (= 0 (select (select (store .cse48 |c_~#a~0.base| (store .cse47 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (not (= (select .cse47 .cse7) 0)) (not (= (select .cse47 .cse3) 0)))))) (forall ((v_ArrVal_362 Int)) (let ((.cse52 (let ((.cse54 (store .cse9 |c_~#a~0.base| (store .cse10 .cse3 v_ArrVal_362)))) (store .cse54 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse54 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse53 (select .cse52 |c_~#a~0.base|))) (or (forall ((v_ArrVal_367 Int)) (= (select (select (store .cse52 |c_~#a~0.base| (store .cse53 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse12) 0)) (not (= 0 (select .cse53 .cse2))) (not (= (select .cse53 .cse3) 0)) (not (= 0 (select .cse53 .cse7))))))) (forall ((v_ArrVal_362 Int)) (let ((.cse55 (let ((.cse57 (store .cse9 |c_~#a~0.base| (store .cse10 .cse3 v_ArrVal_362)))) (store .cse57 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse57 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse56 (select .cse55 |c_~#a~0.base|))) (or (forall ((v_ArrVal_367 Int)) (= 0 (select (select (store .cse55 |c_~#a~0.base| (store .cse56 .cse5 v_ArrVal_367)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (not (= 0 (select .cse56 .cse2))) (not (= (select .cse56 .cse3) 0)) (not (= 0 (select .cse56 .cse7))))))))))) is different from true [2023-08-25 17:23:05,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:23:09,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:23:16,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:23:21,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:23:23,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:23:29,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:23:31,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:23:36,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:23:38,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:23:39,398 INFO L124 PetriNetUnfolderBase]: 1617/3422 cut-off events. [2023-08-25 17:23:39,399 INFO L125 PetriNetUnfolderBase]: For 7757/7757 co-relation queries the response was YES. [2023-08-25 17:23:39,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14574 conditions, 3422 events. 1617/3422 cut-off events. For 7757/7757 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 24052 event pairs, 171 based on Foata normal form. 2/3321 useless extension candidates. Maximal degree in co-relation 14504. Up to 820 conditions per place. [2023-08-25 17:23:39,439 INFO L140 encePairwiseOnDemand]: 146/171 looper letters, 612 selfloop transitions, 248 changer transitions 34/894 dead transitions. [2023-08-25 17:23:39,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 894 transitions, 8354 flow [2023-08-25 17:23:39,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-25 17:23:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-25 17:23:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2511 transitions. [2023-08-25 17:23:39,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3864265927977839 [2023-08-25 17:23:39,449 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2511 transitions. [2023-08-25 17:23:39,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2511 transitions. [2023-08-25 17:23:39,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:23:39,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2511 transitions. [2023-08-25 17:23:39,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 66.07894736842105) internal successors, (2511), 38 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:39,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 171.0) internal successors, (6669), 39 states have internal predecessors, (6669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:39,469 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 171.0) internal successors, (6669), 39 states have internal predecessors, (6669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:39,469 INFO L175 Difference]: Start difference. First operand has 98 places, 175 transitions, 1341 flow. Second operand 38 states and 2511 transitions. [2023-08-25 17:23:39,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 894 transitions, 8354 flow [2023-08-25 17:23:39,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 894 transitions, 8064 flow, removed 145 selfloop flow, removed 0 redundant places. [2023-08-25 17:23:39,585 INFO L231 Difference]: Finished difference. Result has 161 places, 442 transitions, 4476 flow [2023-08-25 17:23:39,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=4476, PETRI_PLACES=161, PETRI_TRANSITIONS=442} [2023-08-25 17:23:39,586 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 122 predicate places. [2023-08-25 17:23:39,586 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 442 transitions, 4476 flow [2023-08-25 17:23:39,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 57.53846153846154) internal successors, (748), 13 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:39,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:23:39,587 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:23:39,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-25 17:23:39,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:23:39,788 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:23:39,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:23:39,789 INFO L85 PathProgramCache]: Analyzing trace with hash 544455111, now seen corresponding path program 2 times [2023-08-25 17:23:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:23:39,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596727691] [2023-08-25 17:23:39,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:23:39,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:23:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:23:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:23:40,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:23:40,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596727691] [2023-08-25 17:23:40,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596727691] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:23:40,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:23:40,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 17:23:40,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964004415] [2023-08-25 17:23:40,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:23:40,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-25 17:23:40,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:23:40,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-25 17:23:40,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-08-25 17:23:40,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:23:40,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 442 transitions, 4476 flow. Second operand has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:40,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:23:40,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:23:40,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:23:42,242 INFO L124 PetriNetUnfolderBase]: 1687/3653 cut-off events. [2023-08-25 17:23:42,242 INFO L125 PetriNetUnfolderBase]: For 23825/23825 co-relation queries the response was YES. [2023-08-25 17:23:42,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21420 conditions, 3653 events. 1687/3653 cut-off events. For 23825/23825 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 26630 event pairs, 167 based on Foata normal form. 13/3661 useless extension candidates. Maximal degree in co-relation 21323. Up to 1732 conditions per place. [2023-08-25 17:23:42,291 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 537 selfloop transitions, 229 changer transitions 71/837 dead transitions. [2023-08-25 17:23:42,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 837 transitions, 9952 flow [2023-08-25 17:23:42,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-25 17:23:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-25 17:23:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1173 transitions. [2023-08-25 17:23:42,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40350877192982454 [2023-08-25 17:23:42,296 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1173 transitions. [2023-08-25 17:23:42,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1173 transitions. [2023-08-25 17:23:42,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:23:42,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1173 transitions. [2023-08-25 17:23:42,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 69.0) internal successors, (1173), 17 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:42,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 171.0) internal successors, (3078), 18 states have internal predecessors, (3078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:42,303 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 171.0) internal successors, (3078), 18 states have internal predecessors, (3078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:42,304 INFO L175 Difference]: Start difference. First operand has 161 places, 442 transitions, 4476 flow. Second operand 17 states and 1173 transitions. [2023-08-25 17:23:42,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 837 transitions, 9952 flow [2023-08-25 17:23:42,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 837 transitions, 9726 flow, removed 113 selfloop flow, removed 0 redundant places. [2023-08-25 17:23:42,448 INFO L231 Difference]: Finished difference. Result has 187 places, 535 transitions, 6133 flow [2023-08-25 17:23:42,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=4297, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6133, PETRI_PLACES=187, PETRI_TRANSITIONS=535} [2023-08-25 17:23:42,449 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 148 predicate places. [2023-08-25 17:23:42,449 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 535 transitions, 6133 flow [2023-08-25 17:23:42,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:42,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:23:42,450 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:23:42,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 17:23:42,450 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:23:42,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:23:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1271918263, now seen corresponding path program 3 times [2023-08-25 17:23:42,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:23:42,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103085164] [2023-08-25 17:23:42,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:23:42,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:23:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:23:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:23:43,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:23:43,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103085164] [2023-08-25 17:23:43,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103085164] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:23:43,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:23:43,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 17:23:43,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072255607] [2023-08-25 17:23:43,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:23:43,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-25 17:23:43,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:23:43,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-25 17:23:43,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2023-08-25 17:23:43,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:23:43,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 535 transitions, 6133 flow. Second operand has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:43,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:23:43,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:23:43,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:23:45,603 INFO L124 PetriNetUnfolderBase]: 1700/3716 cut-off events. [2023-08-25 17:23:45,604 INFO L125 PetriNetUnfolderBase]: For 30403/30403 co-relation queries the response was YES. [2023-08-25 17:23:45,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23577 conditions, 3716 events. 1700/3716 cut-off events. For 30403/30403 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 27386 event pairs, 185 based on Foata normal form. 6/3722 useless extension candidates. Maximal degree in co-relation 23479. Up to 1698 conditions per place. [2023-08-25 17:23:45,660 INFO L140 encePairwiseOnDemand]: 155/171 looper letters, 407 selfloop transitions, 314 changer transitions 38/759 dead transitions. [2023-08-25 17:23:45,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 759 transitions, 10338 flow [2023-08-25 17:23:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 17:23:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 17:23:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 782 transitions. [2023-08-25 17:23:45,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41573631047315257 [2023-08-25 17:23:45,665 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 782 transitions. [2023-08-25 17:23:45,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 782 transitions. [2023-08-25 17:23:45,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:23:45,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 782 transitions. [2023-08-25 17:23:45,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 71.0909090909091) internal successors, (782), 11 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:45,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 171.0) internal successors, (2052), 12 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:45,669 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 171.0) internal successors, (2052), 12 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:45,669 INFO L175 Difference]: Start difference. First operand has 187 places, 535 transitions, 6133 flow. Second operand 11 states and 782 transitions. [2023-08-25 17:23:45,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 759 transitions, 10338 flow [2023-08-25 17:23:45,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 759 transitions, 10262 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-08-25 17:23:45,849 INFO L231 Difference]: Finished difference. Result has 201 places, 577 transitions, 7738 flow [2023-08-25 17:23:45,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=6088, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=272, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7738, PETRI_PLACES=201, PETRI_TRANSITIONS=577} [2023-08-25 17:23:45,850 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 162 predicate places. [2023-08-25 17:23:45,850 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 577 transitions, 7738 flow [2023-08-25 17:23:45,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:23:45,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:23:45,851 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:23:45,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 17:23:45,851 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:23:45,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:23:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash -336286085, now seen corresponding path program 1 times [2023-08-25 17:23:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:23:45,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572784640] [2023-08-25 17:23:45,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:23:45,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:23:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:23:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:23:52,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:23:52,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572784640] [2023-08-25 17:23:52,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572784640] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:23:52,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561260870] [2023-08-25 17:23:52,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:23:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:23:52,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:23:52,309 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 17:23:52,318 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 17:23:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:23:52,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-25 17:23:52,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:23:52,561 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 13 treesize of output 9 [2023-08-25 17:23:52,610 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-25 17:23:52,610 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 22 treesize of output 15 [2023-08-25 17:23:52,677 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 17:23:52,722 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 28 treesize of output 27 [2023-08-25 17:23:52,780 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-25 17:23:52,847 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-08-25 17:23:52,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:52,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:52,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:52,922 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2023-08-25 17:23:52,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:52,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:52,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:52,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:52,957 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 69 [2023-08-25 17:23:52,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:52,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:52,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:52,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:52,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 69 [2023-08-25 17:23:53,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,013 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 69 [2023-08-25 17:23:53,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:23:53,276 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 17:23:53,276 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 124 [2023-08-25 17:24:17,466 WARN L234 SmtUtils]: Spent 14.05s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 17:24:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-25 17:24:17,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 17:24:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:24:20,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561260870] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 17:24:20,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 17:24:20,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [20, 15] total 45 [2023-08-25 17:24:20,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117740788] [2023-08-25 17:24:20,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:24:20,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 17:24:20,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:24:20,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 17:24:20,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1791, Unknown=5, NotChecked=0, Total=2070 [2023-08-25 17:24:20,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:24:20,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 577 transitions, 7738 flow. Second operand has 13 states, 13 states have (on average 57.53846153846154) internal successors, (748), 13 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:24:20,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:24:20,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:24:20,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:24:40,176 INFO L124 PetriNetUnfolderBase]: 1694/3703 cut-off events. [2023-08-25 17:24:40,176 INFO L125 PetriNetUnfolderBase]: For 36957/36957 co-relation queries the response was YES. [2023-08-25 17:24:40,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25378 conditions, 3703 events. 1694/3703 cut-off events. For 36957/36957 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 27332 event pairs, 226 based on Foata normal form. 1/3704 useless extension candidates. Maximal degree in co-relation 25270. Up to 2103 conditions per place. [2023-08-25 17:24:40,222 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 699 selfloop transitions, 165 changer transitions 45/909 dead transitions. [2023-08-25 17:24:40,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 909 transitions, 12905 flow [2023-08-25 17:24:40,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-25 17:24:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-25 17:24:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1275 transitions. [2023-08-25 17:24:40,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39242843951985223 [2023-08-25 17:24:40,225 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1275 transitions. [2023-08-25 17:24:40,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1275 transitions. [2023-08-25 17:24:40,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:24:40,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1275 transitions. [2023-08-25 17:24:40,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 67.10526315789474) internal successors, (1275), 19 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:24:40,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 171.0) internal successors, (3420), 20 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:24:40,232 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 171.0) internal successors, (3420), 20 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:24:40,233 INFO L175 Difference]: Start difference. First operand has 201 places, 577 transitions, 7738 flow. Second operand 19 states and 1275 transitions. [2023-08-25 17:24:40,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 909 transitions, 12905 flow [2023-08-25 17:24:40,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 909 transitions, 12813 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-25 17:24:40,529 INFO L231 Difference]: Finished difference. Result has 230 places, 661 transitions, 9275 flow [2023-08-25 17:24:40,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=7677, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=9275, PETRI_PLACES=230, PETRI_TRANSITIONS=661} [2023-08-25 17:24:40,529 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 191 predicate places. [2023-08-25 17:24:40,530 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 661 transitions, 9275 flow [2023-08-25 17:24:40,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 57.53846153846154) internal successors, (748), 13 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:24:40,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:24:40,530 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:24:40,535 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 17:24:40,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:24:40,731 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:24:40,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:24:40,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1458009297, now seen corresponding path program 2 times [2023-08-25 17:24:40,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:24:40,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725492884] [2023-08-25 17:24:40,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:24:40,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:24:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:24:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:24:43,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:24:43,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725492884] [2023-08-25 17:24:43,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725492884] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:24:43,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296983861] [2023-08-25 17:24:43,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 17:24:43,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:24:43,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:24:43,701 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 17:24:43,713 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 17:24:43,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-25 17:24:43,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 17:24:43,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-25 17:24:43,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:24:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-25 17:24:43,850 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 17:24:43,877 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 28 treesize of output 27 [2023-08-25 17:24:43,922 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-25 17:24:43,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-08-25 17:24:44,029 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-25 17:24:44,029 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 22 treesize of output 15 [2023-08-25 17:24:44,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,121 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2023-08-25 17:24:44,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 69 [2023-08-25 17:24:44,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 69 [2023-08-25 17:24:44,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 69 [2023-08-25 17:24:44,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:24:44,420 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 17:24:44,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 124 [2023-08-25 17:25:12,612 WARN L234 SmtUtils]: Spent 14.06s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 17:25:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:25:12,613 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 17:25:12,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296983861] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:25:12,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 17:25:12,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 29 [2023-08-25 17:25:12,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374239936] [2023-08-25 17:25:12,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:25:12,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 17:25:12,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:25:12,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 17:25:12,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=752, Unknown=7, NotChecked=0, Total=870 [2023-08-25 17:25:12,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:25:12,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 661 transitions, 9275 flow. Second operand has 11 states, 11 states have (on average 57.81818181818182) internal successors, (636), 11 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:25:12,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:25:12,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:25:12,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:25:16,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:25:18,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:25:20,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:25:22,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:25:27,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:25:29,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:25:33,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:25:35,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:25:37,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:25:39,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:25:55,643 WARN L234 SmtUtils]: Spent 14.09s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 17:25:57,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:26:00,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:26:02,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:26:02,883 INFO L124 PetriNetUnfolderBase]: 1729/3810 cut-off events. [2023-08-25 17:26:02,883 INFO L125 PetriNetUnfolderBase]: For 45436/45436 co-relation queries the response was YES. [2023-08-25 17:26:02,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28323 conditions, 3810 events. 1729/3810 cut-off events. For 45436/45436 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 28518 event pairs, 240 based on Foata normal form. 6/3816 useless extension candidates. Maximal degree in co-relation 28200. Up to 2565 conditions per place. [2023-08-25 17:26:02,928 INFO L140 encePairwiseOnDemand]: 154/171 looper letters, 621 selfloop transitions, 203 changer transitions 39/863 dead transitions. [2023-08-25 17:26:02,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 863 transitions, 13794 flow [2023-08-25 17:26:02,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 17:26:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 17:26:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 774 transitions. [2023-08-25 17:26:02,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41148325358851673 [2023-08-25 17:26:02,930 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 774 transitions. [2023-08-25 17:26:02,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 774 transitions. [2023-08-25 17:26:02,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:26:02,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 774 transitions. [2023-08-25 17:26:02,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 70.36363636363636) internal successors, (774), 11 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:02,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 171.0) internal successors, (2052), 12 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:02,934 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 171.0) internal successors, (2052), 12 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:02,935 INFO L175 Difference]: Start difference. First operand has 230 places, 661 transitions, 9275 flow. Second operand 11 states and 774 transitions. [2023-08-25 17:26:02,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 863 transitions, 13794 flow [2023-08-25 17:26:03,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 863 transitions, 13718 flow, removed 38 selfloop flow, removed 0 redundant places. [2023-08-25 17:26:03,255 INFO L231 Difference]: Finished difference. Result has 244 places, 697 transitions, 10577 flow [2023-08-25 17:26:03,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=9221, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10577, PETRI_PLACES=244, PETRI_TRANSITIONS=697} [2023-08-25 17:26:03,256 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 205 predicate places. [2023-08-25 17:26:03,257 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 697 transitions, 10577 flow [2023-08-25 17:26:03,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 57.81818181818182) internal successors, (636), 11 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:03,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:26:03,257 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:26:03,265 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 17:26:03,461 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,SelfDestructingSolverStorable11 [2023-08-25 17:26:03,462 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:26:03,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:26:03,462 INFO L85 PathProgramCache]: Analyzing trace with hash -592374751, now seen corresponding path program 3 times [2023-08-25 17:26:03,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:26:03,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001185808] [2023-08-25 17:26:03,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:26:03,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:26:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:26:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:26:06,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:26:06,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001185808] [2023-08-25 17:26:06,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001185808] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:26:06,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133765689] [2023-08-25 17:26:06,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 17:26:06,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:26:06,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:26:06,260 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 17:26:06,262 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 17:26:06,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-25 17:26:06,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 17:26:06,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-25 17:26:06,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:26:06,362 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 16 treesize of output 12 [2023-08-25 17:26:06,391 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-25 17:26:06,391 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 22 treesize of output 15 [2023-08-25 17:26:06,471 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 17:26:06,521 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 28 treesize of output 27 [2023-08-25 17:26:06,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-25 17:26:06,657 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-08-25 17:26:06,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:06,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:06,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:06,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:06,759 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 17:26:06,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2023-08-25 17:26:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:26:06,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 17:26:06,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133765689] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:26:06,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 17:26:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 25 [2023-08-25 17:26:06,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350344124] [2023-08-25 17:26:06,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:26:06,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:26:06,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:26:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:26:06,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2023-08-25 17:26:06,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:26:06,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 697 transitions, 10577 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:06,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:26:06,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:26:06,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:26:08,517 INFO L124 PetriNetUnfolderBase]: 1840/4028 cut-off events. [2023-08-25 17:26:08,518 INFO L125 PetriNetUnfolderBase]: For 56305/56305 co-relation queries the response was YES. [2023-08-25 17:26:08,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31372 conditions, 4028 events. 1840/4028 cut-off events. For 56305/56305 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 30105 event pairs, 280 based on Foata normal form. 36/4064 useless extension candidates. Maximal degree in co-relation 31239. Up to 1878 conditions per place. [2023-08-25 17:26:08,564 INFO L140 encePairwiseOnDemand]: 156/171 looper letters, 799 selfloop transitions, 179 changer transitions 32/1010 dead transitions. [2023-08-25 17:26:08,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 1010 transitions, 16488 flow [2023-08-25 17:26:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 17:26:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 17:26:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 740 transitions. [2023-08-25 17:26:08,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4327485380116959 [2023-08-25 17:26:08,566 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 740 transitions. [2023-08-25 17:26:08,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 740 transitions. [2023-08-25 17:26:08,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:26:08,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 740 transitions. [2023-08-25 17:26:08,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 74.0) internal successors, (740), 10 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:08,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 171.0) internal successors, (1881), 11 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:08,570 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 171.0) internal successors, (1881), 11 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:08,570 INFO L175 Difference]: Start difference. First operand has 244 places, 697 transitions, 10577 flow. Second operand 10 states and 740 transitions. [2023-08-25 17:26:08,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 1010 transitions, 16488 flow [2023-08-25 17:26:08,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 1010 transitions, 16146 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-08-25 17:26:08,898 INFO L231 Difference]: Finished difference. Result has 253 places, 752 transitions, 11729 flow [2023-08-25 17:26:08,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=10326, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11729, PETRI_PLACES=253, PETRI_TRANSITIONS=752} [2023-08-25 17:26:08,899 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 214 predicate places. [2023-08-25 17:26:08,899 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 752 transitions, 11729 flow [2023-08-25 17:26:08,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:08,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:26:08,900 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:26:08,909 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 17:26:09,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:26:09,117 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:26:09,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:26:09,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2044414349, now seen corresponding path program 4 times [2023-08-25 17:26:09,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:26:09,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113855444] [2023-08-25 17:26:09,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:26:09,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:26:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:26:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:26:09,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:26:09,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113855444] [2023-08-25 17:26:09,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113855444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:26:09,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:26:09,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 17:26:09,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604238252] [2023-08-25 17:26:09,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:26:09,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-25 17:26:09,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:26:09,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-25 17:26:09,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-25 17:26:10,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:26:10,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 752 transitions, 11729 flow. Second operand has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:10,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:26:10,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:26:10,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:26:11,973 INFO L124 PetriNetUnfolderBase]: 2013/4394 cut-off events. [2023-08-25 17:26:11,973 INFO L125 PetriNetUnfolderBase]: For 67813/67813 co-relation queries the response was YES. [2023-08-25 17:26:12,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35179 conditions, 4394 events. 2013/4394 cut-off events. For 67813/67813 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 33396 event pairs, 272 based on Foata normal form. 20/4414 useless extension candidates. Maximal degree in co-relation 35040. Up to 2712 conditions per place. [2023-08-25 17:26:12,021 INFO L140 encePairwiseOnDemand]: 154/171 looper letters, 727 selfloop transitions, 257 changer transitions 27/1011 dead transitions. [2023-08-25 17:26:12,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 1011 transitions, 17752 flow [2023-08-25 17:26:12,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 17:26:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 17:26:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 726 transitions. [2023-08-25 17:26:12,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4245614035087719 [2023-08-25 17:26:12,024 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 726 transitions. [2023-08-25 17:26:12,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 726 transitions. [2023-08-25 17:26:12,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:26:12,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 726 transitions. [2023-08-25 17:26:12,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 72.6) internal successors, (726), 10 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:12,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 171.0) internal successors, (1881), 11 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:12,028 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 171.0) internal successors, (1881), 11 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:12,028 INFO L175 Difference]: Start difference. First operand has 253 places, 752 transitions, 11729 flow. Second operand 10 states and 726 transitions. [2023-08-25 17:26:12,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 1011 transitions, 17752 flow [2023-08-25 17:26:12,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1011 transitions, 17668 flow, removed 33 selfloop flow, removed 1 redundant places. [2023-08-25 17:26:12,452 INFO L231 Difference]: Finished difference. Result has 267 places, 814 transitions, 13977 flow [2023-08-25 17:26:12,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=11657, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13977, PETRI_PLACES=267, PETRI_TRANSITIONS=814} [2023-08-25 17:26:12,453 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 228 predicate places. [2023-08-25 17:26:12,454 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 814 transitions, 13977 flow [2023-08-25 17:26:12,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 58.0) internal successors, (580), 10 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:12,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:26:12,454 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:26:12,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-25 17:26:12,454 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:26:12,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:26:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2099474188, now seen corresponding path program 1 times [2023-08-25 17:26:12,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:26:12,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369521822] [2023-08-25 17:26:12,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:26:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:26:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:26:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:26:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:26:12,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369521822] [2023-08-25 17:26:12,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369521822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:26:12,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:26:12,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-25 17:26:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103705618] [2023-08-25 17:26:12,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:26:12,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 17:26:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:26:12,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 17:26:12,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-08-25 17:26:12,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 171 [2023-08-25 17:26:12,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 814 transitions, 13977 flow. Second operand has 13 states, 13 states have (on average 50.53846153846154) internal successors, (657), 13 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:12,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:26:12,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 171 [2023-08-25 17:26:12,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:26:15,292 INFO L124 PetriNetUnfolderBase]: 2015/4398 cut-off events. [2023-08-25 17:26:15,293 INFO L125 PetriNetUnfolderBase]: For 81104/81104 co-relation queries the response was YES. [2023-08-25 17:26:15,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36921 conditions, 4398 events. 2015/4398 cut-off events. For 81104/81104 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 33435 event pairs, 182 based on Foata normal form. 2/4400 useless extension candidates. Maximal degree in co-relation 36790. Up to 2752 conditions per place. [2023-08-25 17:26:15,341 INFO L140 encePairwiseOnDemand]: 149/171 looper letters, 698 selfloop transitions, 297 changer transitions 45/1040 dead transitions. [2023-08-25 17:26:15,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 1040 transitions, 19318 flow [2023-08-25 17:26:15,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-25 17:26:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-25 17:26:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 806 transitions. [2023-08-25 17:26:15,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36257309941520466 [2023-08-25 17:26:15,344 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 806 transitions. [2023-08-25 17:26:15,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 806 transitions. [2023-08-25 17:26:15,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:26:15,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 806 transitions. [2023-08-25 17:26:15,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 62.0) internal successors, (806), 13 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:15,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 171.0) internal successors, (2394), 14 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:15,349 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 171.0) internal successors, (2394), 14 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:15,349 INFO L175 Difference]: Start difference. First operand has 267 places, 814 transitions, 13977 flow. Second operand 13 states and 806 transitions. [2023-08-25 17:26:15,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 1040 transitions, 19318 flow [2023-08-25 17:26:15,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 1040 transitions, 19123 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-08-25 17:26:15,754 INFO L231 Difference]: Finished difference. Result has 283 places, 831 transitions, 14784 flow [2023-08-25 17:26:15,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=13818, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=280, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=14784, PETRI_PLACES=283, PETRI_TRANSITIONS=831} [2023-08-25 17:26:15,755 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 244 predicate places. [2023-08-25 17:26:15,756 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 831 transitions, 14784 flow [2023-08-25 17:26:15,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.53846153846154) internal successors, (657), 13 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:15,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:26:15,756 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:26:15,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-25 17:26:15,756 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:26:15,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:26:15,757 INFO L85 PathProgramCache]: Analyzing trace with hash 118769903, now seen corresponding path program 4 times [2023-08-25 17:26:15,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:26:15,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647433124] [2023-08-25 17:26:15,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:26:15,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:26:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:26:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:26:16,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:26:16,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647433124] [2023-08-25 17:26:16,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647433124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:26:16,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:26:16,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:26:16,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946019552] [2023-08-25 17:26:16,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:26:16,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:26:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:26:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:26:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:26:16,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:26:16,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 831 transitions, 14784 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:16,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:26:16,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:26:16,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:26:19,087 INFO L124 PetriNetUnfolderBase]: 1906/4187 cut-off events. [2023-08-25 17:26:19,087 INFO L125 PetriNetUnfolderBase]: For 85153/85153 co-relation queries the response was YES. [2023-08-25 17:26:19,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36879 conditions, 4187 events. 1906/4187 cut-off events. For 85153/85153 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 31667 event pairs, 190 based on Foata normal form. 88/4275 useless extension candidates. Maximal degree in co-relation 36741. Up to 1739 conditions per place. [2023-08-25 17:26:19,135 INFO L140 encePairwiseOnDemand]: 156/171 looper letters, 742 selfloop transitions, 229 changer transitions 72/1043 dead transitions. [2023-08-25 17:26:19,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 1043 transitions, 19801 flow [2023-08-25 17:26:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-25 17:26:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-25 17:26:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1016 transitions. [2023-08-25 17:26:19,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3961013645224172 [2023-08-25 17:26:19,137 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1016 transitions. [2023-08-25 17:26:19,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1016 transitions. [2023-08-25 17:26:19,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:26:19,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1016 transitions. [2023-08-25 17:26:19,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 67.73333333333333) internal successors, (1016), 15 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:19,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 171.0) internal successors, (2736), 16 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:19,142 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 171.0) internal successors, (2736), 16 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:19,142 INFO L175 Difference]: Start difference. First operand has 283 places, 831 transitions, 14784 flow. Second operand 15 states and 1016 transitions. [2023-08-25 17:26:19,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 1043 transitions, 19801 flow [2023-08-25 17:26:19,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 1043 transitions, 19523 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-08-25 17:26:19,583 INFO L231 Difference]: Finished difference. Result has 302 places, 795 transitions, 14666 flow [2023-08-25 17:26:19,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=14532, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14666, PETRI_PLACES=302, PETRI_TRANSITIONS=795} [2023-08-25 17:26:19,584 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 263 predicate places. [2023-08-25 17:26:19,584 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 795 transitions, 14666 flow [2023-08-25 17:26:19,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:19,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:26:19,585 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:26:19,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 17:26:19,585 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:26:19,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:26:19,585 INFO L85 PathProgramCache]: Analyzing trace with hash 320206119, now seen corresponding path program 5 times [2023-08-25 17:26:19,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:26:19,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707235238] [2023-08-25 17:26:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:26:19,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:26:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:26:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:26:20,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:26:20,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707235238] [2023-08-25 17:26:20,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707235238] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:26:20,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:26:20,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:26:20,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302387185] [2023-08-25 17:26:20,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:26:20,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:26:20,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:26:20,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:26:20,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:26:20,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:26:20,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 795 transitions, 14666 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:20,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:26:20,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:26:20,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:26:22,611 INFO L124 PetriNetUnfolderBase]: 1960/4287 cut-off events. [2023-08-25 17:26:22,611 INFO L125 PetriNetUnfolderBase]: For 90801/90801 co-relation queries the response was YES. [2023-08-25 17:26:22,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38524 conditions, 4287 events. 1960/4287 cut-off events. For 90801/90801 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 32421 event pairs, 171 based on Foata normal form. 11/4298 useless extension candidates. Maximal degree in co-relation 38400. Up to 2151 conditions per place. [2023-08-25 17:26:22,664 INFO L140 encePairwiseOnDemand]: 156/171 looper letters, 649 selfloop transitions, 331 changer transitions 24/1004 dead transitions. [2023-08-25 17:26:22,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 1004 transitions, 20244 flow [2023-08-25 17:26:22,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 17:26:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 17:26:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 660 transitions. [2023-08-25 17:26:22,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42884990253411304 [2023-08-25 17:26:22,666 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 660 transitions. [2023-08-25 17:26:22,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 660 transitions. [2023-08-25 17:26:22,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:26:22,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 660 transitions. [2023-08-25 17:26:22,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 73.33333333333333) internal successors, (660), 9 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:22,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:22,669 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:22,670 INFO L175 Difference]: Start difference. First operand has 302 places, 795 transitions, 14666 flow. Second operand 9 states and 660 transitions. [2023-08-25 17:26:22,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 1004 transitions, 20244 flow [2023-08-25 17:26:23,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 1004 transitions, 19948 flow, removed 19 selfloop flow, removed 11 redundant places. [2023-08-25 17:26:23,156 INFO L231 Difference]: Finished difference. Result has 292 places, 828 transitions, 16222 flow [2023-08-25 17:26:23,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=14438, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=298, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16222, PETRI_PLACES=292, PETRI_TRANSITIONS=828} [2023-08-25 17:26:23,157 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 253 predicate places. [2023-08-25 17:26:23,157 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 828 transitions, 16222 flow [2023-08-25 17:26:23,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:23,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:26:23,157 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:26:23,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-25 17:26:23,157 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:26:23,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:26:23,158 INFO L85 PathProgramCache]: Analyzing trace with hash -150644079, now seen corresponding path program 5 times [2023-08-25 17:26:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:26:23,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558328523] [2023-08-25 17:26:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:26:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:26:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:26:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:26:23,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:26:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558328523] [2023-08-25 17:26:23,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558328523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:26:23,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:26:23,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:26:23,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930227452] [2023-08-25 17:26:23,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:26:23,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:26:23,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:26:23,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:26:23,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:26:23,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:26:23,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 828 transitions, 16222 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:23,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:26:23,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:26:23,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:26:26,031 INFO L124 PetriNetUnfolderBase]: 2148/4683 cut-off events. [2023-08-25 17:26:26,032 INFO L125 PetriNetUnfolderBase]: For 111114/111114 co-relation queries the response was YES. [2023-08-25 17:26:26,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43511 conditions, 4683 events. 2148/4683 cut-off events. For 111114/111114 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 35950 event pairs, 212 based on Foata normal form. 18/4701 useless extension candidates. Maximal degree in co-relation 43390. Up to 2749 conditions per place. [2023-08-25 17:26:26,093 INFO L140 encePairwiseOnDemand]: 156/171 looper letters, 807 selfloop transitions, 298 changer transitions 26/1131 dead transitions. [2023-08-25 17:26:26,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 1131 transitions, 23879 flow [2023-08-25 17:26:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 17:26:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 17:26:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 664 transitions. [2023-08-25 17:26:26,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314489928525016 [2023-08-25 17:26:26,094 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 664 transitions. [2023-08-25 17:26:26,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 664 transitions. [2023-08-25 17:26:26,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:26:26,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 664 transitions. [2023-08-25 17:26:26,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 73.77777777777777) internal successors, (664), 9 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:26,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:26,097 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:26,097 INFO L175 Difference]: Start difference. First operand has 292 places, 828 transitions, 16222 flow. Second operand 9 states and 664 transitions. [2023-08-25 17:26:26,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 1131 transitions, 23879 flow [2023-08-25 17:26:26,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 1131 transitions, 23495 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-25 17:26:26,770 INFO L231 Difference]: Finished difference. Result has 302 places, 922 transitions, 19247 flow [2023-08-25 17:26:26,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=15933, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=828, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=19247, PETRI_PLACES=302, PETRI_TRANSITIONS=922} [2023-08-25 17:26:26,771 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 263 predicate places. [2023-08-25 17:26:26,771 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 922 transitions, 19247 flow [2023-08-25 17:26:26,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:26,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:26:26,771 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:26:26,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-25 17:26:26,771 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:26:26,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:26:26,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1334453905, now seen corresponding path program 6 times [2023-08-25 17:26:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:26:26,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211399796] [2023-08-25 17:26:26,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:26:26,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:26:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:26:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:26:34,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:26:34,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211399796] [2023-08-25 17:26:34,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211399796] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:26:34,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182896779] [2023-08-25 17:26:34,738 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-25 17:26:34,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:26:34,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:26:34,741 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 17:26:34,752 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 17:26:34,858 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-25 17:26:34,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 17:26:34,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-25 17:26:34,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:26:34,874 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 13 treesize of output 9 [2023-08-25 17:26:34,925 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-25 17:26:34,925 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 22 treesize of output 15 [2023-08-25 17:26:34,986 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 17:26:35,045 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 28 treesize of output 27 [2023-08-25 17:26:35,091 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-25 17:26:35,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-08-25 17:26:35,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:35,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:35,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:35,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:35,240 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 17:26:35,240 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2023-08-25 17:26:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:26:35,286 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 17:26:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182896779] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:26:35,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 17:26:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 27 [2023-08-25 17:26:35,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751989448] [2023-08-25 17:26:35,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:26:35,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:26:35,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:26:35,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:26:35,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2023-08-25 17:26:35,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:26:35,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 922 transitions, 19247 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:35,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:26:35,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:26:35,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:26:37,451 INFO L124 PetriNetUnfolderBase]: 2131/4640 cut-off events. [2023-08-25 17:26:37,452 INFO L125 PetriNetUnfolderBase]: For 125808/125808 co-relation queries the response was YES. [2023-08-25 17:26:37,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44630 conditions, 4640 events. 2131/4640 cut-off events. For 125808/125808 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 35430 event pairs, 227 based on Foata normal form. 14/4654 useless extension candidates. Maximal degree in co-relation 44503. Up to 2708 conditions per place. [2023-08-25 17:26:37,514 INFO L140 encePairwiseOnDemand]: 156/171 looper letters, 847 selfloop transitions, 247 changer transitions 38/1132 dead transitions. [2023-08-25 17:26:37,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 1132 transitions, 24216 flow [2023-08-25 17:26:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-25 17:26:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-25 17:26:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1010 transitions. [2023-08-25 17:26:37,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3937621832358674 [2023-08-25 17:26:37,516 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1010 transitions. [2023-08-25 17:26:37,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1010 transitions. [2023-08-25 17:26:37,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:26:37,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1010 transitions. [2023-08-25 17:26:37,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 67.33333333333333) internal successors, (1010), 15 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:37,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 171.0) internal successors, (2736), 16 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:37,520 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 171.0) internal successors, (2736), 16 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:37,520 INFO L175 Difference]: Start difference. First operand has 302 places, 922 transitions, 19247 flow. Second operand 15 states and 1010 transitions. [2023-08-25 17:26:37,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 1132 transitions, 24216 flow [2023-08-25 17:26:38,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 1132 transitions, 23936 flow, removed 92 selfloop flow, removed 3 redundant places. [2023-08-25 17:26:38,338 INFO L231 Difference]: Finished difference. Result has 314 places, 908 transitions, 19287 flow [2023-08-25 17:26:38,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=18971, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=920, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=19287, PETRI_PLACES=314, PETRI_TRANSITIONS=908} [2023-08-25 17:26:38,339 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 275 predicate places. [2023-08-25 17:26:38,339 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 908 transitions, 19287 flow [2023-08-25 17:26:38,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:38,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:26:38,340 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:26:38,347 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 17:26:38,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:26:38,547 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:26:38,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:26:38,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1175250637, now seen corresponding path program 7 times [2023-08-25 17:26:38,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:26:38,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294658437] [2023-08-25 17:26:38,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:26:38,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:26:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:26:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:26:39,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:26:39,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294658437] [2023-08-25 17:26:39,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294658437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:26:39,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:26:39,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:26:39,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311696702] [2023-08-25 17:26:39,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:26:39,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:26:39,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:26:39,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:26:39,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:26:39,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:26:39,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 908 transitions, 19287 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:39,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:26:39,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:26:39,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:26:41,384 INFO L124 PetriNetUnfolderBase]: 2242/4878 cut-off events. [2023-08-25 17:26:41,385 INFO L125 PetriNetUnfolderBase]: For 145558/145558 co-relation queries the response was YES. [2023-08-25 17:26:41,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47696 conditions, 4878 events. 2242/4878 cut-off events. For 145558/145558 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 37691 event pairs, 241 based on Foata normal form. 24/4902 useless extension candidates. Maximal degree in co-relation 47569. Up to 2649 conditions per place. [2023-08-25 17:26:41,562 INFO L140 encePairwiseOnDemand]: 156/171 looper letters, 845 selfloop transitions, 309 changer transitions 28/1182 dead transitions. [2023-08-25 17:26:41,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1182 transitions, 26878 flow [2023-08-25 17:26:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 17:26:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 17:26:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 664 transitions. [2023-08-25 17:26:41,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314489928525016 [2023-08-25 17:26:41,563 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 664 transitions. [2023-08-25 17:26:41,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 664 transitions. [2023-08-25 17:26:41,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:26:41,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 664 transitions. [2023-08-25 17:26:41,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 73.77777777777777) internal successors, (664), 9 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:41,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:41,565 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:41,565 INFO L175 Difference]: Start difference. First operand has 314 places, 908 transitions, 19287 flow. Second operand 9 states and 664 transitions. [2023-08-25 17:26:41,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 1182 transitions, 26878 flow [2023-08-25 17:26:42,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 1182 transitions, 26346 flow, removed 7 selfloop flow, removed 11 redundant places. [2023-08-25 17:26:42,207 INFO L231 Difference]: Finished difference. Result has 307 places, 952 transitions, 21406 flow [2023-08-25 17:26:42,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=18785, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21406, PETRI_PLACES=307, PETRI_TRANSITIONS=952} [2023-08-25 17:26:42,208 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 268 predicate places. [2023-08-25 17:26:42,208 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 952 transitions, 21406 flow [2023-08-25 17:26:42,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:42,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:26:42,209 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:26:42,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-25 17:26:42,209 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:26:42,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:26:42,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1340788144, now seen corresponding path program 2 times [2023-08-25 17:26:42,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:26:42,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338982472] [2023-08-25 17:26:42,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:26:42,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:26:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:26:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:26:42,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:26:42,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338982472] [2023-08-25 17:26:42,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338982472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:26:42,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:26:42,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:26:42,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633971611] [2023-08-25 17:26:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:26:42,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:26:42,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:26:42,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:26:42,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:26:42,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 171 [2023-08-25 17:26:42,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 952 transitions, 21406 flow. Second operand has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:42,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:26:42,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 171 [2023-08-25 17:26:42,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:26:44,745 INFO L124 PetriNetUnfolderBase]: 2241/4876 cut-off events. [2023-08-25 17:26:44,746 INFO L125 PetriNetUnfolderBase]: For 153002/153002 co-relation queries the response was YES. [2023-08-25 17:26:44,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48544 conditions, 4876 events. 2241/4876 cut-off events. For 153002/153002 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 37637 event pairs, 330 based on Foata normal form. 3/4879 useless extension candidates. Maximal degree in co-relation 48415. Up to 3849 conditions per place. [2023-08-25 17:26:44,805 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 714 selfloop transitions, 301 changer transitions 17/1032 dead transitions. [2023-08-25 17:26:44,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 1032 transitions, 24695 flow [2023-08-25 17:26:44,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 17:26:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 17:26:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 540 transitions. [2023-08-25 17:26:44,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2023-08-25 17:26:44,807 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 540 transitions. [2023-08-25 17:26:44,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 540 transitions. [2023-08-25 17:26:44,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:26:44,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 540 transitions. [2023-08-25 17:26:44,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 67.5) internal successors, (540), 8 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:44,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:44,809 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:44,809 INFO L175 Difference]: Start difference. First operand has 307 places, 952 transitions, 21406 flow. Second operand 8 states and 540 transitions. [2023-08-25 17:26:44,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 1032 transitions, 24695 flow [2023-08-25 17:26:45,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 1032 transitions, 24382 flow, removed 96 selfloop flow, removed 3 redundant places. [2023-08-25 17:26:45,504 INFO L231 Difference]: Finished difference. Result has 315 places, 967 transitions, 22175 flow [2023-08-25 17:26:45,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=21095, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=952, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=288, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=22175, PETRI_PLACES=315, PETRI_TRANSITIONS=967} [2023-08-25 17:26:45,505 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 276 predicate places. [2023-08-25 17:26:45,505 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 967 transitions, 22175 flow [2023-08-25 17:26:45,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:45,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:26:45,505 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:26:45,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-25 17:26:45,506 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:26:45,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:26:45,506 INFO L85 PathProgramCache]: Analyzing trace with hash 496780128, now seen corresponding path program 3 times [2023-08-25 17:26:45,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:26:45,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820354105] [2023-08-25 17:26:45,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:26:45,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:26:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:26:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:26:45,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:26:45,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820354105] [2023-08-25 17:26:45,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820354105] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:26:45,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:26:45,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:26:45,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172510021] [2023-08-25 17:26:45,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:26:45,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:26:45,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:26:45,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:26:45,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:26:45,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 171 [2023-08-25 17:26:45,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 967 transitions, 22175 flow. Second operand has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:45,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:26:45,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 171 [2023-08-25 17:26:45,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:26:48,322 INFO L124 PetriNetUnfolderBase]: 2273/4945 cut-off events. [2023-08-25 17:26:48,322 INFO L125 PetriNetUnfolderBase]: For 162855/162855 co-relation queries the response was YES. [2023-08-25 17:26:48,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50025 conditions, 4945 events. 2273/4945 cut-off events. For 162855/162855 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 38290 event pairs, 364 based on Foata normal form. 9/4954 useless extension candidates. Maximal degree in co-relation 49893. Up to 3131 conditions per place. [2023-08-25 17:26:48,386 INFO L140 encePairwiseOnDemand]: 155/171 looper letters, 884 selfloop transitions, 230 changer transitions 19/1133 dead transitions. [2023-08-25 17:26:48,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 1133 transitions, 26618 flow [2023-08-25 17:26:48,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 17:26:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 17:26:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 633 transitions. [2023-08-25 17:26:48,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41130604288499023 [2023-08-25 17:26:48,387 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 633 transitions. [2023-08-25 17:26:48,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 633 transitions. [2023-08-25 17:26:48,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:26:48,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 633 transitions. [2023-08-25 17:26:48,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 70.33333333333333) internal successors, (633), 9 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:48,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:48,389 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:48,389 INFO L175 Difference]: Start difference. First operand has 315 places, 967 transitions, 22175 flow. Second operand 9 states and 633 transitions. [2023-08-25 17:26:48,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 1133 transitions, 26618 flow [2023-08-25 17:26:49,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 1133 transitions, 26553 flow, removed 23 selfloop flow, removed 1 redundant places. [2023-08-25 17:26:49,136 INFO L231 Difference]: Finished difference. Result has 326 places, 1010 transitions, 23511 flow [2023-08-25 17:26:49,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=22110, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=747, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=23511, PETRI_PLACES=326, PETRI_TRANSITIONS=1010} [2023-08-25 17:26:49,138 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 287 predicate places. [2023-08-25 17:26:49,138 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 1010 transitions, 23511 flow [2023-08-25 17:26:49,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:49,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:26:49,138 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:26:49,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-25 17:26:49,138 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:26:49,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:26:49,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1777185204, now seen corresponding path program 4 times [2023-08-25 17:26:49,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:26:49,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966407995] [2023-08-25 17:26:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:26:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:26:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:26:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:26:49,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:26:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966407995] [2023-08-25 17:26:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966407995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:26:49,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:26:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:26:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607283015] [2023-08-25 17:26:49,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:26:49,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:26:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:26:49,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:26:49,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:26:49,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 171 [2023-08-25 17:26:49,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 1010 transitions, 23511 flow. Second operand has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:49,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:26:49,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 171 [2023-08-25 17:26:49,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:26:51,725 INFO L124 PetriNetUnfolderBase]: 2268/4937 cut-off events. [2023-08-25 17:26:51,725 INFO L125 PetriNetUnfolderBase]: For 180504/180504 co-relation queries the response was YES. [2023-08-25 17:26:51,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51540 conditions, 4937 events. 2268/4937 cut-off events. For 180504/180504 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 38248 event pairs, 347 based on Foata normal form. 3/4940 useless extension candidates. Maximal degree in co-relation 51404. Up to 3893 conditions per place. [2023-08-25 17:26:51,795 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 752 selfloop transitions, 306 changer transitions 18/1076 dead transitions. [2023-08-25 17:26:51,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 1076 transitions, 26749 flow [2023-08-25 17:26:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 17:26:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 17:26:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 530 transitions. [2023-08-25 17:26:51,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38742690058479534 [2023-08-25 17:26:51,796 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 530 transitions. [2023-08-25 17:26:51,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 530 transitions. [2023-08-25 17:26:51,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:26:51,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 530 transitions. [2023-08-25 17:26:51,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 66.25) internal successors, (530), 8 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:51,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:51,798 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 171.0) internal successors, (1539), 9 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:51,799 INFO L175 Difference]: Start difference. First operand has 326 places, 1010 transitions, 23511 flow. Second operand 8 states and 530 transitions. [2023-08-25 17:26:51,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 1076 transitions, 26749 flow [2023-08-25 17:26:52,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 1076 transitions, 26641 flow, removed 54 selfloop flow, removed 0 redundant places. [2023-08-25 17:26:52,767 INFO L231 Difference]: Finished difference. Result has 337 places, 1025 transitions, 24709 flow [2023-08-25 17:26:52,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=23403, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1010, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=24709, PETRI_PLACES=337, PETRI_TRANSITIONS=1025} [2023-08-25 17:26:52,768 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 298 predicate places. [2023-08-25 17:26:52,768 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 1025 transitions, 24709 flow [2023-08-25 17:26:52,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:26:52,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:26:52,768 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:26:52,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-25 17:26:52,768 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:26:52,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:26:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash -916167149, now seen corresponding path program 6 times [2023-08-25 17:26:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:26:52,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885837627] [2023-08-25 17:26:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:26:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:26:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:26:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:26:56,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:26:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885837627] [2023-08-25 17:26:56,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885837627] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:26:56,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934363999] [2023-08-25 17:26:56,127 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-25 17:26:56,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:26:56,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:26:56,128 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 17:26:56,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-25 17:26:56,249 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-25 17:26:56,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 17:26:56,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-25 17:26:56,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:26:56,260 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 13 treesize of output 9 [2023-08-25 17:26:56,302 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 17:26:56,340 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 21 treesize of output 20 [2023-08-25 17:26:56,393 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-25 17:26:56,393 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 22 treesize of output 15 [2023-08-25 17:26:56,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-08-25 17:26:56,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,479 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-25 17:26:56,494 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-25 17:26:56,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2023-08-25 17:26:56,595 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-25 17:26:56,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2023-08-25 17:26:56,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:26:56,927 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 17:26:56,927 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 98 treesize of output 115 [2023-08-25 17:27:21,122 WARN L234 SmtUtils]: Spent 14.06s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 17:27:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:27:21,123 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 17:27:21,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934363999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:27:21,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 17:27:21,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 30 [2023-08-25 17:27:21,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140599647] [2023-08-25 17:27:21,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:27:21,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 17:27:21,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:27:21,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 17:27:21,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=787, Unknown=5, NotChecked=0, Total=930 [2023-08-25 17:27:21,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:27:21,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 1025 transitions, 24709 flow. Second operand has 11 states, 11 states have (on average 57.81818181818182) internal successors, (636), 11 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:27:21,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:27:21,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:27:21,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:27:25,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:27:27,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:27:29,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:27:31,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:27:35,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:27:37,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:27:42,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:27:44,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:27:46,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:27:48,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:28:04,555 WARN L234 SmtUtils]: Spent 14.10s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 17:28:06,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:28:09,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:28:11,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:28:12,492 INFO L124 PetriNetUnfolderBase]: 2549/5541 cut-off events. [2023-08-25 17:28:12,492 INFO L125 PetriNetUnfolderBase]: For 218527/218527 co-relation queries the response was YES. [2023-08-25 17:28:12,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59557 conditions, 5541 events. 2549/5541 cut-off events. For 218527/218527 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 44203 event pairs, 295 based on Foata normal form. 14/5555 useless extension candidates. Maximal degree in co-relation 59416. Up to 3107 conditions per place. [2023-08-25 17:28:12,564 INFO L140 encePairwiseOnDemand]: 155/171 looper letters, 891 selfloop transitions, 419 changer transitions 34/1344 dead transitions. [2023-08-25 17:28:12,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 1344 transitions, 34111 flow [2023-08-25 17:28:12,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 17:28:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 17:28:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 788 transitions. [2023-08-25 17:28:12,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4189261031366295 [2023-08-25 17:28:12,565 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 788 transitions. [2023-08-25 17:28:12,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 788 transitions. [2023-08-25 17:28:12,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:28:12,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 788 transitions. [2023-08-25 17:28:12,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 71.63636363636364) internal successors, (788), 11 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:12,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 171.0) internal successors, (2052), 12 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:12,568 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 171.0) internal successors, (2052), 12 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:12,568 INFO L175 Difference]: Start difference. First operand has 337 places, 1025 transitions, 24709 flow. Second operand 11 states and 788 transitions. [2023-08-25 17:28:12,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 1344 transitions, 34111 flow [2023-08-25 17:28:13,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1344 transitions, 33961 flow, removed 55 selfloop flow, removed 2 redundant places. [2023-08-25 17:28:13,613 INFO L231 Difference]: Finished difference. Result has 354 places, 1133 transitions, 29309 flow [2023-08-25 17:28:13,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=24571, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1025, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=322, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=29309, PETRI_PLACES=354, PETRI_TRANSITIONS=1133} [2023-08-25 17:28:13,614 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 315 predicate places. [2023-08-25 17:28:13,614 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 1133 transitions, 29309 flow [2023-08-25 17:28:13,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 57.81818181818182) internal successors, (636), 11 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:13,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:28:13,615 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:28:13,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-25 17:28:13,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-25 17:28:13,815 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:28:13,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:28:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash 546556321, now seen corresponding path program 7 times [2023-08-25 17:28:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:28:13,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46202636] [2023-08-25 17:28:13,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:28:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:28:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:28:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:28:14,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:28:14,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46202636] [2023-08-25 17:28:14,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46202636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:28:14,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:28:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:28:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669550310] [2023-08-25 17:28:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:28:14,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:28:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:28:14,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:28:14,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:28:14,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:28:14,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 1133 transitions, 29309 flow. Second operand has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:14,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:28:14,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:28:14,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:28:16,959 INFO L124 PetriNetUnfolderBase]: 2582/5609 cut-off events. [2023-08-25 17:28:16,960 INFO L125 PetriNetUnfolderBase]: For 246238/246238 co-relation queries the response was YES. [2023-08-25 17:28:17,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62384 conditions, 5609 events. 2582/5609 cut-off events. For 246238/246238 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 44621 event pairs, 311 based on Foata normal form. 2/5611 useless extension candidates. Maximal degree in co-relation 62235. Up to 3280 conditions per place. [2023-08-25 17:28:17,047 INFO L140 encePairwiseOnDemand]: 156/171 looper letters, 926 selfloop transitions, 343 changer transitions 24/1293 dead transitions. [2023-08-25 17:28:17,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1293 transitions, 34596 flow [2023-08-25 17:28:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 17:28:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 17:28:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 666 transitions. [2023-08-25 17:28:17,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4327485380116959 [2023-08-25 17:28:17,049 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 666 transitions. [2023-08-25 17:28:17,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 666 transitions. [2023-08-25 17:28:17,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:28:17,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 666 transitions. [2023-08-25 17:28:17,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 74.0) internal successors, (666), 9 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:17,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:17,051 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:17,051 INFO L175 Difference]: Start difference. First operand has 354 places, 1133 transitions, 29309 flow. Second operand 9 states and 666 transitions. [2023-08-25 17:28:17,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 1293 transitions, 34596 flow [2023-08-25 17:28:18,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 1293 transitions, 34504 flow, removed 29 selfloop flow, removed 1 redundant places. [2023-08-25 17:28:18,230 INFO L231 Difference]: Finished difference. Result has 366 places, 1156 transitions, 30666 flow [2023-08-25 17:28:18,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=29223, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=322, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=30666, PETRI_PLACES=366, PETRI_TRANSITIONS=1156} [2023-08-25 17:28:18,231 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 327 predicate places. [2023-08-25 17:28:18,231 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 1156 transitions, 30666 flow [2023-08-25 17:28:18,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:18,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:28:18,231 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:28:18,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-25 17:28:18,232 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:28:18,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:28:18,232 INFO L85 PathProgramCache]: Analyzing trace with hash 413420845, now seen corresponding path program 8 times [2023-08-25 17:28:18,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:28:18,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428797042] [2023-08-25 17:28:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:28:18,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:28:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:28:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:28:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:28:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428797042] [2023-08-25 17:28:20,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428797042] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:28:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496553413] [2023-08-25 17:28:20,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 17:28:20,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:28:20,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:28:20,809 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 17:28:20,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-25 17:28:20,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-25 17:28:20,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 17:28:20,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-25 17:28:20,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:28:20,979 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 13 treesize of output 9 [2023-08-25 17:28:21,030 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 17:28:21,100 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-25 17:28:21,100 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 22 treesize of output 15 [2023-08-25 17:28:21,163 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 23 treesize of output 22 [2023-08-25 17:28:21,172 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 21 treesize of output 20 [2023-08-25 17:28:21,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,239 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-25 17:28:21,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-25 17:28:21,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,333 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2023-08-25 17:28:21,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-25 17:28:21,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,437 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2023-08-25 17:28:21,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:28:21,693 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 17:28:21,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 98 treesize of output 115 [2023-08-25 17:28:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:28:27,815 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 17:28:27,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496553413] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:28:27,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 17:28:27,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 29 [2023-08-25 17:28:27,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104450855] [2023-08-25 17:28:27,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:28:27,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 17:28:27,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:28:27,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 17:28:27,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=756, Unknown=2, NotChecked=0, Total=930 [2023-08-25 17:28:27,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:28:27,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 1156 transitions, 30666 flow. Second operand has 12 states, 12 states have (on average 57.666666666666664) internal successors, (692), 12 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:27,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:28:27,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:28:27,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:28:32,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:28:34,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:28:36,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:28:38,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:28:42,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:28:45,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:28:48,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 17:28:49,285 INFO L124 PetriNetUnfolderBase]: 2718/5892 cut-off events. [2023-08-25 17:28:49,285 INFO L125 PetriNetUnfolderBase]: For 272876/272876 co-relation queries the response was YES. [2023-08-25 17:28:49,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67316 conditions, 5892 events. 2718/5892 cut-off events. For 272876/272876 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 47500 event pairs, 346 based on Foata normal form. 14/5906 useless extension candidates. Maximal degree in co-relation 67162. Up to 3154 conditions per place. [2023-08-25 17:28:49,370 INFO L140 encePairwiseOnDemand]: 154/171 looper letters, 970 selfloop transitions, 422 changer transitions 35/1427 dead transitions. [2023-08-25 17:28:49,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 1427 transitions, 39516 flow [2023-08-25 17:28:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 17:28:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 17:28:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 780 transitions. [2023-08-25 17:28:49,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41467304625199364 [2023-08-25 17:28:49,372 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 780 transitions. [2023-08-25 17:28:49,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 780 transitions. [2023-08-25 17:28:49,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:28:49,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 780 transitions. [2023-08-25 17:28:49,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 70.9090909090909) internal successors, (780), 11 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:49,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 171.0) internal successors, (2052), 12 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:49,375 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 171.0) internal successors, (2052), 12 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:49,375 INFO L175 Difference]: Start difference. First operand has 366 places, 1156 transitions, 30666 flow. Second operand 11 states and 780 transitions. [2023-08-25 17:28:49,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 1427 transitions, 39516 flow [2023-08-25 17:28:50,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 1427 transitions, 39420 flow, removed 40 selfloop flow, removed 1 redundant places. [2023-08-25 17:28:50,693 INFO L231 Difference]: Finished difference. Result has 383 places, 1231 transitions, 34655 flow [2023-08-25 17:28:50,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=30570, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=351, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=768, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=34655, PETRI_PLACES=383, PETRI_TRANSITIONS=1231} [2023-08-25 17:28:50,695 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 344 predicate places. [2023-08-25 17:28:50,695 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 1231 transitions, 34655 flow [2023-08-25 17:28:50,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 57.666666666666664) internal successors, (692), 12 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:50,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:28:50,695 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:28:50,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-25 17:28:50,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-25 17:28:50,900 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:28:50,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:28:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2065662217, now seen corresponding path program 1 times [2023-08-25 17:28:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:28:50,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129026132] [2023-08-25 17:28:50,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:28:50,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:28:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:28:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:28:51,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:28:51,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129026132] [2023-08-25 17:28:51,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129026132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:28:51,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:28:51,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:28:51,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459142804] [2023-08-25 17:28:51,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:28:51,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:28:51,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:28:51,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:28:51,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:28:51,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 171 [2023-08-25 17:28:51,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 1231 transitions, 34655 flow. Second operand has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:51,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:28:51,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 171 [2023-08-25 17:28:51,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:28:54,824 INFO L124 PetriNetUnfolderBase]: 2726/5914 cut-off events. [2023-08-25 17:28:54,824 INFO L125 PetriNetUnfolderBase]: For 303871/303871 co-relation queries the response was YES. [2023-08-25 17:28:54,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69598 conditions, 5914 events. 2726/5914 cut-off events. For 303871/303871 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 47564 event pairs, 529 based on Foata normal form. 10/5924 useless extension candidates. Maximal degree in co-relation 69436. Up to 2908 conditions per place. [2023-08-25 17:28:54,903 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 1087 selfloop transitions, 265 changer transitions 42/1394 dead transitions. [2023-08-25 17:28:54,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 1394 transitions, 40273 flow [2023-08-25 17:28:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-25 17:28:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-25 17:28:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 980 transitions. [2023-08-25 17:28:54,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3820662768031189 [2023-08-25 17:28:54,905 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 980 transitions. [2023-08-25 17:28:54,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 980 transitions. [2023-08-25 17:28:54,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:28:54,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 980 transitions. [2023-08-25 17:28:54,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 65.33333333333333) internal successors, (980), 15 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:54,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 171.0) internal successors, (2736), 16 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:54,908 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 171.0) internal successors, (2736), 16 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:54,908 INFO L175 Difference]: Start difference. First operand has 383 places, 1231 transitions, 34655 flow. Second operand 15 states and 980 transitions. [2023-08-25 17:28:54,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 1394 transitions, 40273 flow [2023-08-25 17:28:56,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1394 transitions, 40128 flow, removed 50 selfloop flow, removed 2 redundant places. [2023-08-25 17:28:56,169 INFO L231 Difference]: Finished difference. Result has 404 places, 1280 transitions, 36142 flow [2023-08-25 17:28:56,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=34523, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=36142, PETRI_PLACES=404, PETRI_TRANSITIONS=1280} [2023-08-25 17:28:56,171 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 365 predicate places. [2023-08-25 17:28:56,171 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 1280 transitions, 36142 flow [2023-08-25 17:28:56,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:56,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:28:56,171 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:28:56,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-25 17:28:56,171 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:28:56,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:28:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1138615991, now seen corresponding path program 2 times [2023-08-25 17:28:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:28:56,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753737572] [2023-08-25 17:28:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:28:56,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:28:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:28:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:28:56,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:28:56,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753737572] [2023-08-25 17:28:56,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753737572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:28:56,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:28:56,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:28:56,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832951178] [2023-08-25 17:28:56,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:28:56,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:28:56,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:28:56,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:28:56,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:28:56,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 171 [2023-08-25 17:28:56,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 1280 transitions, 36142 flow. Second operand has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:28:56,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:28:56,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 171 [2023-08-25 17:28:56,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:29:00,153 INFO L124 PetriNetUnfolderBase]: 2725/5910 cut-off events. [2023-08-25 17:29:00,153 INFO L125 PetriNetUnfolderBase]: For 314234/314234 co-relation queries the response was YES. [2023-08-25 17:29:00,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71361 conditions, 5910 events. 2725/5910 cut-off events. For 314234/314234 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 47589 event pairs, 515 based on Foata normal form. 4/5914 useless extension candidates. Maximal degree in co-relation 71191. Up to 3644 conditions per place. [2023-08-25 17:29:00,252 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 1149 selfloop transitions, 220 changer transitions 49/1418 dead transitions. [2023-08-25 17:29:00,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 1418 transitions, 41552 flow [2023-08-25 17:29:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 17:29:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 17:29:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 644 transitions. [2023-08-25 17:29:00,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4184535412605588 [2023-08-25 17:29:00,253 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 644 transitions. [2023-08-25 17:29:00,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 644 transitions. [2023-08-25 17:29:00,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:29:00,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 644 transitions. [2023-08-25 17:29:00,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 71.55555555555556) internal successors, (644), 9 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:00,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:00,256 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:00,256 INFO L175 Difference]: Start difference. First operand has 404 places, 1280 transitions, 36142 flow. Second operand 9 states and 644 transitions. [2023-08-25 17:29:00,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 1418 transitions, 41552 flow [2023-08-25 17:29:02,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 1418 transitions, 41393 flow, removed 66 selfloop flow, removed 3 redundant places. [2023-08-25 17:29:02,184 INFO L231 Difference]: Finished difference. Result has 410 places, 1309 transitions, 37401 flow [2023-08-25 17:29:02,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=35995, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1070, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=37401, PETRI_PLACES=410, PETRI_TRANSITIONS=1309} [2023-08-25 17:29:02,186 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 371 predicate places. [2023-08-25 17:29:02,186 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 1309 transitions, 37401 flow [2023-08-25 17:29:02,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:02,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:29:02,186 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:29:02,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-25 17:29:02,186 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:29:02,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:29:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash 486052304, now seen corresponding path program 5 times [2023-08-25 17:29:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:29:02,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31889304] [2023-08-25 17:29:02,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:29:02,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:29:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:29:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:29:04,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:29:04,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31889304] [2023-08-25 17:29:04,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31889304] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:29:04,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574195570] [2023-08-25 17:29:04,976 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-25 17:29:04,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:29:04,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:29:04,981 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 17:29:04,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-25 17:29:05,152 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-25 17:29:05,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 17:29:05,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-25 17:29:05,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:29:05,298 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 13 treesize of output 9 [2023-08-25 17:29:05,339 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-25 17:29:05,339 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 22 treesize of output 15 [2023-08-25 17:29:05,410 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 17:29:05,458 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 28 treesize of output 27 [2023-08-25 17:29:05,511 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-25 17:29:05,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-08-25 17:29:05,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:29:05,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:29:05,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:29:05,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:29:05,637 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 17:29:05,637 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2023-08-25 17:29:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 17:29:05,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 17:29:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:29:06,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574195570] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 17:29:06,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 17:29:06,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18, 16] total 40 [2023-08-25 17:29:06,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842435660] [2023-08-25 17:29:06,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:29:06,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:29:06,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:29:06,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:29:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2023-08-25 17:29:06,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 171 [2023-08-25 17:29:06,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 1309 transitions, 37401 flow. Second operand has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:06,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:29:06,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 171 [2023-08-25 17:29:06,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:29:14,563 INFO L124 PetriNetUnfolderBase]: 2677/5814 cut-off events. [2023-08-25 17:29:14,563 INFO L125 PetriNetUnfolderBase]: For 318389/318389 co-relation queries the response was YES. [2023-08-25 17:29:14,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71225 conditions, 5814 events. 2677/5814 cut-off events. For 318389/318389 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 46659 event pairs, 475 based on Foata normal form. 4/5818 useless extension candidates. Maximal degree in co-relation 71051. Up to 3780 conditions per place. [2023-08-25 17:29:14,651 INFO L140 encePairwiseOnDemand]: 155/171 looper letters, 1238 selfloop transitions, 167 changer transitions 15/1420 dead transitions. [2023-08-25 17:29:14,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 1420 transitions, 42270 flow [2023-08-25 17:29:14,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 17:29:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 17:29:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 634 transitions. [2023-08-25 17:29:14,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41195581546458737 [2023-08-25 17:29:14,653 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 634 transitions. [2023-08-25 17:29:14,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 634 transitions. [2023-08-25 17:29:14,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:29:14,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 634 transitions. [2023-08-25 17:29:14,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 70.44444444444444) internal successors, (634), 9 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:14,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:14,655 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:14,655 INFO L175 Difference]: Start difference. First operand has 410 places, 1309 transitions, 37401 flow. Second operand 9 states and 634 transitions. [2023-08-25 17:29:14,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 1420 transitions, 42270 flow [2023-08-25 17:29:16,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 1420 transitions, 42021 flow, removed 95 selfloop flow, removed 2 redundant places. [2023-08-25 17:29:16,114 INFO L231 Difference]: Finished difference. Result has 420 places, 1331 transitions, 38116 flow [2023-08-25 17:29:16,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=37169, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=38116, PETRI_PLACES=420, PETRI_TRANSITIONS=1331} [2023-08-25 17:29:16,116 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 381 predicate places. [2023-08-25 17:29:16,116 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 1331 transitions, 38116 flow [2023-08-25 17:29:16,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:16,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:29:16,116 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:29:16,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-25 17:29:16,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-25 17:29:16,322 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:29:16,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:29:16,322 INFO L85 PathProgramCache]: Analyzing trace with hash -954887177, now seen corresponding path program 3 times [2023-08-25 17:29:16,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:29:16,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974956399] [2023-08-25 17:29:16,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:29:16,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:29:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:29:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:29:24,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:29:24,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974956399] [2023-08-25 17:29:24,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974956399] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:29:24,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599807584] [2023-08-25 17:29:24,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 17:29:24,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:29:24,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:29:24,154 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 17:29:24,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-25 17:29:24,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-25 17:29:24,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 17:29:24,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-25 17:29:24,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:29:24,337 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 13 treesize of output 9 [2023-08-25 17:29:24,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 17:29:24,457 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 21 treesize of output 20 [2023-08-25 17:29:24,505 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-25 17:29:24,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-25 17:29:24,648 INFO L322 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2023-08-25 17:29:24,648 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 21 treesize of output 13 [2023-08-25 17:29:24,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:29:24,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:29:24,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:29:24,724 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 17:29:24,724 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2023-08-25 17:29:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:29:24,768 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 17:29:24,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599807584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:29:24,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 17:29:24,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 27 [2023-08-25 17:29:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285828458] [2023-08-25 17:29:24,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:29:24,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-25 17:29:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:29:24,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-25 17:29:24,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2023-08-25 17:29:24,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 171 [2023-08-25 17:29:24,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 1331 transitions, 38116 flow. Second operand has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:24,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:29:24,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 171 [2023-08-25 17:29:24,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:29:28,862 INFO L124 PetriNetUnfolderBase]: 3213/6926 cut-off events. [2023-08-25 17:29:28,862 INFO L125 PetriNetUnfolderBase]: For 381633/381633 co-relation queries the response was YES. [2023-08-25 17:29:28,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83518 conditions, 6926 events. 3213/6926 cut-off events. For 381633/381633 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 56912 event pairs, 620 based on Foata normal form. 86/7012 useless extension candidates. Maximal degree in co-relation 83341. Up to 4038 conditions per place. [2023-08-25 17:29:28,977 INFO L140 encePairwiseOnDemand]: 152/171 looper letters, 981 selfloop transitions, 529 changer transitions 35/1545 dead transitions. [2023-08-25 17:29:28,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 1545 transitions, 46240 flow [2023-08-25 17:29:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 17:29:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 17:29:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 693 transitions. [2023-08-25 17:29:28,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4052631578947368 [2023-08-25 17:29:28,978 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 693 transitions. [2023-08-25 17:29:28,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 693 transitions. [2023-08-25 17:29:28,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:29:28,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 693 transitions. [2023-08-25 17:29:28,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 69.3) internal successors, (693), 10 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:28,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 171.0) internal successors, (1881), 11 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:28,981 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 171.0) internal successors, (1881), 11 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:28,981 INFO L175 Difference]: Start difference. First operand has 420 places, 1331 transitions, 38116 flow. Second operand 10 states and 693 transitions. [2023-08-25 17:29:28,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 1545 transitions, 46240 flow [2023-08-25 17:29:30,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 1545 transitions, 45881 flow, removed 144 selfloop flow, removed 2 redundant places. [2023-08-25 17:29:30,836 INFO L231 Difference]: Finished difference. Result has 433 places, 1422 transitions, 42165 flow [2023-08-25 17:29:30,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=37844, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=448, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=859, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=42165, PETRI_PLACES=433, PETRI_TRANSITIONS=1422} [2023-08-25 17:29:30,837 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 394 predicate places. [2023-08-25 17:29:30,837 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 1422 transitions, 42165 flow [2023-08-25 17:29:30,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:30,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:29:30,838 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:29:30,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-25 17:29:31,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:29:31,038 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:29:31,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:29:31,039 INFO L85 PathProgramCache]: Analyzing trace with hash 624535543, now seen corresponding path program 4 times [2023-08-25 17:29:31,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:29:31,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882742866] [2023-08-25 17:29:31,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:29:31,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:29:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:29:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:29:31,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:29:31,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882742866] [2023-08-25 17:29:31,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882742866] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:29:31,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:29:31,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:29:31,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605227808] [2023-08-25 17:29:31,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:29:31,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:29:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:29:31,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:29:31,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:29:31,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 171 [2023-08-25 17:29:31,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 1422 transitions, 42165 flow. Second operand has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:31,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:29:31,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 171 [2023-08-25 17:29:31,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:29:35,558 INFO L124 PetriNetUnfolderBase]: 3222/6928 cut-off events. [2023-08-25 17:29:35,558 INFO L125 PetriNetUnfolderBase]: For 411224/411224 co-relation queries the response was YES. [2023-08-25 17:29:35,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87294 conditions, 6928 events. 3222/6928 cut-off events. For 411224/411224 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 56959 event pairs, 641 based on Foata normal form. 2/6930 useless extension candidates. Maximal degree in co-relation 87111. Up to 5060 conditions per place. [2023-08-25 17:29:35,685 INFO L140 encePairwiseOnDemand]: 155/171 looper letters, 1013 selfloop transitions, 466 changer transitions 29/1508 dead transitions. [2023-08-25 17:29:35,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 1508 transitions, 46869 flow [2023-08-25 17:29:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 17:29:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 17:29:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 605 transitions. [2023-08-25 17:29:35,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3931124106562703 [2023-08-25 17:29:35,686 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 605 transitions. [2023-08-25 17:29:35,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 605 transitions. [2023-08-25 17:29:35,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:29:35,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 605 transitions. [2023-08-25 17:29:35,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 67.22222222222223) internal successors, (605), 9 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:35,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:35,689 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:35,689 INFO L175 Difference]: Start difference. First operand has 433 places, 1422 transitions, 42165 flow. Second operand 9 states and 605 transitions. [2023-08-25 17:29:35,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 1508 transitions, 46869 flow [2023-08-25 17:29:37,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 1508 transitions, 46752 flow, removed 33 selfloop flow, removed 4 redundant places. [2023-08-25 17:29:38,108 INFO L231 Difference]: Finished difference. Result has 439 places, 1436 transitions, 43420 flow [2023-08-25 17:29:38,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=42063, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=453, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=963, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=43420, PETRI_PLACES=439, PETRI_TRANSITIONS=1436} [2023-08-25 17:29:38,110 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 400 predicate places. [2023-08-25 17:29:38,110 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 1436 transitions, 43420 flow [2023-08-25 17:29:38,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:38,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:29:38,110 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:29:38,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-25 17:29:38,110 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:29:38,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:29:38,110 INFO L85 PathProgramCache]: Analyzing trace with hash -906423947, now seen corresponding path program 5 times [2023-08-25 17:29:38,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:29:38,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999456877] [2023-08-25 17:29:38,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:29:38,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:29:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:29:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:29:44,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:29:44,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999456877] [2023-08-25 17:29:44,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999456877] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:29:44,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731715224] [2023-08-25 17:29:44,657 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-25 17:29:44,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:29:44,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:29:44,658 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 17:29:44,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-25 17:29:44,842 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-25 17:29:44,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 17:29:44,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-25 17:29:44,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:29:45,001 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 13 treesize of output 9 [2023-08-25 17:29:45,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 17:29:45,129 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 21 treesize of output 20 [2023-08-25 17:29:45,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-25 17:29:45,261 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-25 17:29:45,261 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 22 treesize of output 15 [2023-08-25 17:29:45,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-25 17:29:45,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:29:45,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:29:45,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:29:45,399 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 17:29:45,399 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 61 [2023-08-25 17:29:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 17:29:45,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 17:29:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:29:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731715224] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 17:29:48,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 17:29:48,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 16] total 40 [2023-08-25 17:29:48,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085229673] [2023-08-25 17:29:48,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:29:48,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:29:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:29:48,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:29:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1494, Unknown=0, NotChecked=0, Total=1640 [2023-08-25 17:29:48,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 171 [2023-08-25 17:29:48,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 1436 transitions, 43420 flow. Second operand has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:29:48,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:29:48,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 171 [2023-08-25 17:29:48,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:30:10,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 17:30:12,284 INFO L124 PetriNetUnfolderBase]: 3216/6915 cut-off events. [2023-08-25 17:30:12,285 INFO L125 PetriNetUnfolderBase]: For 423753/423753 co-relation queries the response was YES. [2023-08-25 17:30:12,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88413 conditions, 6915 events. 3216/6915 cut-off events. For 423753/423753 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 56812 event pairs, 634 based on Foata normal form. 2/6917 useless extension candidates. Maximal degree in co-relation 88228. Up to 5231 conditions per place. [2023-08-25 17:30:12,422 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 993 selfloop transitions, 490 changer transitions 24/1507 dead transitions. [2023-08-25 17:30:12,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 1507 transitions, 47866 flow [2023-08-25 17:30:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 17:30:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 17:30:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 608 transitions. [2023-08-25 17:30:12,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2023-08-25 17:30:12,426 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 608 transitions. [2023-08-25 17:30:12,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 608 transitions. [2023-08-25 17:30:12,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:30:12,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 608 transitions. [2023-08-25 17:30:12,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 67.55555555555556) internal successors, (608), 9 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:30:12,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:30:12,428 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:30:12,428 INFO L175 Difference]: Start difference. First operand has 439 places, 1436 transitions, 43420 flow. Second operand 9 states and 608 transitions. [2023-08-25 17:30:12,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 1507 transitions, 47866 flow [2023-08-25 17:30:14,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 1507 transitions, 47662 flow, removed 68 selfloop flow, removed 2 redundant places. [2023-08-25 17:30:14,812 INFO L231 Difference]: Finished difference. Result has 448 places, 1443 transitions, 44488 flow [2023-08-25 17:30:14,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=43234, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=484, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=44488, PETRI_PLACES=448, PETRI_TRANSITIONS=1443} [2023-08-25 17:30:14,814 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 409 predicate places. [2023-08-25 17:30:14,814 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 1443 transitions, 44488 flow [2023-08-25 17:30:14,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:30:14,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:30:14,814 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:30:14,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-25 17:30:15,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-08-25 17:30:15,019 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:30:15,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:30:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1726219637, now seen corresponding path program 6 times [2023-08-25 17:30:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:30:15,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974875616] [2023-08-25 17:30:15,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:30:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:30:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:30:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:30:15,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:30:15,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974875616] [2023-08-25 17:30:15,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974875616] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:30:15,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:30:15,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:30:15,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153256490] [2023-08-25 17:30:15,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:30:15,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:30:15,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:30:15,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:30:15,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:30:15,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 171 [2023-08-25 17:30:15,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 1443 transitions, 44488 flow. Second operand has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:30:15,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:30:15,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 171 [2023-08-25 17:30:15,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:30:19,675 INFO L124 PetriNetUnfolderBase]: 3214/6911 cut-off events. [2023-08-25 17:30:19,675 INFO L125 PetriNetUnfolderBase]: For 441472/441472 co-relation queries the response was YES. [2023-08-25 17:30:19,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89655 conditions, 6911 events. 3214/6911 cut-off events. For 441472/441472 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 56688 event pairs, 644 based on Foata normal form. 2/6913 useless extension candidates. Maximal degree in co-relation 89467. Up to 5056 conditions per place. [2023-08-25 17:30:19,805 INFO L140 encePairwiseOnDemand]: 155/171 looper letters, 1029 selfloop transitions, 452 changer transitions 23/1504 dead transitions. [2023-08-25 17:30:19,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 1504 transitions, 48670 flow [2023-08-25 17:30:19,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 17:30:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 17:30:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 590 transitions. [2023-08-25 17:30:19,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38336582196231317 [2023-08-25 17:30:19,806 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 590 transitions. [2023-08-25 17:30:19,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 590 transitions. [2023-08-25 17:30:19,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:30:19,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 590 transitions. [2023-08-25 17:30:19,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 65.55555555555556) internal successors, (590), 9 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:30:19,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:30:19,808 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:30:19,808 INFO L175 Difference]: Start difference. First operand has 448 places, 1443 transitions, 44488 flow. Second operand 9 states and 590 transitions. [2023-08-25 17:30:19,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 1504 transitions, 48670 flow [2023-08-25 17:30:22,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 1504 transitions, 48429 flow, removed 46 selfloop flow, removed 4 redundant places. [2023-08-25 17:30:22,211 INFO L231 Difference]: Finished difference. Result has 455 places, 1450 transitions, 45312 flow [2023-08-25 17:30:22,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=44254, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=445, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=45312, PETRI_PLACES=455, PETRI_TRANSITIONS=1450} [2023-08-25 17:30:22,213 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 416 predicate places. [2023-08-25 17:30:22,213 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 1450 transitions, 45312 flow [2023-08-25 17:30:22,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 56.22222222222222) internal successors, (506), 9 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:30:22,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:30:22,213 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:30:22,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-25 17:30:22,213 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:30:22,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:30:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1738282522, now seen corresponding path program 1 times [2023-08-25 17:30:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:30:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368546391] [2023-08-25 17:30:22,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:30:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:30:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:30:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:30:26,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:30:26,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368546391] [2023-08-25 17:30:26,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368546391] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:30:26,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630780134] [2023-08-25 17:30:26,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:30:26,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:30:26,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:30:26,138 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 17:30:26,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-25 17:30:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:30:26,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-25 17:30:26,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:30:26,437 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 13 treesize of output 9 [2023-08-25 17:30:26,482 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-25 17:30:26,482 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 22 treesize of output 15 [2023-08-25 17:30:26,533 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 17:30:26,585 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 23 treesize of output 22 [2023-08-25 17:30:26,597 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 21 treesize of output 20 [2023-08-25 17:30:26,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:26,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:26,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-25 17:30:26,688 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-25 17:30:26,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:26,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:26,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:26,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2023-08-25 17:30:26,775 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-25 17:30:26,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:26,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:26,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:26,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:26,854 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2023-08-25 17:30:27,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,066 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 88 [2023-08-25 17:30:27,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 17:30:27,128 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 17:30:27,128 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 98 [2023-08-25 17:30:51,331 WARN L234 SmtUtils]: Spent 14.07s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 17:30:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-25 17:30:51,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 17:31:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:31:06,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630780134] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 17:31:06,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 17:31:06,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [20, 16] total 46 [2023-08-25 17:31:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158065626] [2023-08-25 17:31:06,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:31:06,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 17:31:06,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:31:06,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 17:31:06,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1874, Unknown=5, NotChecked=0, Total=2162 [2023-08-25 17:31:06,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:31:06,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 1450 transitions, 45312 flow. Second operand has 13 states, 13 states have (on average 57.61538461538461) internal successors, (749), 13 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:31:06,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:31:06,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:31:06,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:31:53,972 INFO L124 PetriNetUnfolderBase]: 3257/7004 cut-off events. [2023-08-25 17:31:53,972 INFO L125 PetriNetUnfolderBase]: For 460011/460011 co-relation queries the response was YES. [2023-08-25 17:31:54,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91700 conditions, 7004 events. 3257/7004 cut-off events. For 460011/460011 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 57704 event pairs, 430 based on Foata normal form. 1/7005 useless extension candidates. Maximal degree in co-relation 91510. Up to 3983 conditions per place. [2023-08-25 17:31:54,109 INFO L140 encePairwiseOnDemand]: 152/171 looper letters, 1145 selfloop transitions, 467 changer transitions 15/1627 dead transitions. [2023-08-25 17:31:54,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 1627 transitions, 52542 flow [2023-08-25 17:31:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-25 17:31:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-25 17:31:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 861 transitions. [2023-08-25 17:31:54,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195906432748538 [2023-08-25 17:31:54,111 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 861 transitions. [2023-08-25 17:31:54,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 861 transitions. [2023-08-25 17:31:54,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:31:54,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 861 transitions. [2023-08-25 17:31:54,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 71.75) internal successors, (861), 12 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:31:54,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 171.0) internal successors, (2223), 13 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:31:54,113 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 171.0) internal successors, (2223), 13 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:31:54,113 INFO L175 Difference]: Start difference. First operand has 455 places, 1450 transitions, 45312 flow. Second operand 12 states and 861 transitions. [2023-08-25 17:31:54,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 1627 transitions, 52542 flow [2023-08-25 17:31:56,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 1627 transitions, 51302 flow, removed 47 selfloop flow, removed 6 redundant places. [2023-08-25 17:31:56,682 INFO L231 Difference]: Finished difference. Result has 463 places, 1485 transitions, 46336 flow [2023-08-25 17:31:56,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=44114, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=435, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=46336, PETRI_PLACES=463, PETRI_TRANSITIONS=1485} [2023-08-25 17:31:56,683 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 424 predicate places. [2023-08-25 17:31:56,683 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 1485 transitions, 46336 flow [2023-08-25 17:31:56,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 57.61538461538461) internal successors, (749), 13 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:31:56,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:31:56,683 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:31:56,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-25 17:31:56,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-08-25 17:31:56,884 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 17:31:56,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:31:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1418111816, now seen corresponding path program 2 times [2023-08-25 17:31:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:31:56,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518232607] [2023-08-25 17:31:56,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:31:56,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:31:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:31:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 17:31:57,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:31:57,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518232607] [2023-08-25 17:31:57,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518232607] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:31:57,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:31:57,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 17:31:57,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919259458] [2023-08-25 17:31:57,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:31:57,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 17:31:57,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:31:57,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 17:31:57,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-25 17:31:57,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 171 [2023-08-25 17:31:57,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 1485 transitions, 46336 flow. Second operand has 9 states, 9 states have (on average 58.333333333333336) internal successors, (525), 9 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:31:57,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:31:57,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 171 [2023-08-25 17:31:57,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-08-25 17:31:59,927 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 17:31:59,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 17:31:59,944 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2023-08-25 17:31:59,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-25 17:31:59,945 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/171 universal loopers) in iteration 35,while PetriNetUnfolder was constructing finite prefix that currently has 42689 conditions, 3193 events (1366/3192 cut-off events. For 244545/244545 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 27889 event pairs, 195 based on Foata normal form. 5/3591 useless extension candidates. Maximal degree in co-relation 42498. Up to 1581 conditions per place.). [2023-08-25 17:31:59,946 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-08-25 17:31:59,946 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-08-25 17:31:59,946 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-25 17:31:59,946 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-08-25 17:31:59,946 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-08-25 17:31:59,946 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-08-25 17:31:59,946 INFO L445 BasicCegarLoop]: Path program histogram: [8, 7, 6, 5, 2, 2, 2, 1, 1, 1] [2023-08-25 17:31:59,950 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 17:31:59,950 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 17:31:59,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 05:31:59 BasicIcfg [2023-08-25 17:31:59,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 17:31:59,952 INFO L158 Benchmark]: Toolchain (without parser) took 831409.36ms. Allocated memory was 375.4MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 350.3MB in the beginning and 3.0GB in the end (delta: -2.6GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-08-25 17:31:59,953 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 375.4MB. Free memory was 353.1MB in the beginning and 352.9MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 17:31:59,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.69ms. Allocated memory is still 375.4MB. Free memory was 350.3MB in the beginning and 322.2MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-25 17:31:59,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.12ms. Allocated memory is still 375.4MB. Free memory was 321.7MB in the beginning and 318.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 17:31:59,953 INFO L158 Benchmark]: Boogie Preprocessor took 46.73ms. Allocated memory is still 375.4MB. Free memory was 318.8MB in the beginning and 317.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 17:31:59,953 INFO L158 Benchmark]: RCFGBuilder took 439.21ms. Allocated memory is still 375.4MB. Free memory was 317.5MB in the beginning and 300.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-25 17:31:59,953 INFO L158 Benchmark]: TraceAbstraction took 830224.21ms. Allocated memory was 375.4MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 299.9MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-08-25 17:31:59,954 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 375.4MB. Free memory was 353.1MB in the beginning and 352.9MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 617.69ms. Allocated memory is still 375.4MB. Free memory was 350.3MB in the beginning and 322.2MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.12ms. Allocated memory is still 375.4MB. Free memory was 321.7MB in the beginning and 318.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.73ms. Allocated memory is still 375.4MB. Free memory was 318.8MB in the beginning and 317.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 439.21ms. Allocated memory is still 375.4MB. Free memory was 317.5MB in the beginning and 300.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 830224.21ms. Allocated memory was 375.4MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 299.9MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 249]: Unsoundness Warning unspecified type, defaulting to int C: short [249] - GenericResultAtLocation [Line: 249]: Unsoundness Warning unspecified type, defaulting to int C: short [249] - GenericResultAtLocation [Line: 741]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [741] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 98 PlacesBefore, 39 PlacesAfterwards, 98 TransitionsBefore, 36 TransitionsAfterwards, 2088 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 72 TotalNumberOfCompositions, 8674 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2415, independent: 2019, independent conditional: 0, independent unconditional: 2019, dependent: 396, dependent conditional: 0, dependent unconditional: 396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1009, independent: 950, independent conditional: 0, independent unconditional: 950, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2415, independent: 1069, independent conditional: 0, independent unconditional: 1069, dependent: 337, dependent conditional: 0, dependent unconditional: 337, unknown: 1009, unknown conditional: 0, unknown unconditional: 1009] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 931]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/171 universal loopers) in iteration 35,while PetriNetUnfolder was constructing finite prefix that currently has 42689 conditions, 3193 events (1366/3192 cut-off events. For 244545/244545 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 27889 event pairs, 195 based on Foata normal form. 5/3591 useless extension candidates. Maximal degree in co-relation 42498. Up to 1581 conditions per place.). - TimeoutResultAtElement [Line: 943]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/171 universal loopers) in iteration 35,while PetriNetUnfolder was constructing finite prefix that currently has 42689 conditions, 3193 events (1366/3192 cut-off events. For 244545/244545 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 27889 event pairs, 195 based on Foata normal form. 5/3591 useless extension candidates. Maximal degree in co-relation 42498. Up to 1581 conditions per place.). - TimeoutResultAtElement [Line: 943]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/171 universal loopers) in iteration 35,while PetriNetUnfolder was constructing finite prefix that currently has 42689 conditions, 3193 events (1366/3192 cut-off events. For 244545/244545 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 27889 event pairs, 195 based on Foata normal form. 5/3591 useless extension candidates. Maximal degree in co-relation 42498. Up to 1581 conditions per place.). - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/171 universal loopers) in iteration 35,while PetriNetUnfolder was constructing finite prefix that currently has 42689 conditions, 3193 events (1366/3192 cut-off events. For 244545/244545 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 27889 event pairs, 195 based on Foata normal form. 5/3591 useless extension candidates. Maximal degree in co-relation 42498. Up to 1581 conditions per place.). - TimeoutResultAtElement [Line: 931]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/171 universal loopers) in iteration 35,while PetriNetUnfolder was constructing finite prefix that currently has 42689 conditions, 3193 events (1366/3192 cut-off events. For 244545/244545 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 27889 event pairs, 195 based on Foata normal form. 5/3591 useless extension candidates. Maximal degree in co-relation 42498. Up to 1581 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 133 locations, 7 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: 830.1s, OverallIterations: 35, TraceHistogramMax: 10, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 584.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 53 mSolverCounterUnknown, 2524 SdHoareTripleChecker+Valid, 320.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2524 mSDsluCounter, 515 SdHoareTripleChecker+Invalid, 316.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 445 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 1169 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16599 IncrementalHoareTripleChecker+Invalid, 18266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1169 mSolverCounterUnsat, 374 mSDtfsCounter, 16599 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1092 GetRequests, 404 SyntacticMatches, 16 SemanticMatches, 672 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 4222 ImplicationChecksByTransitivity, 349.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46336occurred in iteration=34, InterpolantAutomatonStates: 369, 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, 1.0s SatisfiabilityAnalysisTime, 237.6s InterpolantComputationTime, 1286 NumberOfCodeBlocks, 1226 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1408 ConstructedInterpolants, 46 QuantifiedInterpolants, 80578 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2112 ConjunctsInSsa, 492 ConjunctsInUnsatCore, 55 InterpolantComputations, 33 PerfectInterpolantSequences, 1707/2583 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