/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 07:11:10,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 07:11:11,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 07:11:11,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 07:11:11,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 07:11:11,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 07:11:11,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 07:11:11,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 07:11:11,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 07:11:11,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 07:11:11,119 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 07:11:11,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 07:11:11,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 07:11:11,120 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 07:11:11,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 07:11:11,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 07:11:11,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 07:11:11,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 07:11:11,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 07:11:11,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 07:11:11,122 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 07:11:11,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 07:11:11,122 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 07:11:11,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 07:11:11,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 07:11:11,123 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 07:11:11,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 07:11:11,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 07:11:11,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 07:11:11,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 07:11:11,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 07:11:11,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 07:11:11,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 07:11:11,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 07:11:11,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 07:11:11,126 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 07:11:11,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 07:11:11,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 07:11:11,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 07:11:11,472 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 07:11:11,473 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 07:11:11,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2023-08-25 07:11:12,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 07:11:12,965 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 07:11:12,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2023-08-25 07:11:12,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd4095dd/b14a4120d1274fa5a41ff9c17e41f9e6/FLAG8778e9f57 [2023-08-25 07:11:12,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd4095dd/b14a4120d1274fa5a41ff9c17e41f9e6 [2023-08-25 07:11:12,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 07:11:12,988 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 07:11:12,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 07:11:12,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 07:11:12,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 07:11:12,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:11:12" (1/1) ... [2023-08-25 07:11:12,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145d6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:12, skipping insertion in model container [2023-08-25 07:11:12,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:11:12" (1/1) ... [2023-08-25 07:11:13,015 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 07:11:13,193 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 07:11:13,207 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 07:11:13,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 07:11:13,263 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 07:11:13,264 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 07:11:13,270 INFO L206 MainTranslator]: Completed translation [2023-08-25 07:11:13,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13 WrapperNode [2023-08-25 07:11:13,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 07:11:13,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 07:11:13,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 07:11:13,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 07:11:13,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13" (1/1) ... [2023-08-25 07:11:13,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13" (1/1) ... [2023-08-25 07:11:13,335 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 223 [2023-08-25 07:11:13,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 07:11:13,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 07:11:13,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 07:11:13,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 07:11:13,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13" (1/1) ... [2023-08-25 07:11:13,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13" (1/1) ... [2023-08-25 07:11:13,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13" (1/1) ... [2023-08-25 07:11:13,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13" (1/1) ... [2023-08-25 07:11:13,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13" (1/1) ... [2023-08-25 07:11:13,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13" (1/1) ... [2023-08-25 07:11:13,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13" (1/1) ... [2023-08-25 07:11:13,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13" (1/1) ... [2023-08-25 07:11:13,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 07:11:13,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 07:11:13,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 07:11:13,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 07:11:13,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13" (1/1) ... [2023-08-25 07:11:13,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 07:11:13,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:11:13,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 07:11:13,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 07:11:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 07:11:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 07:11:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 07:11:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 07:11:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 07:11:13,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 07:11:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 07:11:13,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 07:11:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 07:11:13,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 07:11:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 07:11:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 07:11:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 07:11:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 07:11:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 07:11:13,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 07:11:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 07:11:13,485 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 07:11:13,596 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 07:11:13,598 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 07:11:14,139 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 07:11:14,287 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 07:11:14,287 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-25 07:11:14,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:11:14 BoogieIcfgContainer [2023-08-25 07:11:14,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 07:11:14,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 07:11:14,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 07:11:14,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 07:11:14,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 07:11:12" (1/3) ... [2023-08-25 07:11:14,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e216f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:11:14, skipping insertion in model container [2023-08-25 07:11:14,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:11:13" (2/3) ... [2023-08-25 07:11:14,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e216f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:11:14, skipping insertion in model container [2023-08-25 07:11:14,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:11:14" (3/3) ... [2023-08-25 07:11:14,298 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2023-08-25 07:11:14,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 07:11:14,312 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2023-08-25 07:11:14,312 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 07:11:14,377 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-25 07:11:14,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 344 places, 354 transitions, 732 flow [2023-08-25 07:11:14,520 INFO L124 PetriNetUnfolderBase]: 20/351 cut-off events. [2023-08-25 07:11:14,520 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 07:11:14,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 351 events. 20/351 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 462 event pairs, 0 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 275. Up to 2 conditions per place. [2023-08-25 07:11:14,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 344 places, 354 transitions, 732 flow [2023-08-25 07:11:14,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 340 transitions, 698 flow [2023-08-25 07:11:14,543 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 07:11:14,551 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 330 places, 340 transitions, 698 flow [2023-08-25 07:11:14,554 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 330 places, 340 transitions, 698 flow [2023-08-25 07:11:14,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 330 places, 340 transitions, 698 flow [2023-08-25 07:11:14,632 INFO L124 PetriNetUnfolderBase]: 20/340 cut-off events. [2023-08-25 07:11:14,633 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 07:11:14,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 340 events. 20/340 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 463 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 275. Up to 2 conditions per place. [2023-08-25 07:11:14,644 INFO L119 LiptonReduction]: Number of co-enabled transitions 9904 [2023-08-25 07:11:28,166 INFO L134 LiptonReduction]: Checked pairs total: 61334 [2023-08-25 07:11:28,166 INFO L136 LiptonReduction]: Total number of compositions: 334 [2023-08-25 07:11:28,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 07:11:28,183 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;@4e285baf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 07:11:28,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2023-08-25 07:11:28,184 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 07:11:28,185 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 07:11:28,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 07:11:28,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:28,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 07:11:28,186 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:11:28,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1369, now seen corresponding path program 1 times [2023-08-25 07:11:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:28,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340644398] [2023-08-25 07:11:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:11:28,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:28,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340644398] [2023-08-25 07:11:28,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340644398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:28,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:28,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 07:11:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179598083] [2023-08-25 07:11:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:28,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 07:11:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:28,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 07:11:28,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 07:11:28,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 688 [2023-08-25 07:11:28,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 232 flow. Second operand has 2 states, 2 states have (on average 319.5) internal successors, (639), 2 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:28,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:28,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 688 [2023-08-25 07:11:28,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:28,667 INFO L124 PetriNetUnfolderBase]: 779/1983 cut-off events. [2023-08-25 07:11:28,667 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-08-25 07:11:28,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3091 conditions, 1983 events. 779/1983 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14593 event pairs, 384 based on Foata normal form. 338/1920 useless extension candidates. Maximal degree in co-relation 2706. Up to 1029 conditions per place. [2023-08-25 07:11:28,682 INFO L140 encePairwiseOnDemand]: 656/688 looper letters, 31 selfloop transitions, 0 changer transitions 0/75 dead transitions. [2023-08-25 07:11:28,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 75 transitions, 230 flow [2023-08-25 07:11:28,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 07:11:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 07:11:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 701 transitions. [2023-08-25 07:11:28,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094476744186046 [2023-08-25 07:11:28,701 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 701 transitions. [2023-08-25 07:11:28,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 701 transitions. [2023-08-25 07:11:28,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:28,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 701 transitions. [2023-08-25 07:11:28,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 350.5) internal successors, (701), 2 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:28,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 688.0) internal successors, (2064), 3 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:28,720 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 688.0) internal successors, (2064), 3 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:28,722 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 232 flow. Second operand 2 states and 701 transitions. [2023-08-25 07:11:28,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 75 transitions, 230 flow [2023-08-25 07:11:28,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 75 transitions, 218 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 07:11:28,730 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 156 flow [2023-08-25 07:11:28,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=156, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2023-08-25 07:11:28,735 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -34 predicate places. [2023-08-25 07:11:28,735 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 156 flow [2023-08-25 07:11:28,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 319.5) internal successors, (639), 2 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:28,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:28,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:28,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 07:11:28,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:11:28,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:28,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1295070944, now seen corresponding path program 1 times [2023-08-25 07:11:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:28,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392815204] [2023-08-25 07:11:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:28,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:11:28,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:28,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392815204] [2023-08-25 07:11:28,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392815204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:28,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:28,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:11:28,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100912226] [2023-08-25 07:11:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:28,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:11:28,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:28,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:11:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:11:28,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 688 [2023-08-25 07:11:28,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:28,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:28,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 688 [2023-08-25 07:11:28,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:29,209 INFO L124 PetriNetUnfolderBase]: 1570/3234 cut-off events. [2023-08-25 07:11:29,209 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-08-25 07:11:29,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 3234 events. 1570/3234 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 21698 event pairs, 1187 based on Foata normal form. 0/2623 useless extension candidates. Maximal degree in co-relation 5496. Up to 2213 conditions per place. [2023-08-25 07:11:29,229 INFO L140 encePairwiseOnDemand]: 684/688 looper letters, 35 selfloop transitions, 1 changer transitions 0/72 dead transitions. [2023-08-25 07:11:29,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 72 transitions, 222 flow [2023-08-25 07:11:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:11:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:11:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2023-08-25 07:11:29,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45203488372093026 [2023-08-25 07:11:29,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 933 transitions. [2023-08-25 07:11:29,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 933 transitions. [2023-08-25 07:11:29,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:29,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 933 transitions. [2023-08-25 07:11:29,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:29,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 688.0) internal successors, (2752), 4 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:29,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 688.0) internal successors, (2752), 4 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:29,240 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 156 flow. Second operand 3 states and 933 transitions. [2023-08-25 07:11:29,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 72 transitions, 222 flow [2023-08-25 07:11:29,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:11:29,242 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 152 flow [2023-08-25 07:11:29,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2023-08-25 07:11:29,243 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -35 predicate places. [2023-08-25 07:11:29,243 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 152 flow [2023-08-25 07:11:29,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:29,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:29,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:29,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 07:11:29,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:11:29,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:29,245 INFO L85 PathProgramCache]: Analyzing trace with hash -977065152, now seen corresponding path program 1 times [2023-08-25 07:11:29,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:29,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505047092] [2023-08-25 07:11:29,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:11:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:29,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505047092] [2023-08-25 07:11:29,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505047092] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:29,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:29,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:11:29,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36511585] [2023-08-25 07:11:29,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:29,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:11:29,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:29,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:11:29,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:11:29,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 688 [2023-08-25 07:11:29,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:29,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:29,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 688 [2023-08-25 07:11:29,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:29,664 INFO L124 PetriNetUnfolderBase]: 1100/2303 cut-off events. [2023-08-25 07:11:29,664 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-25 07:11:29,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 2303 events. 1100/2303 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 15144 event pairs, 158 based on Foata normal form. 0/1948 useless extension candidates. Maximal degree in co-relation 3812. Up to 1215 conditions per place. [2023-08-25 07:11:29,679 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 50 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-08-25 07:11:29,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 299 flow [2023-08-25 07:11:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:11:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:11:29,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 992 transitions. [2023-08-25 07:11:29,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2023-08-25 07:11:29,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 992 transitions. [2023-08-25 07:11:29,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 992 transitions. [2023-08-25 07:11:29,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:29,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 992 transitions. [2023-08-25 07:11:29,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:29,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 688.0) internal successors, (2752), 4 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:29,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 688.0) internal successors, (2752), 4 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:29,691 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 152 flow. Second operand 3 states and 992 transitions. [2023-08-25 07:11:29,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 299 flow [2023-08-25 07:11:29,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:11:29,694 INFO L231 Difference]: Finished difference. Result has 73 places, 73 transitions, 163 flow [2023-08-25 07:11:29,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2023-08-25 07:11:29,695 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -34 predicate places. [2023-08-25 07:11:29,695 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 163 flow [2023-08-25 07:11:29,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:29,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:29,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:29,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 07:11:29,696 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:11:29,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:29,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1619086085, now seen corresponding path program 1 times [2023-08-25 07:11:29,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:29,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059631284] [2023-08-25 07:11:29,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:29,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:11:30,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:30,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059631284] [2023-08-25 07:11:30,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059631284] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:30,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:30,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:11:30,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44234977] [2023-08-25 07:11:30,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:30,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:11:30,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:30,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:11:30,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:11:30,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 688 [2023-08-25 07:11:30,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 267.5) internal successors, (1605), 6 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:30,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:30,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 688 [2023-08-25 07:11:30,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:31,972 INFO L124 PetriNetUnfolderBase]: 10169/13782 cut-off events. [2023-08-25 07:11:31,972 INFO L125 PetriNetUnfolderBase]: For 1792/1813 co-relation queries the response was YES. [2023-08-25 07:11:31,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28859 conditions, 13782 events. 10169/13782 cut-off events. For 1792/1813 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 78424 event pairs, 2049 based on Foata normal form. 0/11475 useless extension candidates. Maximal degree in co-relation 28855. Up to 7220 conditions per place. [2023-08-25 07:11:32,057 INFO L140 encePairwiseOnDemand]: 681/688 looper letters, 164 selfloop transitions, 13 changer transitions 0/190 dead transitions. [2023-08-25 07:11:32,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 190 transitions, 794 flow [2023-08-25 07:11:32,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:11:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:11:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1758 transitions. [2023-08-25 07:11:32,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258720930232558 [2023-08-25 07:11:32,062 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1758 transitions. [2023-08-25 07:11:32,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1758 transitions. [2023-08-25 07:11:32,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:32,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1758 transitions. [2023-08-25 07:11:32,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:32,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:32,077 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:32,077 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 163 flow. Second operand 6 states and 1758 transitions. [2023-08-25 07:11:32,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 190 transitions, 794 flow [2023-08-25 07:11:32,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 190 transitions, 794 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:11:32,083 INFO L231 Difference]: Finished difference. Result has 83 places, 85 transitions, 273 flow [2023-08-25 07:11:32,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=83, PETRI_TRANSITIONS=85} [2023-08-25 07:11:32,085 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -24 predicate places. [2023-08-25 07:11:32,085 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 85 transitions, 273 flow [2023-08-25 07:11:32,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 267.5) internal successors, (1605), 6 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:32,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:32,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:32,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 07:11:32,087 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:11:32,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1652271964, now seen corresponding path program 1 times [2023-08-25 07:11:32,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:32,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136503742] [2023-08-25 07:11:32,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:11:32,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:32,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136503742] [2023-08-25 07:11:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136503742] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:32,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:32,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 07:11:32,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973872311] [2023-08-25 07:11:32,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:32,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 07:11:32,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:32,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 07:11:32,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 07:11:32,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 688 [2023-08-25 07:11:32,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 85 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 238.8) internal successors, (1194), 5 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:32,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:32,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 688 [2023-08-25 07:11:32,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:33,571 INFO L124 PetriNetUnfolderBase]: 5999/9614 cut-off events. [2023-08-25 07:11:33,572 INFO L125 PetriNetUnfolderBase]: For 9009/9251 co-relation queries the response was YES. [2023-08-25 07:11:33,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23541 conditions, 9614 events. 5999/9614 cut-off events. For 9009/9251 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 66269 event pairs, 2697 based on Foata normal form. 0/8092 useless extension candidates. Maximal degree in co-relation 23532. Up to 6670 conditions per place. [2023-08-25 07:11:33,648 INFO L140 encePairwiseOnDemand]: 678/688 looper letters, 102 selfloop transitions, 15 changer transitions 0/148 dead transitions. [2023-08-25 07:11:33,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 148 transitions, 763 flow [2023-08-25 07:11:33,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:11:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:11:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1506 transitions. [2023-08-25 07:11:33,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3648255813953488 [2023-08-25 07:11:33,654 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1506 transitions. [2023-08-25 07:11:33,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1506 transitions. [2023-08-25 07:11:33,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:33,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1506 transitions. [2023-08-25 07:11:33,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:33,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:33,668 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:33,668 INFO L175 Difference]: Start difference. First operand has 83 places, 85 transitions, 273 flow. Second operand 6 states and 1506 transitions. [2023-08-25 07:11:33,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 148 transitions, 763 flow [2023-08-25 07:11:33,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 148 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:11:33,696 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 375 flow [2023-08-25 07:11:33,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2023-08-25 07:11:33,698 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -15 predicate places. [2023-08-25 07:11:33,698 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 375 flow [2023-08-25 07:11:33,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 238.8) internal successors, (1194), 5 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:33,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:33,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:33,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 07:11:33,699 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:11:33,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash 476262221, now seen corresponding path program 1 times [2023-08-25 07:11:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:33,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617746710] [2023-08-25 07:11:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:33,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 07:11:34,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:34,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617746710] [2023-08-25 07:11:34,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617746710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:34,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:34,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:11:34,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861746842] [2023-08-25 07:11:34,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:34,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:11:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:34,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:11:34,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:11:34,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 688 [2023-08-25 07:11:34,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 263.8333333333333) internal successors, (1583), 6 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:34,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:34,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 688 [2023-08-25 07:11:34,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:36,646 INFO L124 PetriNetUnfolderBase]: 17976/24661 cut-off events. [2023-08-25 07:11:36,646 INFO L125 PetriNetUnfolderBase]: For 15959/16059 co-relation queries the response was YES. [2023-08-25 07:11:36,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61843 conditions, 24661 events. 17976/24661 cut-off events. For 15959/16059 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 150627 event pairs, 4985 based on Foata normal form. 0/21125 useless extension candidates. Maximal degree in co-relation 61829. Up to 16199 conditions per place. [2023-08-25 07:11:36,811 INFO L140 encePairwiseOnDemand]: 680/688 looper letters, 174 selfloop transitions, 26 changer transitions 0/210 dead transitions. [2023-08-25 07:11:36,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 210 transitions, 1239 flow [2023-08-25 07:11:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:11:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:11:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1708 transitions. [2023-08-25 07:11:36,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41375968992248063 [2023-08-25 07:11:36,818 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1708 transitions. [2023-08-25 07:11:36,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1708 transitions. [2023-08-25 07:11:36,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:36,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1708 transitions. [2023-08-25 07:11:36,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 284.6666666666667) internal successors, (1708), 6 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:36,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:36,828 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:36,828 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 375 flow. Second operand 6 states and 1708 transitions. [2023-08-25 07:11:36,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 210 transitions, 1239 flow [2023-08-25 07:11:36,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 210 transitions, 1239 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:11:36,913 INFO L231 Difference]: Finished difference. Result has 102 places, 123 transitions, 663 flow [2023-08-25 07:11:36,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=102, PETRI_TRANSITIONS=123} [2023-08-25 07:11:36,915 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -5 predicate places. [2023-08-25 07:11:36,918 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 123 transitions, 663 flow [2023-08-25 07:11:36,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.8333333333333) internal successors, (1583), 6 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:36,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:36,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:36,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 07:11:36,919 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:11:36,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1696449613, now seen corresponding path program 1 times [2023-08-25 07:11:36,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:36,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407980169] [2023-08-25 07:11:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:36,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:11:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:37,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407980169] [2023-08-25 07:11:37,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407980169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:37,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:37,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 07:11:37,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914687061] [2023-08-25 07:11:37,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:37,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 07:11:37,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:37,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 07:11:37,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 07:11:37,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 688 [2023-08-25 07:11:37,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 123 transitions, 663 flow. Second operand has 5 states, 5 states have (on average 252.4) internal successors, (1262), 5 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:37,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:37,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 688 [2023-08-25 07:11:37,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:37,934 INFO L124 PetriNetUnfolderBase]: 3543/7365 cut-off events. [2023-08-25 07:11:37,934 INFO L125 PetriNetUnfolderBase]: For 9328/9669 co-relation queries the response was YES. [2023-08-25 07:11:37,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17845 conditions, 7365 events. 3543/7365 cut-off events. For 9328/9669 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 60702 event pairs, 1371 based on Foata normal form. 112/6398 useless extension candidates. Maximal degree in co-relation 17826. Up to 4179 conditions per place. [2023-08-25 07:11:37,992 INFO L140 encePairwiseOnDemand]: 678/688 looper letters, 89 selfloop transitions, 12 changer transitions 0/148 dead transitions. [2023-08-25 07:11:37,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 148 transitions, 915 flow [2023-08-25 07:11:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:11:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:11:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1572 transitions. [2023-08-25 07:11:37,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3808139534883721 [2023-08-25 07:11:37,998 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1572 transitions. [2023-08-25 07:11:37,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1572 transitions. [2023-08-25 07:11:37,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:37,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1572 transitions. [2023-08-25 07:11:38,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:38,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:38,008 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:38,008 INFO L175 Difference]: Start difference. First operand has 102 places, 123 transitions, 663 flow. Second operand 6 states and 1572 transitions. [2023-08-25 07:11:38,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 148 transitions, 915 flow [2023-08-25 07:11:38,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 148 transitions, 875 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-08-25 07:11:38,030 INFO L231 Difference]: Finished difference. Result has 109 places, 122 transitions, 653 flow [2023-08-25 07:11:38,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=653, PETRI_PLACES=109, PETRI_TRANSITIONS=122} [2023-08-25 07:11:38,033 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 2 predicate places. [2023-08-25 07:11:38,033 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 122 transitions, 653 flow [2023-08-25 07:11:38,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 252.4) internal successors, (1262), 5 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:38,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:38,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:38,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 07:11:38,035 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:11:38,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:38,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1873163792, now seen corresponding path program 1 times [2023-08-25 07:11:38,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:38,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817327628] [2023-08-25 07:11:38,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:38,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 07:11:38,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:38,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817327628] [2023-08-25 07:11:38,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817327628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:38,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:38,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:11:38,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885065538] [2023-08-25 07:11:38,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:38,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:11:38,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:38,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:11:38,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:11:38,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 688 [2023-08-25 07:11:38,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 122 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:38,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:38,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 688 [2023-08-25 07:11:38,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:39,069 INFO L124 PetriNetUnfolderBase]: 4585/8118 cut-off events. [2023-08-25 07:11:39,069 INFO L125 PetriNetUnfolderBase]: For 15110/15983 co-relation queries the response was YES. [2023-08-25 07:11:39,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22557 conditions, 8118 events. 4585/8118 cut-off events. For 15110/15983 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 58783 event pairs, 388 based on Foata normal form. 91/7268 useless extension candidates. Maximal degree in co-relation 22535. Up to 4975 conditions per place. [2023-08-25 07:11:39,136 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 88 selfloop transitions, 31 changer transitions 0/166 dead transitions. [2023-08-25 07:11:39,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 166 transitions, 1182 flow [2023-08-25 07:11:39,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:11:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:11:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2023-08-25 07:11:39,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48158914728682173 [2023-08-25 07:11:39,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 994 transitions. [2023-08-25 07:11:39,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 994 transitions. [2023-08-25 07:11:39,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:39,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 994 transitions. [2023-08-25 07:11:39,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:39,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 688.0) internal successors, (2752), 4 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:39,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 688.0) internal successors, (2752), 4 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:39,146 INFO L175 Difference]: Start difference. First operand has 109 places, 122 transitions, 653 flow. Second operand 3 states and 994 transitions. [2023-08-25 07:11:39,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 166 transitions, 1182 flow [2023-08-25 07:11:39,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 166 transitions, 1164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-25 07:11:39,185 INFO L231 Difference]: Finished difference. Result has 108 places, 147 transitions, 1020 flow [2023-08-25 07:11:39,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1020, PETRI_PLACES=108, PETRI_TRANSITIONS=147} [2023-08-25 07:11:39,186 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 1 predicate places. [2023-08-25 07:11:39,186 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 147 transitions, 1020 flow [2023-08-25 07:11:39,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:39,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:39,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:39,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 07:11:39,187 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:11:39,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash -862635616, now seen corresponding path program 1 times [2023-08-25 07:11:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:39,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481243335] [2023-08-25 07:11:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 07:11:39,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:39,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481243335] [2023-08-25 07:11:39,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481243335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:39,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:39,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 07:11:39,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024718] [2023-08-25 07:11:39,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:39,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 07:11:39,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:39,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 07:11:39,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-25 07:11:39,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 688 [2023-08-25 07:11:39,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 147 transitions, 1020 flow. Second operand has 11 states, 11 states have (on average 240.72727272727272) internal successors, (2648), 11 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:39,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:39,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 688 [2023-08-25 07:11:39,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:42,757 INFO L124 PetriNetUnfolderBase]: 16682/22821 cut-off events. [2023-08-25 07:11:42,757 INFO L125 PetriNetUnfolderBase]: For 34005/34417 co-relation queries the response was YES. [2023-08-25 07:11:42,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67745 conditions, 22821 events. 16682/22821 cut-off events. For 34005/34417 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 140675 event pairs, 2101 based on Foata normal form. 513/20625 useless extension candidates. Maximal degree in co-relation 67723. Up to 7802 conditions per place. [2023-08-25 07:11:42,985 INFO L140 encePairwiseOnDemand]: 682/688 looper letters, 274 selfloop transitions, 8 changer transitions 0/294 dead transitions. [2023-08-25 07:11:42,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 294 transitions, 2276 flow [2023-08-25 07:11:42,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 07:11:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 07:11:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1829 transitions. [2023-08-25 07:11:42,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37977574750830567 [2023-08-25 07:11:42,990 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1829 transitions. [2023-08-25 07:11:42,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1829 transitions. [2023-08-25 07:11:42,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:42,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1829 transitions. [2023-08-25 07:11:42,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 261.2857142857143) internal successors, (1829), 7 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:43,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 688.0) internal successors, (5504), 8 states have internal predecessors, (5504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:43,001 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 688.0) internal successors, (5504), 8 states have internal predecessors, (5504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:43,001 INFO L175 Difference]: Start difference. First operand has 108 places, 147 transitions, 1020 flow. Second operand 7 states and 1829 transitions. [2023-08-25 07:11:43,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 294 transitions, 2276 flow [2023-08-25 07:11:43,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 294 transitions, 2263 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:11:43,187 INFO L231 Difference]: Finished difference. Result has 112 places, 146 transitions, 1019 flow [2023-08-25 07:11:43,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1019, PETRI_PLACES=112, PETRI_TRANSITIONS=146} [2023-08-25 07:11:43,187 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2023-08-25 07:11:43,188 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 146 transitions, 1019 flow [2023-08-25 07:11:43,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 240.72727272727272) internal successors, (2648), 11 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:43,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:43,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:43,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 07:11:43,189 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:11:43,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:43,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1086127665, now seen corresponding path program 1 times [2023-08-25 07:11:43,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:43,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239672537] [2023-08-25 07:11:43,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:43,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 07:11:44,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:44,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239672537] [2023-08-25 07:11:44,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239672537] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:44,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:44,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 07:11:44,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360275194] [2023-08-25 07:11:44,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:44,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 07:11:44,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:44,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 07:11:44,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-25 07:11:44,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 688 [2023-08-25 07:11:44,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 146 transitions, 1019 flow. Second operand has 9 states, 9 states have (on average 229.33333333333334) internal successors, (2064), 9 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:44,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:44,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 688 [2023-08-25 07:11:44,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:49,492 INFO L124 PetriNetUnfolderBase]: 35753/49303 cut-off events. [2023-08-25 07:11:49,492 INFO L125 PetriNetUnfolderBase]: For 80353/81100 co-relation queries the response was YES. [2023-08-25 07:11:49,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147578 conditions, 49303 events. 35753/49303 cut-off events. For 80353/81100 co-relation queries the response was YES. Maximal size of possible extension queue 1452. Compared 313272 event pairs, 6149 based on Foata normal form. 113/43842 useless extension candidates. Maximal degree in co-relation 147556. Up to 14578 conditions per place. [2023-08-25 07:11:49,955 INFO L140 encePairwiseOnDemand]: 676/688 looper letters, 319 selfloop transitions, 72 changer transitions 0/399 dead transitions. [2023-08-25 07:11:49,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 399 transitions, 3716 flow [2023-08-25 07:11:49,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 07:11:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 07:11:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2682 transitions. [2023-08-25 07:11:49,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35438689217758984 [2023-08-25 07:11:49,963 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2682 transitions. [2023-08-25 07:11:49,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2682 transitions. [2023-08-25 07:11:49,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:49,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2682 transitions. [2023-08-25 07:11:49,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 243.8181818181818) internal successors, (2682), 11 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:49,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 688.0) internal successors, (8256), 12 states have internal predecessors, (8256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:49,981 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 688.0) internal successors, (8256), 12 states have internal predecessors, (8256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:49,981 INFO L175 Difference]: Start difference. First operand has 112 places, 146 transitions, 1019 flow. Second operand 11 states and 2682 transitions. [2023-08-25 07:11:49,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 399 transitions, 3716 flow [2023-08-25 07:11:50,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 399 transitions, 3652 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 07:11:50,306 INFO L231 Difference]: Finished difference. Result has 121 places, 204 transitions, 1939 flow [2023-08-25 07:11:50,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1939, PETRI_PLACES=121, PETRI_TRANSITIONS=204} [2023-08-25 07:11:50,307 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 14 predicate places. [2023-08-25 07:11:50,307 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 204 transitions, 1939 flow [2023-08-25 07:11:50,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 229.33333333333334) internal successors, (2064), 9 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:50,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:50,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:50,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 07:11:50,308 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:11:50,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:50,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1448235429, now seen corresponding path program 2 times [2023-08-25 07:11:50,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:50,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99005955] [2023-08-25 07:11:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:50,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 07:11:51,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:51,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99005955] [2023-08-25 07:11:51,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99005955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:51,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:51,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 07:11:51,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978508919] [2023-08-25 07:11:51,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:51,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 07:11:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:51,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 07:11:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-25 07:11:51,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 688 [2023-08-25 07:11:51,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 204 transitions, 1939 flow. Second operand has 9 states, 9 states have (on average 229.33333333333334) internal successors, (2064), 9 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:51,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:51,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 688 [2023-08-25 07:11:51,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:59,259 INFO L124 PetriNetUnfolderBase]: 49148/67287 cut-off events. [2023-08-25 07:11:59,259 INFO L125 PetriNetUnfolderBase]: For 167092/167975 co-relation queries the response was YES. [2023-08-25 07:11:59,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221100 conditions, 67287 events. 49148/67287 cut-off events. For 167092/167975 co-relation queries the response was YES. Maximal size of possible extension queue 2016. Compared 443363 event pairs, 10091 based on Foata normal form. 121/60512 useless extension candidates. Maximal degree in co-relation 221074. Up to 42407 conditions per place. [2023-08-25 07:11:59,876 INFO L140 encePairwiseOnDemand]: 676/688 looper letters, 247 selfloop transitions, 141 changer transitions 0/396 dead transitions. [2023-08-25 07:11:59,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 396 transitions, 4067 flow [2023-08-25 07:11:59,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 07:11:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 07:11:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2448 transitions. [2023-08-25 07:11:59,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3558139534883721 [2023-08-25 07:11:59,883 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2448 transitions. [2023-08-25 07:11:59,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2448 transitions. [2023-08-25 07:11:59,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:59,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2448 transitions. [2023-08-25 07:11:59,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 244.8) internal successors, (2448), 10 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:59,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 688.0) internal successors, (7568), 11 states have internal predecessors, (7568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:59,897 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 688.0) internal successors, (7568), 11 states have internal predecessors, (7568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:59,897 INFO L175 Difference]: Start difference. First operand has 121 places, 204 transitions, 1939 flow. Second operand 10 states and 2448 transitions. [2023-08-25 07:11:59,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 396 transitions, 4067 flow [2023-08-25 07:12:00,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 396 transitions, 4048 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-25 07:12:00,672 INFO L231 Difference]: Finished difference. Result has 130 places, 258 transitions, 3094 flow [2023-08-25 07:12:00,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3094, PETRI_PLACES=130, PETRI_TRANSITIONS=258} [2023-08-25 07:12:00,673 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 23 predicate places. [2023-08-25 07:12:00,673 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 258 transitions, 3094 flow [2023-08-25 07:12:00,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 229.33333333333334) internal successors, (2064), 9 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:00,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:12:00,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:12:00,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 07:12:00,674 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:12:00,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:12:00,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1391483523, now seen corresponding path program 1 times [2023-08-25 07:12:00,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:12:00,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890904618] [2023-08-25 07:12:00,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:12:00,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:12:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:12:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:12:00,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:12:00,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890904618] [2023-08-25 07:12:00,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890904618] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:12:00,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:12:00,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:12:00,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792172088] [2023-08-25 07:12:00,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:12:00,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:12:00,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:12:00,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:12:00,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:12:00,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 688 [2023-08-25 07:12:00,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 258 transitions, 3094 flow. Second operand has 6 states, 6 states have (on average 268.8333333333333) internal successors, (1613), 6 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:00,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:12:00,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 688 [2023-08-25 07:12:00,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:12:08,513 INFO L124 PetriNetUnfolderBase]: 42184/58501 cut-off events. [2023-08-25 07:12:08,513 INFO L125 PetriNetUnfolderBase]: For 214562/217908 co-relation queries the response was YES. [2023-08-25 07:12:08,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209402 conditions, 58501 events. 42184/58501 cut-off events. For 214562/217908 co-relation queries the response was YES. Maximal size of possible extension queue 1885. Compared 389361 event pairs, 18181 based on Foata normal form. 822/53175 useless extension candidates. Maximal degree in co-relation 209372. Up to 53066 conditions per place. [2023-08-25 07:12:09,183 INFO L140 encePairwiseOnDemand]: 681/688 looper letters, 275 selfloop transitions, 21 changer transitions 0/315 dead transitions. [2023-08-25 07:12:09,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 315 transitions, 4102 flow [2023-08-25 07:12:09,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:12:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:12:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1685 transitions. [2023-08-25 07:12:09,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40818798449612403 [2023-08-25 07:12:09,189 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1685 transitions. [2023-08-25 07:12:09,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1685 transitions. [2023-08-25 07:12:09,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:12:09,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1685 transitions. [2023-08-25 07:12:09,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 280.8333333333333) internal successors, (1685), 6 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:09,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:09,199 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:09,199 INFO L175 Difference]: Start difference. First operand has 130 places, 258 transitions, 3094 flow. Second operand 6 states and 1685 transitions. [2023-08-25 07:12:09,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 315 transitions, 4102 flow [2023-08-25 07:12:11,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 315 transitions, 3951 flow, removed 68 selfloop flow, removed 4 redundant places. [2023-08-25 07:12:11,544 INFO L231 Difference]: Finished difference. Result has 136 places, 278 transitions, 3297 flow [2023-08-25 07:12:11,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=2959, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3297, PETRI_PLACES=136, PETRI_TRANSITIONS=278} [2023-08-25 07:12:11,544 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 29 predicate places. [2023-08-25 07:12:11,545 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 278 transitions, 3297 flow [2023-08-25 07:12:11,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 268.8333333333333) internal successors, (1613), 6 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:11,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:12:11,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:12:11,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 07:12:11,545 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:12:11,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:12:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash 968447700, now seen corresponding path program 1 times [2023-08-25 07:12:11,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:12:11,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707453758] [2023-08-25 07:12:11,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:12:11,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:12:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:12:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 07:12:11,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:12:11,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707453758] [2023-08-25 07:12:11,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707453758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:12:11,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:12:11,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:12:11,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994963689] [2023-08-25 07:12:11,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:12:11,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:12:11,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:12:11,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:12:11,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:12:11,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 688 [2023-08-25 07:12:11,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 278 transitions, 3297 flow. Second operand has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:11,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:12:11,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 688 [2023-08-25 07:12:11,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:12:20,353 INFO L124 PetriNetUnfolderBase]: 48713/66310 cut-off events. [2023-08-25 07:12:20,353 INFO L125 PetriNetUnfolderBase]: For 229392/232039 co-relation queries the response was YES. [2023-08-25 07:12:20,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230674 conditions, 66310 events. 48713/66310 cut-off events. For 229392/232039 co-relation queries the response was YES. Maximal size of possible extension queue 2041. Compared 433919 event pairs, 15682 based on Foata normal form. 2532/61714 useless extension candidates. Maximal degree in co-relation 230640. Up to 50700 conditions per place. [2023-08-25 07:12:21,156 INFO L140 encePairwiseOnDemand]: 681/688 looper letters, 351 selfloop transitions, 112 changer transitions 0/476 dead transitions. [2023-08-25 07:12:21,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 476 transitions, 6306 flow [2023-08-25 07:12:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:12:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:12:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1695 transitions. [2023-08-25 07:12:21,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106104651162791 [2023-08-25 07:12:21,161 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1695 transitions. [2023-08-25 07:12:21,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1695 transitions. [2023-08-25 07:12:21,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:12:21,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1695 transitions. [2023-08-25 07:12:21,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:21,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:21,171 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:21,171 INFO L175 Difference]: Start difference. First operand has 136 places, 278 transitions, 3297 flow. Second operand 6 states and 1695 transitions. [2023-08-25 07:12:21,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 476 transitions, 6306 flow [2023-08-25 07:12:23,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 476 transitions, 6282 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-25 07:12:23,202 INFO L231 Difference]: Finished difference. Result has 145 places, 384 transitions, 5343 flow [2023-08-25 07:12:23,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=3273, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5343, PETRI_PLACES=145, PETRI_TRANSITIONS=384} [2023-08-25 07:12:23,202 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 38 predicate places. [2023-08-25 07:12:23,203 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 384 transitions, 5343 flow [2023-08-25 07:12:23,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:23,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:12:23,203 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:12:23,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-25 07:12:23,203 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:12:23,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:12:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2874919, now seen corresponding path program 3 times [2023-08-25 07:12:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:12:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729530817] [2023-08-25 07:12:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:12:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:12:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:12:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:12:23,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:12:23,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729530817] [2023-08-25 07:12:23,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729530817] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:12:23,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339387446] [2023-08-25 07:12:23,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 07:12:23,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:12:23,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:12:23,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:12:23,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 07:12:23,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-25 07:12:23,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 07:12:23,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-25 07:12:23,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:12:23,694 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-25 07:12:23,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-25 07:12:23,754 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-25 07:12:23,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-25 07:12:23,799 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-25 07:12:23,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-25 07:12:23,981 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 07:12:24,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-25 07:12:24,066 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-25 07:12:24,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-08-25 07:12:24,208 INFO L322 Elim1Store]: treesize reduction 64, result has 31.2 percent of original size [2023-08-25 07:12:24,209 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 92 [2023-08-25 07:12:24,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2023-08-25 07:12:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 07:12:24,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 07:12:24,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339387446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:12:24,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 07:12:24,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 16 [2023-08-25 07:12:24,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342844695] [2023-08-25 07:12:24,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:12:24,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 07:12:24,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:12:24,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 07:12:24,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-08-25 07:12:24,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 688 [2023-08-25 07:12:24,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 384 transitions, 5343 flow. Second operand has 12 states, 12 states have (on average 234.75) internal successors, (2817), 12 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:24,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:12:24,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 688 [2023-08-25 07:12:24,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:12:33,919 INFO L124 PetriNetUnfolderBase]: 50593/69007 cut-off events. [2023-08-25 07:12:33,919 INFO L125 PetriNetUnfolderBase]: For 286088/289237 co-relation queries the response was YES. [2023-08-25 07:12:34,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257505 conditions, 69007 events. 50593/69007 cut-off events. For 286088/289237 co-relation queries the response was YES. Maximal size of possible extension queue 2018. Compared 452246 event pairs, 10195 based on Foata normal form. 1979/63855 useless extension candidates. Maximal degree in co-relation 257466. Up to 24530 conditions per place. [2023-08-25 07:12:34,912 INFO L140 encePairwiseOnDemand]: 676/688 looper letters, 547 selfloop transitions, 36 changer transitions 0/596 dead transitions. [2023-08-25 07:12:34,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 596 transitions, 8511 flow [2023-08-25 07:12:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 07:12:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 07:12:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2721 transitions. [2023-08-25 07:12:34,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35954016913319237 [2023-08-25 07:12:34,918 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2721 transitions. [2023-08-25 07:12:34,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2721 transitions. [2023-08-25 07:12:34,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:12:34,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2721 transitions. [2023-08-25 07:12:34,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 247.36363636363637) internal successors, (2721), 11 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:34,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 688.0) internal successors, (8256), 12 states have internal predecessors, (8256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:34,933 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 688.0) internal successors, (8256), 12 states have internal predecessors, (8256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:34,933 INFO L175 Difference]: Start difference. First operand has 145 places, 384 transitions, 5343 flow. Second operand 11 states and 2721 transitions. [2023-08-25 07:12:34,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 596 transitions, 8511 flow [2023-08-25 07:12:37,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 596 transitions, 8119 flow, removed 196 selfloop flow, removed 0 redundant places. [2023-08-25 07:12:37,731 INFO L231 Difference]: Finished difference. Result has 160 places, 391 transitions, 5245 flow [2023-08-25 07:12:37,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=5087, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5245, PETRI_PLACES=160, PETRI_TRANSITIONS=391} [2023-08-25 07:12:37,732 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 53 predicate places. [2023-08-25 07:12:37,732 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 391 transitions, 5245 flow [2023-08-25 07:12:37,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 234.75) internal successors, (2817), 12 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:37,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:12:37,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:12:37,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-25 07:12:37,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-25 07:12:37,937 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:12:37,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:12:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash 859619338, now seen corresponding path program 1 times [2023-08-25 07:12:37,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:12:37,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604815767] [2023-08-25 07:12:37,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:12:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:12:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:12:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:12:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:12:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604815767] [2023-08-25 07:12:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604815767] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:12:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885399502] [2023-08-25 07:12:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:12:38,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:12:38,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:12:38,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:12:38,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 07:12:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:12:38,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 07:12:38,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:12:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:12:38,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:12:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:12:38,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885399502] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 07:12:38,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 07:12:38,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-25 07:12:38,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549183642] [2023-08-25 07:12:38,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:12:38,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 07:12:38,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:12:38,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 07:12:38,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-25 07:12:38,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 688 [2023-08-25 07:12:38,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 391 transitions, 5245 flow. Second operand has 5 states, 5 states have (on average 239.6) internal successors, (1198), 5 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:38,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:12:38,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 688 [2023-08-25 07:12:38,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:12:43,963 INFO L124 PetriNetUnfolderBase]: 26034/38543 cut-off events. [2023-08-25 07:12:43,963 INFO L125 PetriNetUnfolderBase]: For 252826/259055 co-relation queries the response was YES. [2023-08-25 07:12:44,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156583 conditions, 38543 events. 26034/38543 cut-off events. For 252826/259055 co-relation queries the response was YES. Maximal size of possible extension queue 1243. Compared 270071 event pairs, 7179 based on Foata normal form. 1340/35589 useless extension candidates. Maximal degree in co-relation 156538. Up to 30514 conditions per place. [2023-08-25 07:12:44,484 INFO L140 encePairwiseOnDemand]: 681/688 looper letters, 364 selfloop transitions, 17 changer transitions 8/426 dead transitions. [2023-08-25 07:12:44,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 426 transitions, 6185 flow [2023-08-25 07:12:44,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 07:12:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 07:12:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1260 transitions. [2023-08-25 07:12:44,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36627906976744184 [2023-08-25 07:12:44,488 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1260 transitions. [2023-08-25 07:12:44,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1260 transitions. [2023-08-25 07:12:44,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:12:44,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1260 transitions. [2023-08-25 07:12:44,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:44,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 688.0) internal successors, (4128), 6 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:44,493 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 688.0) internal successors, (4128), 6 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:44,493 INFO L175 Difference]: Start difference. First operand has 160 places, 391 transitions, 5245 flow. Second operand 5 states and 1260 transitions. [2023-08-25 07:12:44,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 426 transitions, 6185 flow [2023-08-25 07:12:45,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 426 transitions, 6148 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 07:12:45,388 INFO L231 Difference]: Finished difference. Result has 161 places, 381 transitions, 5128 flow [2023-08-25 07:12:45,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=5065, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5128, PETRI_PLACES=161, PETRI_TRANSITIONS=381} [2023-08-25 07:12:45,389 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 54 predicate places. [2023-08-25 07:12:45,389 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 381 transitions, 5128 flow [2023-08-25 07:12:45,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 239.6) internal successors, (1198), 5 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:45,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:12:45,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:12:45,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-25 07:12:45,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-25 07:12:45,594 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:12:45,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:12:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash -820054564, now seen corresponding path program 1 times [2023-08-25 07:12:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:12:45,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407965687] [2023-08-25 07:12:45,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:12:45,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:12:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:12:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 07:12:46,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:12:46,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407965687] [2023-08-25 07:12:46,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407965687] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:12:46,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:12:46,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 07:12:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048290336] [2023-08-25 07:12:46,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:12:46,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-25 07:12:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:12:46,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-25 07:12:46,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-25 07:12:46,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 688 [2023-08-25 07:12:46,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 381 transitions, 5128 flow. Second operand has 8 states, 8 states have (on average 232.5) internal successors, (1860), 8 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:46,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:12:46,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 688 [2023-08-25 07:12:46,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:12:57,440 INFO L124 PetriNetUnfolderBase]: 56793/78132 cut-off events. [2023-08-25 07:12:57,440 INFO L125 PetriNetUnfolderBase]: For 314403/316176 co-relation queries the response was YES. [2023-08-25 07:12:58,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292912 conditions, 78132 events. 56793/78132 cut-off events. For 314403/316176 co-relation queries the response was YES. Maximal size of possible extension queue 2294. Compared 530964 event pairs, 15011 based on Foata normal form. 159/70328 useless extension candidates. Maximal degree in co-relation 292865. Up to 33539 conditions per place. [2023-08-25 07:12:58,395 INFO L140 encePairwiseOnDemand]: 677/688 looper letters, 507 selfloop transitions, 91 changer transitions 0/606 dead transitions. [2023-08-25 07:12:58,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 606 transitions, 8802 flow [2023-08-25 07:12:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 07:12:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 07:12:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1987 transitions. [2023-08-25 07:12:58,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36101017441860467 [2023-08-25 07:12:58,399 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1987 transitions. [2023-08-25 07:12:58,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1987 transitions. [2023-08-25 07:12:58,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:12:58,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1987 transitions. [2023-08-25 07:12:58,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 248.375) internal successors, (1987), 8 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:58,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 688.0) internal successors, (6192), 9 states have internal predecessors, (6192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:58,405 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 688.0) internal successors, (6192), 9 states have internal predecessors, (6192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:12:58,405 INFO L175 Difference]: Start difference. First operand has 161 places, 381 transitions, 5128 flow. Second operand 8 states and 1987 transitions. [2023-08-25 07:12:58,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 606 transitions, 8802 flow [2023-08-25 07:13:00,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 606 transitions, 8746 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-25 07:13:00,532 INFO L231 Difference]: Finished difference. Result has 165 places, 384 transitions, 5374 flow [2023-08-25 07:13:00,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=5078, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5374, PETRI_PLACES=165, PETRI_TRANSITIONS=384} [2023-08-25 07:13:00,533 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 58 predicate places. [2023-08-25 07:13:00,533 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 384 transitions, 5374 flow [2023-08-25 07:13:00,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 232.5) internal successors, (1860), 8 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:00,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:13:00,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:13:00,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 07:13:00,534 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:13:00,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:13:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1702914880, now seen corresponding path program 2 times [2023-08-25 07:13:00,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:13:00,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844332823] [2023-08-25 07:13:00,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:13:00,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:13:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:13:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 07:13:01,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:13:01,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844332823] [2023-08-25 07:13:01,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844332823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:13:01,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:13:01,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 07:13:01,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647600828] [2023-08-25 07:13:01,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:13:01,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 07:13:01,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:13:01,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 07:13:01,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-25 07:13:01,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 688 [2023-08-25 07:13:01,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 384 transitions, 5374 flow. Second operand has 9 states, 9 states have (on average 230.11111111111111) internal successors, (2071), 9 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:01,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:13:01,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 688 [2023-08-25 07:13:01,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:13:12,589 INFO L124 PetriNetUnfolderBase]: 56896/78318 cut-off events. [2023-08-25 07:13:12,589 INFO L125 PetriNetUnfolderBase]: For 320689/321908 co-relation queries the response was YES. [2023-08-25 07:13:13,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294499 conditions, 78318 events. 56896/78318 cut-off events. For 320689/321908 co-relation queries the response was YES. Maximal size of possible extension queue 2328. Compared 534495 event pairs, 11983 based on Foata normal form. 138/70429 useless extension candidates. Maximal degree in co-relation 294453. Up to 52767 conditions per place. [2023-08-25 07:13:13,539 INFO L140 encePairwiseOnDemand]: 678/688 looper letters, 347 selfloop transitions, 199 changer transitions 0/554 dead transitions. [2023-08-25 07:13:13,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 554 transitions, 8036 flow [2023-08-25 07:13:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 07:13:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 07:13:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1975 transitions. [2023-08-25 07:13:13,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35882994186046513 [2023-08-25 07:13:13,543 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1975 transitions. [2023-08-25 07:13:13,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1975 transitions. [2023-08-25 07:13:13,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:13:13,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1975 transitions. [2023-08-25 07:13:13,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 246.875) internal successors, (1975), 8 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:13,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 688.0) internal successors, (6192), 9 states have internal predecessors, (6192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:13,549 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 688.0) internal successors, (6192), 9 states have internal predecessors, (6192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:13,549 INFO L175 Difference]: Start difference. First operand has 165 places, 384 transitions, 5374 flow. Second operand 8 states and 1975 transitions. [2023-08-25 07:13:13,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 554 transitions, 8036 flow [2023-08-25 07:13:15,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 554 transitions, 7931 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-25 07:13:15,786 INFO L231 Difference]: Finished difference. Result has 168 places, 385 transitions, 5755 flow [2023-08-25 07:13:15,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=5270, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5755, PETRI_PLACES=168, PETRI_TRANSITIONS=385} [2023-08-25 07:13:15,786 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 61 predicate places. [2023-08-25 07:13:15,786 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 385 transitions, 5755 flow [2023-08-25 07:13:15,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 230.11111111111111) internal successors, (2071), 9 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:15,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:13:15,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:13:15,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-25 07:13:15,787 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:13:15,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:13:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash 956715521, now seen corresponding path program 1 times [2023-08-25 07:13:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:13:15,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207516486] [2023-08-25 07:13:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:13:15,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:13:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:13:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:13:16,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:13:16,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207516486] [2023-08-25 07:13:16,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207516486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:13:16,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:13:16,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:13:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567657329] [2023-08-25 07:13:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:13:16,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:13:16,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:13:16,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:13:16,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:13:16,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 688 [2023-08-25 07:13:16,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 385 transitions, 5755 flow. Second operand has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:16,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:13:16,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 688 [2023-08-25 07:13:16,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:13:25,358 INFO L124 PetriNetUnfolderBase]: 48150/66695 cut-off events. [2023-08-25 07:13:25,358 INFO L125 PetriNetUnfolderBase]: For 286801/291615 co-relation queries the response was YES. [2023-08-25 07:13:25,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255885 conditions, 66695 events. 48150/66695 cut-off events. For 286801/291615 co-relation queries the response was YES. Maximal size of possible extension queue 2072. Compared 452882 event pairs, 20102 based on Foata normal form. 1787/61375 useless extension candidates. Maximal degree in co-relation 255838. Up to 61550 conditions per place. [2023-08-25 07:13:26,225 INFO L140 encePairwiseOnDemand]: 683/688 looper letters, 377 selfloop transitions, 4 changer transitions 0/400 dead transitions. [2023-08-25 07:13:26,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 400 transitions, 6547 flow [2023-08-25 07:13:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:13:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:13:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1663 transitions. [2023-08-25 07:13:26,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40285852713178294 [2023-08-25 07:13:26,227 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1663 transitions. [2023-08-25 07:13:26,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1663 transitions. [2023-08-25 07:13:26,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:13:26,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1663 transitions. [2023-08-25 07:13:26,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 277.1666666666667) internal successors, (1663), 6 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:26,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:26,231 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:26,231 INFO L175 Difference]: Start difference. First operand has 168 places, 385 transitions, 5755 flow. Second operand 6 states and 1663 transitions. [2023-08-25 07:13:26,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 400 transitions, 6547 flow [2023-08-25 07:13:28,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 400 transitions, 6212 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 07:13:28,767 INFO L231 Difference]: Finished difference. Result has 166 places, 384 transitions, 5426 flow [2023-08-25 07:13:28,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=5418, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5426, PETRI_PLACES=166, PETRI_TRANSITIONS=384} [2023-08-25 07:13:28,768 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 59 predicate places. [2023-08-25 07:13:28,768 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 384 transitions, 5426 flow [2023-08-25 07:13:28,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:28,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:13:28,768 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:13:28,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-25 07:13:28,769 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:13:28,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:13:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash -905840664, now seen corresponding path program 3 times [2023-08-25 07:13:28,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:13:28,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547524038] [2023-08-25 07:13:28,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:13:28,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:13:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:13:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:13:28,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:13:28,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547524038] [2023-08-25 07:13:28,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547524038] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:13:28,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499862718] [2023-08-25 07:13:28,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 07:13:28,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:13:28,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:13:28,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:13:28,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 07:13:29,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-25 07:13:29,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 07:13:29,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-25 07:13:29,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:13:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:13:29,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:13:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:13:29,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499862718] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 07:13:29,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 07:13:29,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-25 07:13:29,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649027778] [2023-08-25 07:13:29,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 07:13:29,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-25 07:13:29,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:13:29,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-25 07:13:29,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-25 07:13:29,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 688 [2023-08-25 07:13:29,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 384 transitions, 5426 flow. Second operand has 14 states, 14 states have (on average 252.28571428571428) internal successors, (3532), 14 states have internal predecessors, (3532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:29,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:13:29,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 688 [2023-08-25 07:13:29,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:13:37,098 INFO L124 PetriNetUnfolderBase]: 26287/49144 cut-off events. [2023-08-25 07:13:37,098 INFO L125 PetriNetUnfolderBase]: For 456255/465478 co-relation queries the response was YES. [2023-08-25 07:13:37,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191573 conditions, 49144 events. 26287/49144 cut-off events. For 456255/465478 co-relation queries the response was YES. Maximal size of possible extension queue 1806. Compared 475298 event pairs, 5086 based on Foata normal form. 6648/51108 useless extension candidates. Maximal degree in co-relation 191526. Up to 19165 conditions per place. [2023-08-25 07:13:37,809 INFO L140 encePairwiseOnDemand]: 678/688 looper letters, 405 selfloop transitions, 207 changer transitions 0/672 dead transitions. [2023-08-25 07:13:37,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 672 transitions, 10808 flow [2023-08-25 07:13:37,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 07:13:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 07:13:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2357 transitions. [2023-08-25 07:13:37,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38065245478036175 [2023-08-25 07:13:37,811 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2357 transitions. [2023-08-25 07:13:37,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2357 transitions. [2023-08-25 07:13:37,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:13:37,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2357 transitions. [2023-08-25 07:13:37,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 261.8888888888889) internal successors, (2357), 9 states have internal predecessors, (2357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:37,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 688.0) internal successors, (6880), 10 states have internal predecessors, (6880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:37,817 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 688.0) internal successors, (6880), 10 states have internal predecessors, (6880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:37,817 INFO L175 Difference]: Start difference. First operand has 166 places, 384 transitions, 5426 flow. Second operand 9 states and 2357 transitions. [2023-08-25 07:13:37,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 672 transitions, 10808 flow [2023-08-25 07:13:39,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 672 transitions, 10799 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 07:13:39,211 INFO L231 Difference]: Finished difference. Result has 174 places, 578 transitions, 10189 flow [2023-08-25 07:13:39,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=5419, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10189, PETRI_PLACES=174, PETRI_TRANSITIONS=578} [2023-08-25 07:13:39,212 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 67 predicate places. [2023-08-25 07:13:39,212 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 578 transitions, 10189 flow [2023-08-25 07:13:39,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 252.28571428571428) internal successors, (3532), 14 states have internal predecessors, (3532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:13:39,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:13:39,212 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:13:39,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 07:13:39,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:13:39,413 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 07:13:39,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:13:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash -907894895, now seen corresponding path program 4 times [2023-08-25 07:13:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:13:39,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729531575] [2023-08-25 07:13:39,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:13:39,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:13:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:13:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 07:13:40,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:13:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729531575] [2023-08-25 07:13:40,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729531575] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:13:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102827522] [2023-08-25 07:13:40,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-25 07:13:40,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:13:40,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:13:40,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:13:40,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 07:18:41,810 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-25 07:18:41,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 07:18:41,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 99 conjunts are in the unsatisfiable core [2023-08-25 07:18:41,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:18:42,245 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 07:18:42,288 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 19 treesize of output 18 [2023-08-25 07:18:42,332 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:18:42,333 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-25 07:18:42,387 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:18:42,387 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 3 case distinctions, treesize of input 33 treesize of output 38 [2023-08-25 07:18:42,609 INFO L322 Elim1Store]: treesize reduction 168, result has 34.6 percent of original size [2023-08-25 07:18:42,610 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 151 treesize of output 157 [2023-08-25 07:18:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-25 07:18:42,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:19:34,614 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 07:19:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 07:19:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102827522] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 07:19:46,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 07:19:46,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 36 [2023-08-25 07:19:46,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255906988] [2023-08-25 07:19:46,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 07:19:46,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-25 07:19:46,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:19:46,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-25 07:19:46,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1157, Unknown=13, NotChecked=0, Total=1332 [2023-08-25 07:19:46,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 688 [2023-08-25 07:19:46,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 578 transitions, 10189 flow. Second operand has 37 states, 37 states have (on average 211.35135135135135) internal successors, (7820), 37 states have internal predecessors, (7820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:19:46,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:19:46,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 688 [2023-08-25 07:19:46,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:20:21,974 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse30 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse18 (+ .cse30 c_~B~0.offset 1)) (.cse0 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse17 (select |c_#race| c_~B~0.base)) (.cse29 (+ 2 .cse30 c_~B~0.offset)) (.cse24 (+ 3 .cse30 c_~B~0.offset))) (let ((.cse21 (store |c_#race| c_~B~0.base (store (store .cse17 .cse29 0) .cse24 0))) (.cse16 (+ .cse30 c_~B~0.offset)) (.cse2 (+ .cse0 c_~C~0.offset)) (.cse3 (+ .cse0 c_~C~0.offset 1)) (.cse7 (+ .cse0 c_~B~0.offset)) (.cse8 (+ .cse0 c_~B~0.offset 1)) (.cse9 (+ .cse0 2 c_~B~0.offset)) (.cse10 (+ .cse0 3 c_~B~0.offset)) (.cse11 (store |c_#race| c_~B~0.base (store (store (store .cse17 .cse18 0) .cse29 0) .cse24 0))) (.cse12 (+ c_~A~0.offset .cse0)) (.cse13 (+ c_~A~0.offset .cse0 1)) (.cse14 (+ c_~A~0.offset .cse0 2)) (.cse15 (+ c_~A~0.offset .cse0 3)) (.cse4 (+ .cse0 2 c_~C~0.offset)) (.cse5 (+ .cse0 3 c_~C~0.offset))) (and (not (= (+ 7 .cse0 c_~C~0.offset) c_~B~0.offset)) (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse1 (let ((.cse6 (store .cse11 ~A~0.base (store (store (store (store (select .cse11 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse6 c_~B~0.base (store (store (store (store (select .cse6 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse1 ~C~0.base (store (store (store (store (select .cse1 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse16) 0)) (not (= (+ c_~B~0.offset 1) .cse2)) (not (= (+ 3 c_~B~0.offset) .cse2)) (= (select .cse17 .cse18) 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse19 (let ((.cse20 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse20 c_~B~0.base (store (store (store (store (select .cse20 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse19 ~C~0.base (store (store (store (store (select .cse19 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse16) 0)) (not (= .cse3 c_~B~0.offset)) (not (= c_~B~0.offset .cse2)) (<= 1 c_thread2Thread1of1ForFork1_~i~1) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse22 (let ((.cse23 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse23 c_~B~0.base (store (store (store (store (select .cse23 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse22 ~C~0.base (store (store (store (store (select .cse22 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse24) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse25 (let ((.cse26 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse26 c_~B~0.base (store (store (store (store (select .cse26 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse25 ~C~0.base (store (store (store (store (select .cse25 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)) (not (= (+ 2 c_~B~0.offset) .cse2)) (= (select .cse17 .cse16) 0) (not (= (+ .cse0 6 c_~C~0.offset) c_~B~0.offset)) (= c_~B~0.offset 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse27 (let ((.cse28 (store .cse11 ~A~0.base (store (store (store (store (select .cse11 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse28 c_~B~0.base (store (store (store (store (select .cse28 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse27 ~C~0.base (store (store (store (store (select .cse27 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse24) 0)) (= c_~C~0.offset 0) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (not (= .cse4 c_~B~0.offset)) (= c_~A~0.offset 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (not (= .cse5 c_~B~0.offset)) (not (= (+ 5 .cse0 c_~C~0.offset) c_~B~0.offset)) (not (= (+ .cse0 c_~C~0.offset 4) c_~B~0.offset)))))) is different from true [2023-08-25 07:20:26,346 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse39 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse0 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse18 (+ .cse39 c_~B~0.offset 1)) (.cse17 (select |c_#race| c_~B~0.base)) (.cse34 (+ 2 .cse39 c_~B~0.offset)) (.cse27 (+ 3 .cse39 c_~B~0.offset))) (let ((.cse21 (store |c_#race| c_~B~0.base (store (store .cse17 .cse34 0) .cse27 0))) (.cse16 (+ .cse39 c_~B~0.offset)) (.cse11 (store |c_#race| c_~B~0.base (store (store (store .cse17 .cse18 0) .cse34 0) .cse27 0))) (.cse2 (+ .cse0 c_~C~0.offset)) (.cse3 (+ .cse0 c_~C~0.offset 1)) (.cse4 (+ .cse0 2 c_~C~0.offset)) (.cse5 (+ .cse0 3 c_~C~0.offset)) (.cse7 (+ .cse0 c_~B~0.offset)) (.cse8 (+ .cse0 c_~B~0.offset 1)) (.cse9 (+ .cse0 2 c_~B~0.offset)) (.cse10 (+ .cse0 3 c_~B~0.offset)) (.cse24 (store |c_#race| c_~B~0.base (store .cse17 .cse27 0))) (.cse12 (+ c_~A~0.offset .cse0)) (.cse13 (+ c_~A~0.offset .cse0 1)) (.cse14 (+ c_~A~0.offset .cse0 2)) (.cse15 (+ c_~A~0.offset .cse0 3))) (and (not (= (+ 7 .cse0 c_~C~0.offset) c_~B~0.offset)) (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse1 (let ((.cse6 (store .cse11 ~A~0.base (store (store (store (store (select .cse11 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse6 c_~B~0.base (store (store (store (store (select .cse6 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse1 ~C~0.base (store (store (store (store (select .cse1 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse16) 0)) (not (= (+ c_~B~0.offset 1) .cse2)) (not (= (+ 3 c_~B~0.offset) .cse2)) (= (select .cse17 .cse18) 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse19 (let ((.cse20 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse20 c_~B~0.base (store (store (store (store (select .cse20 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse19 ~C~0.base (store (store (store (store (select .cse19 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse16) 0)) (not (= .cse3 c_~B~0.offset)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse22 (let ((.cse23 (store .cse24 ~A~0.base (store (store (store (store (select .cse24 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse23 c_~B~0.base (store (store (store (store (select .cse23 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse22 ~C~0.base (store (store (store (store (select .cse22 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse16) 0)) (not (= c_~B~0.offset .cse2)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse25 (let ((.cse26 (store .cse24 ~A~0.base (store (store (store (store (select .cse24 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse26 c_~B~0.base (store (store (store (store (select .cse26 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse25 ~C~0.base (store (store (store (store (select .cse25 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse27) 0)) (<= 1 c_thread2Thread1of1ForFork1_~i~1) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse28 (let ((.cse29 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse29 c_~B~0.base (store (store (store (store (select .cse29 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse28 ~C~0.base (store (store (store (store (select .cse28 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse27) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse30 (let ((.cse31 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse31 c_~B~0.base (store (store (store (store (select .cse31 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse30 ~C~0.base (store (store (store (store (select .cse30 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)) (not (= (+ 2 c_~B~0.offset) .cse2)) (= (select .cse17 .cse16) 0) (not (= (+ .cse0 6 c_~C~0.offset) c_~B~0.offset)) (= c_~B~0.offset 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse32 (let ((.cse33 (store .cse24 ~A~0.base (store (store (store (store (select .cse24 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse33 c_~B~0.base (store (store (store (store (select .cse33 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse32 ~C~0.base (store (store (store (store (select .cse32 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse34) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse35 (let ((.cse36 (store .cse11 ~A~0.base (store (store (store (store (select .cse11 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse36 c_~B~0.base (store (store (store (store (select .cse36 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse35 ~C~0.base (store (store (store (store (select .cse35 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse27) 0)) (= c_~C~0.offset 0) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (not (= .cse4 c_~B~0.offset)) (= c_~A~0.offset 0) (= (select .cse17 .cse34) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (not (= .cse5 c_~B~0.offset)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse37 (let ((.cse38 (store .cse24 ~A~0.base (store (store (store (store (select .cse24 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse38 c_~B~0.base (store (store (store (store (select .cse38 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse37 ~C~0.base (store (store (store (store (select .cse37 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)) (not (= (+ 5 .cse0 c_~C~0.offset) c_~B~0.offset)) (not (= (+ .cse0 c_~C~0.offset 4) c_~B~0.offset)))))) is different from true [2023-08-25 07:20:30,060 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse47 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse0 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse19 (+ .cse47 c_~B~0.offset 1)) (.cse17 (select |c_#race| c_~B~0.base)) (.cse36 (+ 2 .cse47 c_~B~0.offset)) (.cse18 (+ 3 .cse47 c_~B~0.offset))) (let ((.cse22 (store |c_#race| c_~B~0.base (store (store .cse17 .cse36 0) .cse18 0))) (.cse16 (+ .cse47 c_~B~0.offset)) (.cse11 (store |c_#race| c_~B~0.base (store (store (store .cse17 .cse19 0) .cse36 0) .cse18 0))) (.cse25 (store |c_#race| c_~B~0.base (store .cse17 .cse18 0))) (.cse2 (+ .cse0 c_~C~0.offset)) (.cse3 (+ .cse0 c_~C~0.offset 1)) (.cse4 (+ .cse0 2 c_~C~0.offset)) (.cse5 (+ .cse0 3 c_~C~0.offset)) (.cse7 (+ .cse0 c_~B~0.offset)) (.cse8 (+ .cse0 c_~B~0.offset 1)) (.cse9 (+ .cse0 2 c_~B~0.offset)) (.cse10 (+ .cse0 3 c_~B~0.offset)) (.cse12 (+ c_~A~0.offset .cse0)) (.cse13 (+ c_~A~0.offset .cse0 1)) (.cse14 (+ c_~A~0.offset .cse0 2)) (.cse15 (+ c_~A~0.offset .cse0 3))) (and (not (= (+ 7 .cse0 c_~C~0.offset) c_~B~0.offset)) (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse1 (let ((.cse6 (store .cse11 ~A~0.base (store (store (store (store (select .cse11 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse6 c_~B~0.base (store (store (store (store (select .cse6 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse1 ~C~0.base (store (store (store (store (select .cse1 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse16) 0)) (= (select .cse17 .cse18) 0) (not (= (+ c_~B~0.offset 1) .cse2)) (not (= (+ 3 c_~B~0.offset) .cse2)) (= (select .cse17 .cse19) 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse20 (let ((.cse21 (store .cse22 ~A~0.base (store (store (store (store (select .cse22 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse21 c_~B~0.base (store (store (store (store (select .cse21 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse20 ~C~0.base (store (store (store (store (select .cse20 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse16) 0)) (not (= .cse3 c_~B~0.offset)) (= (select .cse17 3) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse23 (let ((.cse24 (store .cse25 ~A~0.base (store (store (store (store (select .cse25 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse24 c_~B~0.base (store (store (store (store (select .cse24 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse23 ~C~0.base (store (store (store (store (select .cse23 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse16) 0)) (not (= c_~B~0.offset .cse2)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse26 (let ((.cse27 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse27 c_~B~0.base (store (store (store (store (select .cse27 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse26 ~C~0.base (store (store (store (store (select .cse26 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse16) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse28 (let ((.cse29 (store .cse25 ~A~0.base (store (store (store (store (select .cse25 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse29 c_~B~0.base (store (store (store (store (select .cse29 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse28 ~C~0.base (store (store (store (store (select .cse28 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)) (= (select .cse17 0) 0) (<= 1 c_thread2Thread1of1ForFork1_~i~1) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse30 (let ((.cse31 (store .cse22 ~A~0.base (store (store (store (store (select .cse22 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse31 c_~B~0.base (store (store (store (store (select .cse31 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse30 ~C~0.base (store (store (store (store (select .cse30 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)) (= (select .cse17 1) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse32 (let ((.cse33 (store .cse22 ~A~0.base (store (store (store (store (select .cse22 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse33 c_~B~0.base (store (store (store (store (select .cse33 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse32 ~C~0.base (store (store (store (store (select .cse32 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse19) 0)) (not (= (+ 2 c_~B~0.offset) .cse2)) (= (select .cse17 .cse16) 0) (not (= (+ .cse0 6 c_~C~0.offset) c_~B~0.offset)) (= c_~B~0.offset 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse34 (let ((.cse35 (store .cse25 ~A~0.base (store (store (store (store (select .cse25 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse35 c_~B~0.base (store (store (store (store (select .cse35 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse34 ~C~0.base (store (store (store (store (select .cse34 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse36) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse37 (let ((.cse38 (store .cse11 ~A~0.base (store (store (store (store (select .cse11 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse38 c_~B~0.base (store (store (store (store (select .cse38 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse37 ~C~0.base (store (store (store (store (select .cse37 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)) (= c_~C~0.offset 0) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse39 (let ((.cse40 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse40 c_~B~0.base (store (store (store (store (select .cse40 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse39 ~C~0.base (store (store (store (store (select .cse39 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (not (= .cse4 c_~B~0.offset)) (= c_~A~0.offset 0) (= (select .cse17 .cse36) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (not (= .cse5 c_~B~0.offset)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse41 (let ((.cse42 (store .cse25 ~A~0.base (store (store (store (store (select .cse25 ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse42 c_~B~0.base (store (store (store (store (select .cse42 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse41 ~C~0.base (store (store (store (store (select .cse41 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse19) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse43 (let ((.cse44 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse44 c_~B~0.base (store (store (store (store (select .cse44 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse43 ~C~0.base (store (store (store (store (select .cse43 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse36) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse45 (let ((.cse46 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse12 0) .cse13 0) .cse14 0) .cse15 0)))) (store .cse46 c_~B~0.base (store (store (store (store (select .cse46 c_~B~0.base) .cse7 0) .cse8 0) .cse9 0) .cse10 0))))) (store .cse45 ~C~0.base (store (store (store (store (select .cse45 ~C~0.base) .cse2 v_ArrVal_1927) .cse3 v_ArrVal_1930) .cse4 v_ArrVal_1928) .cse5 v_ArrVal_1931))) c_~B~0.base) .cse19) 0)) (= (select .cse17 2) 0) (not (= (+ 5 .cse0 c_~C~0.offset) c_~B~0.offset)) (not (= (+ .cse0 c_~C~0.offset 4) c_~B~0.offset)))))) is different from true [2023-08-25 07:20:42,480 WARN L234 SmtUtils]: Spent 7.77s on a formula simplification. DAG size of input: 82 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:20:48,000 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse39 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse38 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse17 (+ .cse39 c_~B~0.offset 1)) (.cse16 (select |c_#race| c_~B~0.base)) (.cse33 (+ 2 .cse39 c_~B~0.offset)) (.cse26 (+ 3 .cse39 c_~B~0.offset))) (let ((.cse20 (store |c_#race| c_~B~0.base (store (store .cse16 .cse33 0) .cse26 0))) (.cse15 (+ .cse39 c_~B~0.offset)) (.cse10 (store |c_#race| c_~B~0.base (store (store (store .cse16 .cse17 0) .cse33 0) .cse26 0))) (.cse1 (+ .cse38 c_~C~0.offset)) (.cse2 (+ .cse38 c_~C~0.offset 1)) (.cse3 (+ .cse38 2 c_~C~0.offset)) (.cse4 (+ .cse38 3 c_~C~0.offset)) (.cse6 (+ .cse38 c_~B~0.offset)) (.cse7 (+ .cse38 c_~B~0.offset 1)) (.cse8 (+ .cse38 2 c_~B~0.offset)) (.cse9 (+ .cse38 3 c_~B~0.offset)) (.cse23 (store |c_#race| c_~B~0.base (store .cse16 .cse26 0))) (.cse11 (+ c_~A~0.offset .cse38)) (.cse12 (+ c_~A~0.offset .cse38 1)) (.cse13 (+ c_~A~0.offset .cse38 2)) (.cse14 (+ c_~A~0.offset .cse38 3))) (and (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (= (select .cse16 .cse17) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse18 (let ((.cse19 (store .cse20 ~A~0.base (store (store (store (store (select .cse20 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse19 c_~B~0.base (store (store (store (store (select .cse19 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse18 ~C~0.base (store (store (store (store (select .cse18 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse21 (let ((.cse22 (store .cse23 ~A~0.base (store (store (store (store (select .cse23 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse22 c_~B~0.base (store (store (store (store (select .cse22 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse21 ~C~0.base (store (store (store (store (select .cse21 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse24 (let ((.cse25 (store .cse23 ~A~0.base (store (store (store (store (select .cse23 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse25 c_~B~0.base (store (store (store (store (select .cse25 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse24 ~C~0.base (store (store (store (store (select .cse24 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse26) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse27 (let ((.cse28 (store .cse20 ~A~0.base (store (store (store (store (select .cse20 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse28 c_~B~0.base (store (store (store (store (select .cse28 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse27 ~C~0.base (store (store (store (store (select .cse27 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse26) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse29 (let ((.cse30 (store .cse20 ~A~0.base (store (store (store (store (select .cse20 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse30 c_~B~0.base (store (store (store (store (select .cse30 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse29 ~C~0.base (store (store (store (store (select .cse29 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)) (= (select .cse16 .cse15) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse31 (let ((.cse32 (store .cse23 ~A~0.base (store (store (store (store (select .cse23 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse32 c_~B~0.base (store (store (store (store (select .cse32 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse31 ~C~0.base (store (store (store (store (select .cse31 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse33) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse34 (let ((.cse35 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse35 c_~B~0.base (store (store (store (store (select .cse35 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse34 ~C~0.base (store (store (store (store (select .cse34 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse26) 0)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (= (select .cse16 .cse33) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse36 (let ((.cse37 (store .cse23 ~A~0.base (store (store (store (store (select .cse23 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse37 c_~B~0.base (store (store (store (store (select .cse37 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse36 ~C~0.base (store (store (store (store (select .cse36 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)))))) is different from true [2023-08-25 07:20:51,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:20:53,316 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 07:20:56,118 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse31 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse30 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse16 (select |c_#race| c_~B~0.base)) (.cse18 (+ .cse31 c_~B~0.offset 1)) (.cse25 (+ 2 .cse31 c_~B~0.offset)) (.cse17 (+ 3 .cse31 c_~B~0.offset))) (let ((.cse15 (+ .cse31 c_~B~0.offset)) (.cse10 (store |c_#race| c_~B~0.base (store (store (store .cse16 .cse18 0) .cse25 0) .cse17 0))) (.cse1 (+ .cse30 c_~C~0.offset)) (.cse2 (+ .cse30 c_~C~0.offset 1)) (.cse3 (+ .cse30 2 c_~C~0.offset)) (.cse4 (+ .cse30 3 c_~C~0.offset)) (.cse6 (+ .cse30 c_~B~0.offset)) (.cse7 (+ .cse30 c_~B~0.offset 1)) (.cse8 (+ .cse30 2 c_~B~0.offset)) (.cse9 (+ .cse30 3 c_~B~0.offset)) (.cse11 (+ c_~A~0.offset .cse30)) (.cse12 (+ c_~A~0.offset .cse30 1)) (.cse13 (+ c_~A~0.offset .cse30 2)) (.cse14 (+ c_~A~0.offset .cse30 3))) (and (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (= (select .cse16 .cse17) 0) (= (select .cse16 .cse18) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse19 (let ((.cse20 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse20 c_~B~0.base (store (store (store (store (select .cse20 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse19 ~C~0.base (store (store (store (store (select .cse19 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (= (select .cse16 .cse15) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse21 (let ((.cse22 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse22 c_~B~0.base (store (store (store (store (select .cse22 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse21 ~C~0.base (store (store (store (store (select .cse21 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse23 (let ((.cse24 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse24 c_~B~0.base (store (store (store (store (select .cse24 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse23 ~C~0.base (store (store (store (store (select .cse23 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (= (select .cse16 .cse25) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse26 (let ((.cse27 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse27 c_~B~0.base (store (store (store (store (select .cse27 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse26 ~C~0.base (store (store (store (store (select .cse26 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse25) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse28 (let ((.cse29 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse29 c_~B~0.base (store (store (store (store (select .cse29 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse28 ~C~0.base (store (store (store (store (select .cse28 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)))))) is different from true [2023-08-25 07:21:00,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:21:14,470 WARN L234 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 82 DAG size of output: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:21:19,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:21:21,893 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 07:21:32,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:21:34,701 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 07:21:37,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:21:42,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:21:44,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:21:46,929 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 07:22:01,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:22:03,711 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 07:22:05,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:22:07,948 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 07:22:11,083 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 07:22:13,181 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse38 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse37 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse18 (+ .cse38 c_~B~0.offset 1)) (.cse16 (select |c_#race| c_~B~0.base)) (.cse32 (+ 2 .cse38 c_~B~0.offset)) (.cse17 (+ 3 .cse38 c_~B~0.offset))) (let ((.cse21 (store |c_#race| c_~B~0.base (store (store .cse16 .cse32 0) .cse17 0))) (.cse15 (+ .cse38 c_~B~0.offset)) (.cse10 (store |c_#race| c_~B~0.base (store (store (store .cse16 .cse18 0) .cse32 0) .cse17 0))) (.cse1 (+ .cse37 c_~C~0.offset)) (.cse2 (+ .cse37 c_~C~0.offset 1)) (.cse3 (+ .cse37 2 c_~C~0.offset)) (.cse4 (+ .cse37 3 c_~C~0.offset)) (.cse6 (+ .cse37 c_~B~0.offset)) (.cse7 (+ .cse37 c_~B~0.offset 1)) (.cse8 (+ .cse37 2 c_~B~0.offset)) (.cse9 (+ .cse37 3 c_~B~0.offset)) (.cse11 (+ c_~A~0.offset .cse37)) (.cse12 (+ c_~A~0.offset .cse37 1)) (.cse13 (+ c_~A~0.offset .cse37 2)) (.cse14 (+ c_~A~0.offset .cse37 3))) (and (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (= (select .cse16 .cse17) 0) (= (select .cse16 .cse18) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse19 (let ((.cse20 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse20 c_~B~0.base (store (store (store (store (select .cse20 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse19 ~C~0.base (store (store (store (store (select .cse19 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse22 (let ((.cse23 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse23 c_~B~0.base (store (store (store (store (select .cse23 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse22 ~C~0.base (store (store (store (store (select .cse22 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse24 (let ((.cse25 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse25 c_~B~0.base (store (store (store (store (select .cse25 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse24 ~C~0.base (store (store (store (store (select .cse24 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse26 (let ((.cse27 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse27 c_~B~0.base (store (store (store (store (select .cse27 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse26 ~C~0.base (store (store (store (store (select .cse26 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)) (= (select .cse16 .cse15) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse28 (let ((.cse29 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse29 c_~B~0.base (store (store (store (store (select .cse29 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse28 ~C~0.base (store (store (store (store (select .cse28 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse30 (let ((.cse31 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse31 c_~B~0.base (store (store (store (store (select .cse31 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse30 ~C~0.base (store (store (store (store (select .cse30 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (= (select .cse16 .cse32) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse33 (let ((.cse34 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse34 c_~B~0.base (store (store (store (store (select .cse34 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse33 ~C~0.base (store (store (store (store (select .cse33 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse32) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse35 (let ((.cse36 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse36 c_~B~0.base (store (store (store (store (select .cse36 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse35 ~C~0.base (store (store (store (store (select .cse35 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)))))) is different from true [2023-08-25 07:22:15,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 [1] [2023-08-25 07:22:17,200 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 07:22:25,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:22:27,745 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 07:22:30,295 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 07:22:32,304 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 07:22:34,316 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 07:22:35,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:22:37,412 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 07:22:39,419 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 07:22:55,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:22:57,897 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 07:22:59,906 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 07:23:01,918 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 07:23:04,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:06,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:08,226 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 07:23:17,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:19,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:21,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:23,802 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 07:23:32,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:34,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:36,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:38,968 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 07:23:41,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:43,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:45,659 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 07:23:47,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:50,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:52,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:54,249 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 07:23:57,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:23:59,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:01,614 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 07:24:04,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:07,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:11,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:13,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:15,841 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 07:24:18,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:20,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:22,948 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 07:24:26,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:29,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:31,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:33,139 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 07:24:35,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:37,801 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse47 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse46 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse18 (+ .cse47 c_~B~0.offset 1)) (.cse16 (select |c_#race| c_~B~0.base)) (.cse35 (+ 2 .cse47 c_~B~0.offset)) (.cse17 (+ 3 .cse47 c_~B~0.offset))) (let ((.cse21 (store |c_#race| c_~B~0.base (store (store .cse16 .cse35 0) .cse17 0))) (.cse15 (+ .cse47 c_~B~0.offset)) (.cse10 (store |c_#race| c_~B~0.base (store (store (store .cse16 .cse18 0) .cse35 0) .cse17 0))) (.cse24 (store |c_#race| c_~B~0.base (store .cse16 .cse17 0))) (.cse1 (+ .cse46 c_~C~0.offset)) (.cse2 (+ .cse46 c_~C~0.offset 1)) (.cse3 (+ .cse46 2 c_~C~0.offset)) (.cse4 (+ .cse46 3 c_~C~0.offset)) (.cse6 (+ .cse46 c_~B~0.offset)) (.cse7 (+ .cse46 c_~B~0.offset 1)) (.cse8 (+ .cse46 2 c_~B~0.offset)) (.cse9 (+ .cse46 3 c_~B~0.offset)) (.cse11 (+ c_~A~0.offset .cse46)) (.cse12 (+ c_~A~0.offset .cse46 1)) (.cse13 (+ c_~A~0.offset .cse46 2)) (.cse14 (+ c_~A~0.offset .cse46 3))) (and (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (= (select .cse16 .cse17) 0) (= (select .cse16 .cse18) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse19 (let ((.cse20 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse20 c_~B~0.base (store (store (store (store (select .cse20 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse19 ~C~0.base (store (store (store (store (select .cse19 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse22 (let ((.cse23 (store .cse24 ~A~0.base (store (store (store (store (select .cse24 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse23 c_~B~0.base (store (store (store (store (select .cse23 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse22 ~C~0.base (store (store (store (store (select .cse22 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse25 (let ((.cse26 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse26 c_~B~0.base (store (store (store (store (select .cse26 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse25 ~C~0.base (store (store (store (store (select .cse25 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse27 (let ((.cse28 (store .cse24 ~A~0.base (store (store (store (store (select .cse24 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse28 c_~B~0.base (store (store (store (store (select .cse28 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse27 ~C~0.base (store (store (store (store (select .cse27 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse29 (let ((.cse30 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse30 c_~B~0.base (store (store (store (store (select .cse30 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse29 ~C~0.base (store (store (store (store (select .cse29 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse31 (let ((.cse32 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse32 c_~B~0.base (store (store (store (store (select .cse32 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse31 ~C~0.base (store (store (store (store (select .cse31 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)) (= (select .cse16 .cse15) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse33 (let ((.cse34 (store .cse24 ~A~0.base (store (store (store (store (select .cse24 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse34 c_~B~0.base (store (store (store (store (select .cse34 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse33 ~C~0.base (store (store (store (store (select .cse33 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse35) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse36 (let ((.cse37 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse37 c_~B~0.base (store (store (store (store (select .cse37 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse36 ~C~0.base (store (store (store (store (select .cse36 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse38 (let ((.cse39 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse39 c_~B~0.base (store (store (store (store (select .cse39 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse38 ~C~0.base (store (store (store (store (select .cse38 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (= (select .cse16 .cse35) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse40 (let ((.cse41 (store .cse24 ~A~0.base (store (store (store (store (select .cse24 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse41 c_~B~0.base (store (store (store (store (select .cse41 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse40 ~C~0.base (store (store (store (store (select .cse40 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse42 (let ((.cse43 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse43 c_~B~0.base (store (store (store (store (select .cse43 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse42 ~C~0.base (store (store (store (store (select .cse42 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse35) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse44 (let ((.cse45 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse45 c_~B~0.base (store (store (store (store (select .cse45 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse44 ~C~0.base (store (store (store (store (select .cse44 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)))))) is different from true [2023-08-25 07:24:40,672 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 07:24:43,845 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 07:24:52,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:54,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:24:56,860 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] Received shutdown request... [2023-08-25 07:24:58,015 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 07:24:58,015 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 07:24:59,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 07:24:59,217 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-25 07:24:59,232 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (65 of 66 remaining) [2023-08-25 07:24:59,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-25 07:24:59,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-25 07:24:59,233 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-25 07:24:59,234 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (64 of 66 remaining) [2023-08-25 07:24:59,235 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (63 of 66 remaining) [2023-08-25 07:24:59,235 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (62 of 66 remaining) [2023-08-25 07:24:59,235 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (61 of 66 remaining) [2023-08-25 07:24:59,235 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (60 of 66 remaining) [2023-08-25 07:24:59,235 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (59 of 66 remaining) [2023-08-25 07:24:59,235 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (58 of 66 remaining) [2023-08-25 07:24:59,235 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (57 of 66 remaining) [2023-08-25 07:24:59,235 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (56 of 66 remaining) [2023-08-25 07:24:59,236 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (55 of 66 remaining) [2023-08-25 07:24:59,236 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (54 of 66 remaining) [2023-08-25 07:24:59,236 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (53 of 66 remaining) [2023-08-25 07:24:59,236 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (52 of 66 remaining) [2023-08-25 07:24:59,236 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (51 of 66 remaining) [2023-08-25 07:24:59,236 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (50 of 66 remaining) [2023-08-25 07:24:59,236 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (49 of 66 remaining) [2023-08-25 07:24:59,236 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (48 of 66 remaining) [2023-08-25 07:24:59,236 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (47 of 66 remaining) [2023-08-25 07:24:59,236 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (46 of 66 remaining) [2023-08-25 07:24:59,237 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (45 of 66 remaining) [2023-08-25 07:24:59,237 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (44 of 66 remaining) [2023-08-25 07:24:59,237 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (43 of 66 remaining) [2023-08-25 07:24:59,237 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (42 of 66 remaining) [2023-08-25 07:24:59,237 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 66 remaining) [2023-08-25 07:24:59,237 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 66 remaining) [2023-08-25 07:24:59,237 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 66 remaining) [2023-08-25 07:24:59,237 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 66 remaining) [2023-08-25 07:24:59,237 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 66 remaining) [2023-08-25 07:24:59,237 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 66 remaining) [2023-08-25 07:24:59,237 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 66 remaining) [2023-08-25 07:24:59,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 66 remaining) [2023-08-25 07:24:59,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 66 remaining) [2023-08-25 07:24:59,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (32 of 66 remaining) [2023-08-25 07:24:59,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 66 remaining) [2023-08-25 07:24:59,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (30 of 66 remaining) [2023-08-25 07:24:59,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (29 of 66 remaining) [2023-08-25 07:24:59,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (28 of 66 remaining) [2023-08-25 07:24:59,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (27 of 66 remaining) [2023-08-25 07:24:59,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 66 remaining) [2023-08-25 07:24:59,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONASSERT (25 of 66 remaining) [2023-08-25 07:24:59,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 66 remaining) [2023-08-25 07:24:59,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 66 remaining) [2023-08-25 07:24:59,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 66 remaining) [2023-08-25 07:24:59,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 66 remaining) [2023-08-25 07:24:59,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 66 remaining) [2023-08-25 07:24:59,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 66 remaining) [2023-08-25 07:24:59,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 66 remaining) [2023-08-25 07:24:59,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (17 of 66 remaining) [2023-08-25 07:24:59,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 66 remaining) [2023-08-25 07:24:59,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 66 remaining) [2023-08-25 07:24:59,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (14 of 66 remaining) [2023-08-25 07:24:59,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 66 remaining) [2023-08-25 07:24:59,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 66 remaining) [2023-08-25 07:24:59,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 66 remaining) [2023-08-25 07:24:59,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 66 remaining) [2023-08-25 07:24:59,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 66 remaining) [2023-08-25 07:24:59,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (8 of 66 remaining) [2023-08-25 07:24:59,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (7 of 66 remaining) [2023-08-25 07:24:59,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 66 remaining) [2023-08-25 07:24:59,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 66 remaining) [2023-08-25 07:24:59,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 66 remaining) [2023-08-25 07:24:59,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 66 remaining) [2023-08-25 07:24:59,241 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 66 remaining) [2023-08-25 07:24:59,241 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 66 remaining) [2023-08-25 07:24:59,241 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 66 remaining) [2023-08-25 07:24:59,241 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:24:59,246 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 07:24:59,246 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 07:24:59,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 07:24:59 BasicIcfg [2023-08-25 07:24:59,249 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 07:24:59,249 INFO L158 Benchmark]: Toolchain (without parser) took 826261.37ms. Allocated memory was 375.4MB in the beginning and 15.7GB in the end (delta: 15.4GB). Free memory was 351.1MB in the beginning and 14.0GB in the end (delta: -13.6GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2023-08-25 07:24:59,249 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 375.4MB. Free memory is still 351.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 07:24:59,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.99ms. Allocated memory is still 375.4MB. Free memory was 351.1MB in the beginning and 338.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-25 07:24:59,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.14ms. Allocated memory is still 375.4MB. Free memory was 338.5MB in the beginning and 336.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 07:24:59,250 INFO L158 Benchmark]: Boogie Preprocessor took 67.27ms. Allocated memory is still 375.4MB. Free memory was 336.1MB in the beginning and 332.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 07:24:59,250 INFO L158 Benchmark]: RCFGBuilder took 885.57ms. Allocated memory is still 375.4MB. Free memory was 332.9MB in the beginning and 344.2MB in the end (delta: -11.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.0GB. [2023-08-25 07:24:59,250 INFO L158 Benchmark]: TraceAbstraction took 824957.57ms. Allocated memory was 375.4MB in the beginning and 15.7GB in the end (delta: 15.4GB). Free memory was 343.1MB in the beginning and 14.0GB in the end (delta: -13.6GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2023-08-25 07:24:59,251 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.13ms. Allocated memory is still 375.4MB. Free memory is still 351.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 281.99ms. Allocated memory is still 375.4MB. Free memory was 351.1MB in the beginning and 338.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.14ms. Allocated memory is still 375.4MB. Free memory was 338.5MB in the beginning and 336.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 67.27ms. Allocated memory is still 375.4MB. Free memory was 336.1MB in the beginning and 332.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 885.57ms. Allocated memory is still 375.4MB. Free memory was 332.9MB in the beginning and 344.2MB in the end (delta: -11.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.0GB. * TraceAbstraction took 824957.57ms. Allocated memory was 375.4MB in the beginning and 15.7GB in the end (delta: 15.4GB). Free memory was 343.1MB in the beginning and 14.0GB in the end (delta: -13.6GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.6s, 330 PlacesBefore, 107 PlacesAfterwards, 340 TransitionsBefore, 107 TransitionsAfterwards, 9904 CoEnabledTransitionPairs, 8 FixpointIterations, 204 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 11 ConcurrentYvCompositions, 10 ChoiceCompositions, 334 TotalNumberOfCompositions, 61334 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16985, independent: 15876, independent conditional: 0, independent unconditional: 15876, dependent: 1109, dependent conditional: 0, dependent unconditional: 1109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5292, independent: 5132, independent conditional: 0, independent unconditional: 5132, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16985, independent: 10744, independent conditional: 0, independent unconditional: 10744, dependent: 949, dependent conditional: 0, dependent unconditional: 949, unknown: 5292, unknown conditional: 0, unknown unconditional: 5292] , Statistics on independence cache: Total cache size (in pairs): 1019, Positive cache size: 924, Positive conditional cache size: 0, Positive unconditional cache size: 924, Negative cache size: 95, Negative conditional cache size: 0, Negative unconditional cache size: 95, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 430 locations, 66 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: 824.8s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 434.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.8s, HoareTripleCheckerStatistics: 64 mSolverCounterUnknown, 3307 SdHoareTripleChecker+Valid, 224.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3307 mSDsluCounter, 858 SdHoareTripleChecker+Invalid, 221.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2149 IncrementalHoareTripleChecker+Unchecked, 551 mSDsCounter, 550 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8343 IncrementalHoareTripleChecker+Invalid, 11107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 550 mSolverCounterUnsat, 307 mSDtfsCounter, 8343 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 208 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 142.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10189occurred in iteration=19, InterpolantAutomatonStates: 122, 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, 301.4s SatisfiabilityAnalysisTime, 73.6s InterpolantComputationTime, 603 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 683 ConstructedInterpolants, 6 QuantifiedInterpolants, 14049 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1776 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 76/99 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