/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 10:54:21,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 10:54:21,180 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-26 10:54:21,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 10:54:21,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 10:54:21,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 10:54:21,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 10:54:21,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 10:54:21,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 10:54:21,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 10:54:21,221 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 10:54:21,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 10:54:21,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 10:54:21,222 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 10:54:21,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 10:54:21,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 10:54:21,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 10:54:21,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 10:54:21,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 10:54:21,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 10:54:21,224 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 10:54:21,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 10:54:21,224 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 10:54:21,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 10:54:21,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 10:54:21,225 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 10:54:21,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 10:54:21,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 10:54:21,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 10:54:21,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 10:54:21,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 10:54:21,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 10:54:21,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 10:54:21,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 10:54:21,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 10:54:21,228 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-26 10:54:21,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 10:54:21,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 10:54:21,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 10:54:21,539 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 10:54:21,539 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 10:54:21,540 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-26 10:54:22,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 10:54:22,843 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 10:54:22,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2023-08-26 10:54:22,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf030b83/db28e475e16d449fb4e0099271a32234/FLAG04fff666d [2023-08-26 10:54:22,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf030b83/db28e475e16d449fb4e0099271a32234 [2023-08-26 10:54:22,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 10:54:22,867 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 10:54:22,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 10:54:22,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 10:54:22,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 10:54:22,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:54:22" (1/1) ... [2023-08-26 10:54:22,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25442aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:22, skipping insertion in model container [2023-08-26 10:54:22,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:54:22" (1/1) ... [2023-08-26 10:54:22,899 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 10:54:23,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 10:54:23,112 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 10:54:23,155 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 10:54:23,165 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 10:54:23,165 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 10:54:23,171 INFO L206 MainTranslator]: Completed translation [2023-08-26 10:54:23,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23 WrapperNode [2023-08-26 10:54:23,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 10:54:23,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 10:54:23,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 10:54:23,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 10:54:23,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23" (1/1) ... [2023-08-26 10:54:23,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23" (1/1) ... [2023-08-26 10:54:23,233 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 223 [2023-08-26 10:54:23,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 10:54:23,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 10:54:23,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 10:54:23,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 10:54:23,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23" (1/1) ... [2023-08-26 10:54:23,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23" (1/1) ... [2023-08-26 10:54:23,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23" (1/1) ... [2023-08-26 10:54:23,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23" (1/1) ... [2023-08-26 10:54:23,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23" (1/1) ... [2023-08-26 10:54:23,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23" (1/1) ... [2023-08-26 10:54:23,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23" (1/1) ... [2023-08-26 10:54:23,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23" (1/1) ... [2023-08-26 10:54:23,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 10:54:23,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 10:54:23,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 10:54:23,296 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 10:54:23,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23" (1/1) ... [2023-08-26 10:54:23,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 10:54:23,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:54:23,329 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-26 10:54:23,339 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-26 10:54:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 10:54:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 10:54:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 10:54:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 10:54:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 10:54:23,358 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 10:54:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 10:54:23,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 10:54:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 10:54:23,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 10:54:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 10:54:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 10:54:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 10:54:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-26 10:54:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 10:54:23,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 10:54:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 10:54:23,361 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 10:54:23,472 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 10:54:23,473 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 10:54:23,991 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 10:54:24,107 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 10:54:24,107 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-26 10:54:24,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:54:24 BoogieIcfgContainer [2023-08-26 10:54:24,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 10:54:24,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 10:54:24,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 10:54:24,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 10:54:24,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 10:54:22" (1/3) ... [2023-08-26 10:54:24,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a42036f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:54:24, skipping insertion in model container [2023-08-26 10:54:24,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:54:23" (2/3) ... [2023-08-26 10:54:24,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a42036f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:54:24, skipping insertion in model container [2023-08-26 10:54:24,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:54:24" (3/3) ... [2023-08-26 10:54:24,119 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2023-08-26 10:54:24,134 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 10:54:24,135 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2023-08-26 10:54:24,135 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 10:54:24,241 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-26 10:54:24,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 344 places, 354 transitions, 732 flow [2023-08-26 10:54:24,473 INFO L124 PetriNetUnfolderBase]: 20/351 cut-off events. [2023-08-26 10:54:24,473 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 10:54:24,481 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-26 10:54:24,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 344 places, 354 transitions, 732 flow [2023-08-26 10:54:24,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 340 transitions, 698 flow [2023-08-26 10:54:24,494 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 10:54:24,506 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 330 places, 340 transitions, 698 flow [2023-08-26 10:54:24,509 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 330 places, 340 transitions, 698 flow [2023-08-26 10:54:24,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 330 places, 340 transitions, 698 flow [2023-08-26 10:54:24,575 INFO L124 PetriNetUnfolderBase]: 20/340 cut-off events. [2023-08-26 10:54:24,576 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 10:54:24,578 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-26 10:54:24,583 INFO L119 LiptonReduction]: Number of co-enabled transitions 9904 [2023-08-26 10:54:37,896 INFO L134 LiptonReduction]: Checked pairs total: 61334 [2023-08-26 10:54:37,896 INFO L136 LiptonReduction]: Total number of compositions: 334 [2023-08-26 10:54:37,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 10:54:37,910 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;@65d8c1a8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 10:54:37,910 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2023-08-26 10:54:37,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 10:54:37,912 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 10:54:37,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 10:54:37,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:37,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 10:54:37,913 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-26 10:54:37,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:37,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1369, now seen corresponding path program 1 times [2023-08-26 10:54:37,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:37,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004270913] [2023-08-26 10:54:37,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:37,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:38,007 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-26 10:54:38,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:38,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004270913] [2023-08-26 10:54:38,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004270913] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:38,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:38,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 10:54:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742416310] [2023-08-26 10:54:38,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:38,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 10:54:38,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:38,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 10:54:38,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 10:54:38,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 688 [2023-08-26 10:54:38,052 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-26 10:54:38,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:38,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 688 [2023-08-26 10:54:38,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:38,377 INFO L124 PetriNetUnfolderBase]: 779/1983 cut-off events. [2023-08-26 10:54:38,378 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-08-26 10:54:38,385 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-26 10:54:38,397 INFO L140 encePairwiseOnDemand]: 656/688 looper letters, 31 selfloop transitions, 0 changer transitions 0/75 dead transitions. [2023-08-26 10:54:38,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 75 transitions, 230 flow [2023-08-26 10:54:38,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 10:54:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 10:54:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 701 transitions. [2023-08-26 10:54:38,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094476744186046 [2023-08-26 10:54:38,417 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 701 transitions. [2023-08-26 10:54:38,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 701 transitions. [2023-08-26 10:54:38,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:38,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 701 transitions. [2023-08-26 10:54:38,428 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-26 10:54:38,464 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-26 10:54:38,465 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-26 10:54:38,467 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 232 flow. Second operand 2 states and 701 transitions. [2023-08-26 10:54:38,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 75 transitions, 230 flow [2023-08-26 10:54:38,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 75 transitions, 218 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-26 10:54:38,474 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 156 flow [2023-08-26 10:54:38,476 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-26 10:54:38,479 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -34 predicate places. [2023-08-26 10:54:38,479 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 156 flow [2023-08-26 10:54:38,480 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-26 10:54:38,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:38,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:54:38,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 10:54:38,481 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-26 10:54:38,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:38,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1295070944, now seen corresponding path program 1 times [2023-08-26 10:54:38,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:38,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643696246] [2023-08-26 10:54:38,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:38,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:38,624 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-26 10:54:38,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643696246] [2023-08-26 10:54:38,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643696246] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:38,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:38,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:54:38,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116004552] [2023-08-26 10:54:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:38,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:54:38,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:38,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:54:38,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:54:38,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 688 [2023-08-26 10:54:38,629 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-26 10:54:38,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:38,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 688 [2023-08-26 10:54:38,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:38,969 INFO L124 PetriNetUnfolderBase]: 1570/3234 cut-off events. [2023-08-26 10:54:38,970 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-08-26 10:54:38,976 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-26 10:54:38,991 INFO L140 encePairwiseOnDemand]: 684/688 looper letters, 35 selfloop transitions, 1 changer transitions 0/72 dead transitions. [2023-08-26 10:54:38,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 72 transitions, 222 flow [2023-08-26 10:54:38,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:54:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:54:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2023-08-26 10:54:38,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45203488372093026 [2023-08-26 10:54:38,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 933 transitions. [2023-08-26 10:54:38,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 933 transitions. [2023-08-26 10:54:38,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:38,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 933 transitions. [2023-08-26 10:54:38,998 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-26 10:54:39,003 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-26 10:54:39,004 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-26 10:54:39,004 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 156 flow. Second operand 3 states and 933 transitions. [2023-08-26 10:54:39,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 72 transitions, 222 flow [2023-08-26 10:54:39,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:54:39,007 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 152 flow [2023-08-26 10:54:39,008 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-26 10:54:39,009 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -35 predicate places. [2023-08-26 10:54:39,010 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 152 flow [2023-08-26 10:54:39,012 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-26 10:54:39,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:39,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:54:39,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 10:54:39,019 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-26 10:54:39,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:39,021 INFO L85 PathProgramCache]: Analyzing trace with hash -977065152, now seen corresponding path program 1 times [2023-08-26 10:54:39,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:39,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524332049] [2023-08-26 10:54:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:39,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:39,097 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-26 10:54:39,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:39,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524332049] [2023-08-26 10:54:39,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524332049] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:39,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:39,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:54:39,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961566091] [2023-08-26 10:54:39,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:39,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:54:39,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:39,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:54:39,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:54:39,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 688 [2023-08-26 10:54:39,102 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-26 10:54:39,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:39,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 688 [2023-08-26 10:54:39,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:39,401 INFO L124 PetriNetUnfolderBase]: 1100/2303 cut-off events. [2023-08-26 10:54:39,401 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-26 10:54:39,406 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-26 10:54:39,417 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 50 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-08-26 10:54:39,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 299 flow [2023-08-26 10:54:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:54:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:54:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 992 transitions. [2023-08-26 10:54:39,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2023-08-26 10:54:39,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 992 transitions. [2023-08-26 10:54:39,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 992 transitions. [2023-08-26 10:54:39,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:39,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 992 transitions. [2023-08-26 10:54:39,423 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-26 10:54:39,426 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-26 10:54:39,428 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-26 10:54:39,428 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 152 flow. Second operand 3 states and 992 transitions. [2023-08-26 10:54:39,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 299 flow [2023-08-26 10:54:39,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:54:39,430 INFO L231 Difference]: Finished difference. Result has 73 places, 73 transitions, 163 flow [2023-08-26 10:54:39,430 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-26 10:54:39,431 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -34 predicate places. [2023-08-26 10:54:39,431 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 163 flow [2023-08-26 10:54:39,432 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-26 10:54:39,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:39,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:54:39,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 10:54:39,432 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-26 10:54:39,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:39,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1619086085, now seen corresponding path program 1 times [2023-08-26 10:54:39,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:39,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449817251] [2023-08-26 10:54:39,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:39,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:39,948 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-26 10:54:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449817251] [2023-08-26 10:54:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449817251] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:39,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:39,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:54:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707347945] [2023-08-26 10:54:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:39,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:54:39,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:39,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:54:39,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:54:39,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 688 [2023-08-26 10:54:39,955 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-26 10:54:39,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:39,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 688 [2023-08-26 10:54:39,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:41,760 INFO L124 PetriNetUnfolderBase]: 10169/13782 cut-off events. [2023-08-26 10:54:41,760 INFO L125 PetriNetUnfolderBase]: For 1792/1813 co-relation queries the response was YES. [2023-08-26 10:54:41,790 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-26 10:54:41,861 INFO L140 encePairwiseOnDemand]: 681/688 looper letters, 164 selfloop transitions, 13 changer transitions 0/190 dead transitions. [2023-08-26 10:54:41,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 190 transitions, 794 flow [2023-08-26 10:54:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:54:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:54:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1758 transitions. [2023-08-26 10:54:41,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258720930232558 [2023-08-26 10:54:41,866 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1758 transitions. [2023-08-26 10:54:41,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1758 transitions. [2023-08-26 10:54:41,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:41,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1758 transitions. [2023-08-26 10:54:41,871 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-26 10:54:41,877 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-26 10:54:41,879 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-26 10:54:41,879 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 163 flow. Second operand 6 states and 1758 transitions. [2023-08-26 10:54:41,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 190 transitions, 794 flow [2023-08-26 10:54:41,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 190 transitions, 794 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:54:41,885 INFO L231 Difference]: Finished difference. Result has 83 places, 85 transitions, 273 flow [2023-08-26 10:54:41,885 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-26 10:54:41,886 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -24 predicate places. [2023-08-26 10:54:41,887 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 85 transitions, 273 flow [2023-08-26 10:54:41,888 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-26 10:54:41,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:41,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:54:41,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 10:54:41,888 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-26 10:54:41,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:41,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1652271964, now seen corresponding path program 1 times [2023-08-26 10:54:41,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:41,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438534079] [2023-08-26 10:54:41,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:41,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:54:42,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:42,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438534079] [2023-08-26 10:54:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438534079] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:42,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 10:54:42,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061361859] [2023-08-26 10:54:42,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:42,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 10:54:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:42,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 10:54:42,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 10:54:42,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 688 [2023-08-26 10:54:42,057 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-26 10:54:42,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:42,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 688 [2023-08-26 10:54:42,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:43,315 INFO L124 PetriNetUnfolderBase]: 5999/9614 cut-off events. [2023-08-26 10:54:43,315 INFO L125 PetriNetUnfolderBase]: For 9009/9251 co-relation queries the response was YES. [2023-08-26 10:54:43,353 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-26 10:54:43,399 INFO L140 encePairwiseOnDemand]: 678/688 looper letters, 102 selfloop transitions, 15 changer transitions 0/148 dead transitions. [2023-08-26 10:54:43,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 148 transitions, 763 flow [2023-08-26 10:54:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:54:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:54:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1506 transitions. [2023-08-26 10:54:43,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3648255813953488 [2023-08-26 10:54:43,403 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1506 transitions. [2023-08-26 10:54:43,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1506 transitions. [2023-08-26 10:54:43,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:43,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1506 transitions. [2023-08-26 10:54:43,408 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-26 10:54:43,414 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-26 10:54:43,417 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-26 10:54:43,417 INFO L175 Difference]: Start difference. First operand has 83 places, 85 transitions, 273 flow. Second operand 6 states and 1506 transitions. [2023-08-26 10:54:43,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 148 transitions, 763 flow [2023-08-26 10:54:43,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 148 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:54:43,441 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 375 flow [2023-08-26 10:54:43,441 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-26 10:54:43,443 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -15 predicate places. [2023-08-26 10:54:43,443 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 375 flow [2023-08-26 10:54:43,444 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-26 10:54:43,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:43,444 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-26 10:54:43,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 10:54:43,445 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-26 10:54:43,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:43,445 INFO L85 PathProgramCache]: Analyzing trace with hash 476262221, now seen corresponding path program 1 times [2023-08-26 10:54:43,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:43,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888969169] [2023-08-26 10:54:43,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:43,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:43,830 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-26 10:54:43,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:43,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888969169] [2023-08-26 10:54:43,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888969169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:43,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:43,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:54:43,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337643594] [2023-08-26 10:54:43,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:43,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:54:43,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:43,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:54:43,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:54:43,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 688 [2023-08-26 10:54:43,835 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-26 10:54:43,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:43,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 688 [2023-08-26 10:54:43,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:46,270 INFO L124 PetriNetUnfolderBase]: 17976/24661 cut-off events. [2023-08-26 10:54:46,270 INFO L125 PetriNetUnfolderBase]: For 15959/16059 co-relation queries the response was YES. [2023-08-26 10:54:46,350 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-26 10:54:46,466 INFO L140 encePairwiseOnDemand]: 680/688 looper letters, 174 selfloop transitions, 26 changer transitions 0/210 dead transitions. [2023-08-26 10:54:46,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 210 transitions, 1239 flow [2023-08-26 10:54:46,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:54:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:54:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1708 transitions. [2023-08-26 10:54:46,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41375968992248063 [2023-08-26 10:54:46,472 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1708 transitions. [2023-08-26 10:54:46,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1708 transitions. [2023-08-26 10:54:46,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:46,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1708 transitions. [2023-08-26 10:54:46,476 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-26 10:54:46,481 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-26 10:54:46,482 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-26 10:54:46,482 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 375 flow. Second operand 6 states and 1708 transitions. [2023-08-26 10:54:46,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 210 transitions, 1239 flow [2023-08-26 10:54:46,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 210 transitions, 1239 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:54:46,576 INFO L231 Difference]: Finished difference. Result has 102 places, 123 transitions, 663 flow [2023-08-26 10:54:46,576 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-26 10:54:46,579 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -5 predicate places. [2023-08-26 10:54:46,581 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 123 transitions, 663 flow [2023-08-26 10:54:46,582 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-26 10:54:46,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:46,582 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-26 10:54:46,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 10:54:46,582 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-26 10:54:46,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:46,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1696449613, now seen corresponding path program 1 times [2023-08-26 10:54:46,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:46,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636478875] [2023-08-26 10:54:46,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:46,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:46,726 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-26 10:54:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636478875] [2023-08-26 10:54:46,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636478875] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:46,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 10:54:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354114001] [2023-08-26 10:54:46,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:46,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 10:54:46,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:46,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 10:54:46,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 10:54:46,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 688 [2023-08-26 10:54:46,731 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-26 10:54:46,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:46,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 688 [2023-08-26 10:54:46,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:47,511 INFO L124 PetriNetUnfolderBase]: 3543/7365 cut-off events. [2023-08-26 10:54:47,512 INFO L125 PetriNetUnfolderBase]: For 9328/9669 co-relation queries the response was YES. [2023-08-26 10:54:47,541 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-26 10:54:47,638 INFO L140 encePairwiseOnDemand]: 678/688 looper letters, 89 selfloop transitions, 12 changer transitions 0/148 dead transitions. [2023-08-26 10:54:47,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 148 transitions, 915 flow [2023-08-26 10:54:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:54:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:54:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1572 transitions. [2023-08-26 10:54:47,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3808139534883721 [2023-08-26 10:54:47,644 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1572 transitions. [2023-08-26 10:54:47,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1572 transitions. [2023-08-26 10:54:47,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:47,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1572 transitions. [2023-08-26 10:54:47,648 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-26 10:54:47,653 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-26 10:54:47,654 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-26 10:54:47,654 INFO L175 Difference]: Start difference. First operand has 102 places, 123 transitions, 663 flow. Second operand 6 states and 1572 transitions. [2023-08-26 10:54:47,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 148 transitions, 915 flow [2023-08-26 10:54:47,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 148 transitions, 875 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-08-26 10:54:47,676 INFO L231 Difference]: Finished difference. Result has 109 places, 122 transitions, 653 flow [2023-08-26 10:54:47,676 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-26 10:54:47,678 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 2 predicate places. [2023-08-26 10:54:47,678 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 122 transitions, 653 flow [2023-08-26 10:54:47,679 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-26 10:54:47,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:47,679 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-26 10:54:47,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 10:54:47,679 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-26 10:54:47,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1873163792, now seen corresponding path program 1 times [2023-08-26 10:54:47,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:47,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355232578] [2023-08-26 10:54:47,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:47,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:47,726 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-26 10:54:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:47,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355232578] [2023-08-26 10:54:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355232578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:47,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:47,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:54:47,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301470120] [2023-08-26 10:54:47,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:47,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:54:47,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:47,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:54:47,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:54:47,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 688 [2023-08-26 10:54:47,730 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-26 10:54:47,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:47,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 688 [2023-08-26 10:54:47,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:48,959 INFO L124 PetriNetUnfolderBase]: 4585/8118 cut-off events. [2023-08-26 10:54:48,959 INFO L125 PetriNetUnfolderBase]: For 15110/15983 co-relation queries the response was YES. [2023-08-26 10:54:48,979 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-26 10:54:49,010 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 88 selfloop transitions, 31 changer transitions 0/166 dead transitions. [2023-08-26 10:54:49,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 166 transitions, 1182 flow [2023-08-26 10:54:49,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:54:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:54:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2023-08-26 10:54:49,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48158914728682173 [2023-08-26 10:54:49,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 994 transitions. [2023-08-26 10:54:49,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 994 transitions. [2023-08-26 10:54:49,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:49,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 994 transitions. [2023-08-26 10:54:49,017 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-26 10:54:49,020 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-26 10:54:49,020 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-26 10:54:49,020 INFO L175 Difference]: Start difference. First operand has 109 places, 122 transitions, 653 flow. Second operand 3 states and 994 transitions. [2023-08-26 10:54:49,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 166 transitions, 1182 flow [2023-08-26 10:54:49,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 166 transitions, 1164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 10:54:49,054 INFO L231 Difference]: Finished difference. Result has 108 places, 147 transitions, 1020 flow [2023-08-26 10:54:49,055 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-26 10:54:49,056 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 1 predicate places. [2023-08-26 10:54:49,057 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 147 transitions, 1020 flow [2023-08-26 10:54:49,057 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-26 10:54:49,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:49,057 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-26 10:54:49,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 10:54:49,057 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-26 10:54:49,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash -862635616, now seen corresponding path program 1 times [2023-08-26 10:54:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:49,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315470114] [2023-08-26 10:54:49,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:49,812 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-26 10:54:49,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:49,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315470114] [2023-08-26 10:54:49,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315470114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:49,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:49,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 10:54:49,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006334129] [2023-08-26 10:54:49,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:49,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 10:54:49,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:49,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 10:54:49,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-26 10:54:49,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 688 [2023-08-26 10:54:49,818 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-26 10:54:49,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:49,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 688 [2023-08-26 10:54:49,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:52,737 INFO L124 PetriNetUnfolderBase]: 16682/22821 cut-off events. [2023-08-26 10:54:52,738 INFO L125 PetriNetUnfolderBase]: For 34005/34417 co-relation queries the response was YES. [2023-08-26 10:54:52,797 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-26 10:54:52,882 INFO L140 encePairwiseOnDemand]: 682/688 looper letters, 274 selfloop transitions, 8 changer transitions 0/294 dead transitions. [2023-08-26 10:54:52,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 294 transitions, 2276 flow [2023-08-26 10:54:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 10:54:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 10:54:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1829 transitions. [2023-08-26 10:54:52,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37977574750830567 [2023-08-26 10:54:52,893 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1829 transitions. [2023-08-26 10:54:52,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1829 transitions. [2023-08-26 10:54:52,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:52,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1829 transitions. [2023-08-26 10:54:52,905 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-26 10:54:52,910 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-26 10:54:52,911 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-26 10:54:52,911 INFO L175 Difference]: Start difference. First operand has 108 places, 147 transitions, 1020 flow. Second operand 7 states and 1829 transitions. [2023-08-26 10:54:52,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 294 transitions, 2276 flow [2023-08-26 10:54:53,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 294 transitions, 2263 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:54:53,081 INFO L231 Difference]: Finished difference. Result has 112 places, 146 transitions, 1019 flow [2023-08-26 10:54:53,081 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-26 10:54:53,081 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2023-08-26 10:54:53,081 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 146 transitions, 1019 flow [2023-08-26 10:54:53,082 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-26 10:54:53,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:53,082 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-26 10:54:53,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 10:54:53,083 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-26 10:54:53,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:53,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1086127665, now seen corresponding path program 1 times [2023-08-26 10:54:53,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:53,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248568575] [2023-08-26 10:54:53,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:53,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:54,204 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-26 10:54:54,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:54,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248568575] [2023-08-26 10:54:54,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248568575] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:54,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:54,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 10:54:54,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413978744] [2023-08-26 10:54:54,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:54,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 10:54:54,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:54,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 10:54:54,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-26 10:54:54,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 688 [2023-08-26 10:54:54,212 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-26 10:54:54,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:54,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 688 [2023-08-26 10:54:54,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:59,198 INFO L124 PetriNetUnfolderBase]: 35753/49303 cut-off events. [2023-08-26 10:54:59,198 INFO L125 PetriNetUnfolderBase]: For 80353/81100 co-relation queries the response was YES. [2023-08-26 10:54:59,428 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-26 10:54:59,631 INFO L140 encePairwiseOnDemand]: 676/688 looper letters, 319 selfloop transitions, 72 changer transitions 0/399 dead transitions. [2023-08-26 10:54:59,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 399 transitions, 3716 flow [2023-08-26 10:54:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 10:54:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 10:54:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2682 transitions. [2023-08-26 10:54:59,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35438689217758984 [2023-08-26 10:54:59,639 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2682 transitions. [2023-08-26 10:54:59,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2682 transitions. [2023-08-26 10:54:59,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:59,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2682 transitions. [2023-08-26 10:54:59,646 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-26 10:54:59,654 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-26 10:54:59,655 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-26 10:54:59,655 INFO L175 Difference]: Start difference. First operand has 112 places, 146 transitions, 1019 flow. Second operand 11 states and 2682 transitions. [2023-08-26 10:54:59,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 399 transitions, 3716 flow [2023-08-26 10:54:59,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 399 transitions, 3652 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 10:54:59,969 INFO L231 Difference]: Finished difference. Result has 121 places, 204 transitions, 1939 flow [2023-08-26 10:54:59,969 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-26 10:54:59,969 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 14 predicate places. [2023-08-26 10:54:59,969 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 204 transitions, 1939 flow [2023-08-26 10:54:59,970 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-26 10:54:59,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:59,970 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-26 10:54:59,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 10:54:59,970 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-26 10:54:59,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1448235429, now seen corresponding path program 2 times [2023-08-26 10:54:59,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:59,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300568031] [2023-08-26 10:54:59,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:59,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:55:01,048 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-26 10:55:01,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:55:01,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300568031] [2023-08-26 10:55:01,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300568031] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:55:01,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:55:01,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 10:55:01,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188421972] [2023-08-26 10:55:01,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:55:01,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 10:55:01,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:55:01,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 10:55:01,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-26 10:55:01,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 688 [2023-08-26 10:55:01,054 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-26 10:55:01,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:55:01,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 688 [2023-08-26 10:55:01,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:55:08,554 INFO L124 PetriNetUnfolderBase]: 49148/67287 cut-off events. [2023-08-26 10:55:08,554 INFO L125 PetriNetUnfolderBase]: For 167092/167975 co-relation queries the response was YES. [2023-08-26 10:55:08,869 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-26 10:55:09,083 INFO L140 encePairwiseOnDemand]: 676/688 looper letters, 247 selfloop transitions, 141 changer transitions 0/396 dead transitions. [2023-08-26 10:55:09,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 396 transitions, 4067 flow [2023-08-26 10:55:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 10:55:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 10:55:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2448 transitions. [2023-08-26 10:55:09,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3558139534883721 [2023-08-26 10:55:09,089 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2448 transitions. [2023-08-26 10:55:09,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2448 transitions. [2023-08-26 10:55:09,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:55:09,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2448 transitions. [2023-08-26 10:55:09,094 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-26 10:55:09,101 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-26 10:55:09,102 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-26 10:55:09,102 INFO L175 Difference]: Start difference. First operand has 121 places, 204 transitions, 1939 flow. Second operand 10 states and 2448 transitions. [2023-08-26 10:55:09,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 396 transitions, 4067 flow [2023-08-26 10:55:09,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 396 transitions, 4048 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 10:55:09,934 INFO L231 Difference]: Finished difference. Result has 130 places, 258 transitions, 3094 flow [2023-08-26 10:55:09,934 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-26 10:55:09,934 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 23 predicate places. [2023-08-26 10:55:09,935 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 258 transitions, 3094 flow [2023-08-26 10:55:09,935 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-26 10:55:09,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:55:09,935 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-26 10:55:09,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 10:55:09,936 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-26 10:55:09,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:55:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1391483523, now seen corresponding path program 1 times [2023-08-26 10:55:09,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:55:09,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716262472] [2023-08-26 10:55:09,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:55:09,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:55:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:55:10,249 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-26 10:55:10,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:55:10,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716262472] [2023-08-26 10:55:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716262472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:55:10,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:55:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:55:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826228876] [2023-08-26 10:55:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:55:10,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:55:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:55:10,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:55:10,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:55:10,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 688 [2023-08-26 10:55:10,254 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-26 10:55:10,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:55:10,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 688 [2023-08-26 10:55:10,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:55:17,712 INFO L124 PetriNetUnfolderBase]: 42184/58501 cut-off events. [2023-08-26 10:55:17,712 INFO L125 PetriNetUnfolderBase]: For 214562/217908 co-relation queries the response was YES. [2023-08-26 10:55:18,094 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-26 10:55:18,300 INFO L140 encePairwiseOnDemand]: 681/688 looper letters, 275 selfloop transitions, 21 changer transitions 0/315 dead transitions. [2023-08-26 10:55:18,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 315 transitions, 4102 flow [2023-08-26 10:55:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:55:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:55:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1685 transitions. [2023-08-26 10:55:18,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40818798449612403 [2023-08-26 10:55:18,304 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1685 transitions. [2023-08-26 10:55:18,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1685 transitions. [2023-08-26 10:55:18,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:55:18,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1685 transitions. [2023-08-26 10:55:18,308 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-26 10:55:18,312 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-26 10:55:18,312 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-26 10:55:18,312 INFO L175 Difference]: Start difference. First operand has 130 places, 258 transitions, 3094 flow. Second operand 6 states and 1685 transitions. [2023-08-26 10:55:18,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 315 transitions, 4102 flow [2023-08-26 10:55:20,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 315 transitions, 3951 flow, removed 68 selfloop flow, removed 4 redundant places. [2023-08-26 10:55:20,815 INFO L231 Difference]: Finished difference. Result has 136 places, 278 transitions, 3297 flow [2023-08-26 10:55:20,815 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-26 10:55:20,816 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 29 predicate places. [2023-08-26 10:55:20,816 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 278 transitions, 3297 flow [2023-08-26 10:55:20,816 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-26 10:55:20,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:55:20,817 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-26 10:55:20,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 10:55:20,817 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-26 10:55:20,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:55:20,817 INFO L85 PathProgramCache]: Analyzing trace with hash 968447700, now seen corresponding path program 1 times [2023-08-26 10:55:20,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:55:20,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153380013] [2023-08-26 10:55:20,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:55:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:55:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:55:21,219 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-26 10:55:21,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:55:21,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153380013] [2023-08-26 10:55:21,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153380013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:55:21,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:55:21,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:55:21,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709517699] [2023-08-26 10:55:21,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:55:21,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:55:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:55:21,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:55:21,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:55:21,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 688 [2023-08-26 10:55:21,223 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-26 10:55:21,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:55:21,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 688 [2023-08-26 10:55:21,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:55:29,246 INFO L124 PetriNetUnfolderBase]: 48713/66310 cut-off events. [2023-08-26 10:55:29,246 INFO L125 PetriNetUnfolderBase]: For 229392/232039 co-relation queries the response was YES. [2023-08-26 10:55:29,754 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-26 10:55:30,171 INFO L140 encePairwiseOnDemand]: 681/688 looper letters, 351 selfloop transitions, 112 changer transitions 0/476 dead transitions. [2023-08-26 10:55:30,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 476 transitions, 6306 flow [2023-08-26 10:55:30,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:55:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:55:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1695 transitions. [2023-08-26 10:55:30,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106104651162791 [2023-08-26 10:55:30,175 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1695 transitions. [2023-08-26 10:55:30,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1695 transitions. [2023-08-26 10:55:30,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:55:30,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1695 transitions. [2023-08-26 10:55:30,179 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-26 10:55:30,183 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-26 10:55:30,184 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-26 10:55:30,184 INFO L175 Difference]: Start difference. First operand has 136 places, 278 transitions, 3297 flow. Second operand 6 states and 1695 transitions. [2023-08-26 10:55:30,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 476 transitions, 6306 flow [2023-08-26 10:55:32,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 476 transitions, 6282 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-26 10:55:32,362 INFO L231 Difference]: Finished difference. Result has 145 places, 384 transitions, 5343 flow [2023-08-26 10:55:32,362 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-26 10:55:32,363 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 38 predicate places. [2023-08-26 10:55:32,363 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 384 transitions, 5343 flow [2023-08-26 10:55:32,363 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-26 10:55:32,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:55:32,363 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-26 10:55:32,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 10:55:32,364 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-26 10:55:32,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:55:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2874919, now seen corresponding path program 3 times [2023-08-26 10:55:32,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:55:32,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159079902] [2023-08-26 10:55:32,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:55:32,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:55:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:55:32,521 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-26 10:55:32,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:55:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159079902] [2023-08-26 10:55:32,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159079902] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:55:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386721649] [2023-08-26 10:55:32,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 10:55:32,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:55:32,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:55:32,529 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-26 10:55:32,588 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-26 10:55:32,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-26 10:55:32,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:55:32,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-26 10:55:32,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:55:32,970 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-26 10:55:32,971 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-26 10:55:33,026 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-26 10:55:33,026 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-26 10:55:33,070 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-26 10:55:33,071 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-26 10:55:33,246 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-26 10:55:33,286 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-26 10:55:33,328 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-26 10:55:33,379 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-26 10:55:33,489 INFO L322 Elim1Store]: treesize reduction 64, result has 31.2 percent of original size [2023-08-26 10:55:33,489 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-26 10:55:33,503 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-26 10:55:33,620 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-26 10:55:33,621 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 10:55:33,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386721649] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:55:33,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 10:55:33,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 16 [2023-08-26 10:55:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924426423] [2023-08-26 10:55:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:55:33,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 10:55:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:55:33,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 10:55:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-08-26 10:55:33,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 688 [2023-08-26 10:55:33,628 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-26 10:55:33,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:55:33,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 688 [2023-08-26 10:55:33,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:55:42,905 INFO L124 PetriNetUnfolderBase]: 50593/69007 cut-off events. [2023-08-26 10:55:42,905 INFO L125 PetriNetUnfolderBase]: For 286088/289237 co-relation queries the response was YES. [2023-08-26 10:55:43,547 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-26 10:55:43,819 INFO L140 encePairwiseOnDemand]: 676/688 looper letters, 547 selfloop transitions, 36 changer transitions 0/596 dead transitions. [2023-08-26 10:55:43,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 596 transitions, 8511 flow [2023-08-26 10:55:43,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 10:55:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 10:55:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2721 transitions. [2023-08-26 10:55:43,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35954016913319237 [2023-08-26 10:55:43,823 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2721 transitions. [2023-08-26 10:55:43,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2721 transitions. [2023-08-26 10:55:43,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:55:43,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2721 transitions. [2023-08-26 10:55:43,829 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-26 10:55:43,835 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-26 10:55:43,836 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-26 10:55:43,836 INFO L175 Difference]: Start difference. First operand has 145 places, 384 transitions, 5343 flow. Second operand 11 states and 2721 transitions. [2023-08-26 10:55:43,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 596 transitions, 8511 flow [2023-08-26 10:55:46,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 596 transitions, 8119 flow, removed 196 selfloop flow, removed 0 redundant places. [2023-08-26 10:55:46,889 INFO L231 Difference]: Finished difference. Result has 160 places, 391 transitions, 5245 flow [2023-08-26 10:55:46,890 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-26 10:55:46,890 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 53 predicate places. [2023-08-26 10:55:46,890 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 391 transitions, 5245 flow [2023-08-26 10:55:46,891 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-26 10:55:46,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:55:46,891 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-26 10:55:46,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 10:55:47,091 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-26 10:55:47,092 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-26 10:55:47,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:55:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash 859619338, now seen corresponding path program 1 times [2023-08-26 10:55:47,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:55:47,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291959506] [2023-08-26 10:55:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:55:47,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:55:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:55:47,219 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-26 10:55:47,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:55:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291959506] [2023-08-26 10:55:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291959506] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:55:47,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629499503] [2023-08-26 10:55:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:55:47,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:55:47,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:55:47,221 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-26 10:55:47,231 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-26 10:55:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:55:47,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 10:55:47,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:55:47,447 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-26 10:55:47,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:55:47,488 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-26 10:55:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629499503] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-26 10:55:47,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-26 10:55:47,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-26 10:55:47,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567425911] [2023-08-26 10:55:47,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:55:47,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 10:55:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:55:47,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 10:55:47,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-26 10:55:47,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 688 [2023-08-26 10:55:47,493 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-26 10:55:47,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:55:47,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 688 [2023-08-26 10:55:47,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:55:53,122 INFO L124 PetriNetUnfolderBase]: 26034/38543 cut-off events. [2023-08-26 10:55:53,122 INFO L125 PetriNetUnfolderBase]: For 252826/259055 co-relation queries the response was YES. [2023-08-26 10:55:53,480 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-26 10:55:53,628 INFO L140 encePairwiseOnDemand]: 681/688 looper letters, 364 selfloop transitions, 17 changer transitions 8/426 dead transitions. [2023-08-26 10:55:53,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 426 transitions, 6185 flow [2023-08-26 10:55:53,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 10:55:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 10:55:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1260 transitions. [2023-08-26 10:55:53,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36627906976744184 [2023-08-26 10:55:53,631 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1260 transitions. [2023-08-26 10:55:53,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1260 transitions. [2023-08-26 10:55:53,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:55:53,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1260 transitions. [2023-08-26 10:55:53,634 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-26 10:55:53,637 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-26 10:55:53,638 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-26 10:55:53,638 INFO L175 Difference]: Start difference. First operand has 160 places, 391 transitions, 5245 flow. Second operand 5 states and 1260 transitions. [2023-08-26 10:55:53,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 426 transitions, 6185 flow [2023-08-26 10:55:54,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 426 transitions, 6148 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 10:55:54,495 INFO L231 Difference]: Finished difference. Result has 161 places, 381 transitions, 5128 flow [2023-08-26 10:55:54,496 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-26 10:55:54,496 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 54 predicate places. [2023-08-26 10:55:54,496 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 381 transitions, 5128 flow [2023-08-26 10:55:54,497 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-26 10:55:54,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:55:54,497 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-26 10:55:54,504 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-26 10:55:54,703 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-26 10:55:54,704 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-26 10:55:54,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:55:54,704 INFO L85 PathProgramCache]: Analyzing trace with hash -820054564, now seen corresponding path program 1 times [2023-08-26 10:55:54,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:55:54,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014683855] [2023-08-26 10:55:54,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:55:54,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:55:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:55:55,615 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-26 10:55:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:55:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014683855] [2023-08-26 10:55:55,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014683855] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:55:55,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:55:55,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 10:55:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169529842] [2023-08-26 10:55:55,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:55:55,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 10:55:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:55:55,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 10:55:55,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 10:55:55,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 688 [2023-08-26 10:55:55,620 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-26 10:55:55,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:55:55,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 688 [2023-08-26 10:55:55,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:56:06,184 INFO L124 PetriNetUnfolderBase]: 56793/78132 cut-off events. [2023-08-26 10:56:06,185 INFO L125 PetriNetUnfolderBase]: For 314403/316176 co-relation queries the response was YES. [2023-08-26 10:56:06,887 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-26 10:56:07,381 INFO L140 encePairwiseOnDemand]: 677/688 looper letters, 507 selfloop transitions, 91 changer transitions 0/606 dead transitions. [2023-08-26 10:56:07,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 606 transitions, 8802 flow [2023-08-26 10:56:07,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 10:56:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 10:56:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1987 transitions. [2023-08-26 10:56:07,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36101017441860467 [2023-08-26 10:56:07,384 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1987 transitions. [2023-08-26 10:56:07,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1987 transitions. [2023-08-26 10:56:07,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:56:07,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1987 transitions. [2023-08-26 10:56:07,388 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-26 10:56:07,391 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-26 10:56:07,392 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-26 10:56:07,392 INFO L175 Difference]: Start difference. First operand has 161 places, 381 transitions, 5128 flow. Second operand 8 states and 1987 transitions. [2023-08-26 10:56:07,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 606 transitions, 8802 flow [2023-08-26 10:56:09,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 606 transitions, 8746 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-26 10:56:09,564 INFO L231 Difference]: Finished difference. Result has 165 places, 384 transitions, 5374 flow [2023-08-26 10:56:09,564 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-26 10:56:09,565 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 58 predicate places. [2023-08-26 10:56:09,565 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 384 transitions, 5374 flow [2023-08-26 10:56:09,565 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-26 10:56:09,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:56:09,566 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-26 10:56:09,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 10:56:09,566 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-26 10:56:09,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:56:09,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1702914880, now seen corresponding path program 2 times [2023-08-26 10:56:09,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:56:09,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532139188] [2023-08-26 10:56:09,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:56:09,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:56:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:56:10,598 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-26 10:56:10,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:56:10,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532139188] [2023-08-26 10:56:10,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532139188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:56:10,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:56:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 10:56:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780869796] [2023-08-26 10:56:10,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:56:10,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 10:56:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:56:10,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 10:56:10,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-26 10:56:10,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 688 [2023-08-26 10:56:10,603 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-26 10:56:10,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:56:10,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 688 [2023-08-26 10:56:10,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:56:21,144 INFO L124 PetriNetUnfolderBase]: 56896/78318 cut-off events. [2023-08-26 10:56:21,144 INFO L125 PetriNetUnfolderBase]: For 320689/321908 co-relation queries the response was YES. [2023-08-26 10:56:21,857 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-26 10:56:22,140 INFO L140 encePairwiseOnDemand]: 678/688 looper letters, 347 selfloop transitions, 199 changer transitions 0/554 dead transitions. [2023-08-26 10:56:22,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 554 transitions, 8036 flow [2023-08-26 10:56:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 10:56:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 10:56:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1975 transitions. [2023-08-26 10:56:22,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35882994186046513 [2023-08-26 10:56:22,144 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1975 transitions. [2023-08-26 10:56:22,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1975 transitions. [2023-08-26 10:56:22,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:56:22,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1975 transitions. [2023-08-26 10:56:22,146 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-26 10:56:22,149 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-26 10:56:22,149 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-26 10:56:22,150 INFO L175 Difference]: Start difference. First operand has 165 places, 384 transitions, 5374 flow. Second operand 8 states and 1975 transitions. [2023-08-26 10:56:22,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 554 transitions, 8036 flow [2023-08-26 10:56:24,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 554 transitions, 7931 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-26 10:56:24,456 INFO L231 Difference]: Finished difference. Result has 168 places, 385 transitions, 5755 flow [2023-08-26 10:56:24,456 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-26 10:56:24,457 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 61 predicate places. [2023-08-26 10:56:24,457 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 385 transitions, 5755 flow [2023-08-26 10:56:24,457 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-26 10:56:24,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:56:24,457 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-26 10:56:24,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 10:56:24,457 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-26 10:56:24,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:56:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash 956715521, now seen corresponding path program 1 times [2023-08-26 10:56:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:56:24,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646693221] [2023-08-26 10:56:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:56:24,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:56:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:56:24,700 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-26 10:56:24,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:56:24,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646693221] [2023-08-26 10:56:24,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646693221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:56:24,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:56:24,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:56:24,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350883012] [2023-08-26 10:56:24,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:56:24,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:56:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:56:24,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:56:24,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:56:24,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 688 [2023-08-26 10:56:24,705 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-26 10:56:24,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:56:24,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 688 [2023-08-26 10:56:24,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:56:33,769 INFO L124 PetriNetUnfolderBase]: 48150/66695 cut-off events. [2023-08-26 10:56:33,769 INFO L125 PetriNetUnfolderBase]: For 286801/291615 co-relation queries the response was YES. [2023-08-26 10:56:34,401 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-26 10:56:34,643 INFO L140 encePairwiseOnDemand]: 683/688 looper letters, 377 selfloop transitions, 4 changer transitions 0/400 dead transitions. [2023-08-26 10:56:34,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 400 transitions, 6547 flow [2023-08-26 10:56:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:56:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:56:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1663 transitions. [2023-08-26 10:56:34,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40285852713178294 [2023-08-26 10:56:34,645 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1663 transitions. [2023-08-26 10:56:34,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1663 transitions. [2023-08-26 10:56:34,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:56:34,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1663 transitions. [2023-08-26 10:56:34,646 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-26 10:56:34,648 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-26 10:56:34,648 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-26 10:56:34,649 INFO L175 Difference]: Start difference. First operand has 168 places, 385 transitions, 5755 flow. Second operand 6 states and 1663 transitions. [2023-08-26 10:56:34,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 400 transitions, 6547 flow [2023-08-26 10:56:37,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 400 transitions, 6212 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-26 10:56:37,278 INFO L231 Difference]: Finished difference. Result has 166 places, 384 transitions, 5426 flow [2023-08-26 10:56:37,278 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-26 10:56:37,278 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 59 predicate places. [2023-08-26 10:56:37,278 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 384 transitions, 5426 flow [2023-08-26 10:56:37,279 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-26 10:56:37,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:56:37,279 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-26 10:56:37,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 10:56:37,279 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-26 10:56:37,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:56:37,279 INFO L85 PathProgramCache]: Analyzing trace with hash -905840664, now seen corresponding path program 3 times [2023-08-26 10:56:37,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:56:37,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724179791] [2023-08-26 10:56:37,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:56:37,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:56:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:56:37,442 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-26 10:56:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:56:37,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724179791] [2023-08-26 10:56:37,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724179791] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:56:37,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791760463] [2023-08-26 10:56:37,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 10:56:37,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:56:37,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:56:37,445 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-26 10:56:37,452 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-26 10:56:37,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 10:56:37,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:56:37,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-26 10:56:37,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:56:38,008 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-26 10:56:38,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:56:38,095 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-26 10:56:38,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791760463] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:56:38,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:56:38,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-26 10:56:38,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745060628] [2023-08-26 10:56:38,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:56:38,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-26 10:56:38,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:56:38,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-26 10:56:38,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-26 10:56:38,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 688 [2023-08-26 10:56:38,101 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-26 10:56:38,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:56:38,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 688 [2023-08-26 10:56:38,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:56:45,370 INFO L124 PetriNetUnfolderBase]: 26287/49144 cut-off events. [2023-08-26 10:56:45,370 INFO L125 PetriNetUnfolderBase]: For 456255/465478 co-relation queries the response was YES. [2023-08-26 10:56:45,893 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-26 10:56:46,069 INFO L140 encePairwiseOnDemand]: 678/688 looper letters, 405 selfloop transitions, 207 changer transitions 0/672 dead transitions. [2023-08-26 10:56:46,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 672 transitions, 10808 flow [2023-08-26 10:56:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 10:56:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 10:56:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2357 transitions. [2023-08-26 10:56:46,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38065245478036175 [2023-08-26 10:56:46,072 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2357 transitions. [2023-08-26 10:56:46,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2357 transitions. [2023-08-26 10:56:46,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:56:46,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2357 transitions. [2023-08-26 10:56:46,074 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-26 10:56:46,077 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-26 10:56:46,078 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-26 10:56:46,078 INFO L175 Difference]: Start difference. First operand has 166 places, 384 transitions, 5426 flow. Second operand 9 states and 2357 transitions. [2023-08-26 10:56:46,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 672 transitions, 10808 flow [2023-08-26 10:56:47,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 672 transitions, 10799 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 10:56:47,589 INFO L231 Difference]: Finished difference. Result has 174 places, 578 transitions, 10189 flow [2023-08-26 10:56:47,589 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-26 10:56:47,590 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 67 predicate places. [2023-08-26 10:56:47,590 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 578 transitions, 10189 flow [2023-08-26 10:56:47,590 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-26 10:56:47,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:56:47,590 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-26 10:56:47,596 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-26 10:56:47,791 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-26 10:56:47,791 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-26 10:56:47,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:56:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash -907894895, now seen corresponding path program 4 times [2023-08-26 10:56:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:56:47,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880982515] [2023-08-26 10:56:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:56:47,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:56:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:56:49,242 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-26 10:56:49,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:56:49,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880982515] [2023-08-26 10:56:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880982515] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:56:49,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900355987] [2023-08-26 10:56:49,242 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 10:56:49,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:56:49,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:56:49,245 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-26 10:56:49,275 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-26 11:01:45,130 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 11:01:45,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:01:45,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 99 conjunts are in the unsatisfiable core [2023-08-26 11:01:45,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:01:45,570 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-26 11:01:45,611 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-26 11:01:45,666 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:01:45,667 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-26 11:01:45,721 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:01:45,721 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-26 11:01:45,945 INFO L322 Elim1Store]: treesize reduction 168, result has 34.6 percent of original size [2023-08-26 11:01:45,946 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-26 11:01:46,017 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-26 11:01:46,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:02:37,377 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:02:49,348 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-26 11:02:49,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900355987] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:02:49,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:02:49,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 36 [2023-08-26 11:02:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170526049] [2023-08-26 11:02:49,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:02:49,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-26 11:02:49,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:02:49,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-26 11:02:49,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1157, Unknown=14, NotChecked=0, Total=1332 [2023-08-26 11:02:49,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 688 [2023-08-26 11:02:49,356 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-26 11:02:49,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:02:49,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 688 [2023-08-26 11:02:49,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:03:27,141 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-26 11:03:31,052 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-26 11:03:34,973 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-26 11:03:46,850 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-26 11:03:49,355 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-26 11:03:51,364 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-26 11:03:58,751 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-26 11:04:01,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:04:17,848 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-26 11:04:20,260 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-26 11:04:23,393 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-26 11:04:30,588 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-26 11:04:35,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:04:37,449 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-26 11:04:39,485 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-26 11:04:46,014 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-26 11:04:48,022 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-26 11:05:02,183 WARN L234 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 92 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:05:12,194 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-26 11:05:14,203 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-26 11:05:16,799 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-26 11:05:19,009 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-26 11:05:21,017 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-26 11:05:26,940 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-26 11:05:28,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-26 11:05:35,751 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-26 11:05:37,884 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-26 11:05:41,842 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-26 11:05:43,850 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-26 11:05:46,702 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-26 11:05:48,913 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-26 11:05:50,921 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-26 11:05:55,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:06:01,317 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-26 11:06:03,475 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-26 11:06:05,482 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-26 11:06:10,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-26 11:06:13,470 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-26 11:06:15,478 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-26 11:06:18,739 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-26 11:06:20,851 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-26 11:06:22,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] [2023-08-26 11:06:25,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-26 11:06:27,927 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-26 11:06:29,935 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-26 11:06:34,251 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-26 11:06:44,559 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-26 11:06:46,797 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-26 11:06:48,805 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-26 11:06:53,593 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-26 11:06:55,601 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-26 11:06:59,010 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-26 11:07:01,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:07:03,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:07:05,296 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-26 11:07:12,009 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-26 11:07:14,306 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-26 11:07:16,415 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-26 11:07:18,693 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-26 11:07:20,702 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-26 11:07:23,496 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-26 11:07:25,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:07:28,935 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-26 11:07:35,155 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-26 11:07:38,103 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-26 11:07:40,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:07:43,064 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-26 11:07:45,409 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-26 11:07:47,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-26 11:07:51,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-26 11:07:54,718 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse39 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse38 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse18 (+ .cse39 c_~B~0.offset 1)) (.cse16 (select |c_#race| c_~B~0.base)) (.cse33 (+ 2 .cse39 c_~B~0.offset)) (.cse17 (+ 3 .cse39 c_~B~0.offset))) (let ((.cse21 (store |c_#race| c_~B~0.base (store (store .cse16 .cse33 0) .cse17 0))) (.cse15 (+ .cse39 c_~B~0.offset)) (.cse10 (store |c_#race| c_~B~0.base (store (store (store .cse16 .cse18 0) .cse33 0) .cse17 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)) (.cse24 (store |c_#race| c_~B~0.base (store .cse16 .cse17 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) (= (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 .cse24 ~A~0.base (store (store (store (store (select .cse24 ~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) .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 ((.cse27 (let ((.cse28 (store .cse21 ~A~0.base (store (store (store (store (select .cse21 ~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) .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 ((.cse31 (let ((.cse32 (store .cse24 ~A~0.base (store (store (store (store (select .cse24 ~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) .cse17) 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 .cse24 ~A~0.base (store (store (store (store (select .cse24 ~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) .cse18) 0)))))) is different from true [2023-08-26 11:07:58,413 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-26 11:08:01,344 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-26 11:08:03,990 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] Received shutdown request... [2023-08-26 11:08:09,598 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-26 11:08:09,615 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-26 11:08:10,657 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-26 11:08:10,816 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-26 11:08:10,827 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-26 11:08:10,828 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (65 of 66 remaining) [2023-08-26 11:08:10,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 11:08:10,829 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 11:08:10,830 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (64 of 66 remaining) [2023-08-26 11:08:10,830 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (63 of 66 remaining) [2023-08-26 11:08:10,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (62 of 66 remaining) [2023-08-26 11:08:10,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (61 of 66 remaining) [2023-08-26 11:08:10,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (60 of 66 remaining) [2023-08-26 11:08:10,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (59 of 66 remaining) [2023-08-26 11:08:10,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (58 of 66 remaining) [2023-08-26 11:08:10,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (57 of 66 remaining) [2023-08-26 11:08:10,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (56 of 66 remaining) [2023-08-26 11:08:10,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (55 of 66 remaining) [2023-08-26 11:08:10,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (54 of 66 remaining) [2023-08-26 11:08:10,832 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (53 of 66 remaining) [2023-08-26 11:08:10,832 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (52 of 66 remaining) [2023-08-26 11:08:10,832 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (51 of 66 remaining) [2023-08-26 11:08:10,832 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (50 of 66 remaining) [2023-08-26 11:08:10,832 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (49 of 66 remaining) [2023-08-26 11:08:10,832 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (48 of 66 remaining) [2023-08-26 11:08:10,832 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (47 of 66 remaining) [2023-08-26 11:08:10,832 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (46 of 66 remaining) [2023-08-26 11:08:10,832 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (45 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (44 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (43 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (42 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 66 remaining) [2023-08-26 11:08:10,833 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (32 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (30 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (29 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (28 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (27 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONASSERT (25 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (17 of 66 remaining) [2023-08-26 11:08:10,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (14 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (8 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (7 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 66 remaining) [2023-08-26 11:08:10,835 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 66 remaining) [2023-08-26 11:08:10,838 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 66 remaining) [2023-08-26 11:08:10,838 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 66 remaining) [2023-08-26 11:08:10,838 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:08:10,843 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 11:08:10,843 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 11:08:10,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 11:08:10 BasicIcfg [2023-08-26 11:08:10,846 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 11:08:10,846 INFO L158 Benchmark]: Toolchain (without parser) took 827979.23ms. Allocated memory was 369.1MB in the beginning and 15.8GB in the end (delta: 15.4GB). Free memory was 344.3MB in the beginning and 13.6GB in the end (delta: -13.3GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-26 11:08:10,846 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 369.1MB. Free memory was 345.8MB in the beginning and 345.7MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 11:08:10,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.49ms. Allocated memory is still 369.1MB. Free memory was 344.3MB in the beginning and 331.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 11:08:10,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.49ms. Allocated memory is still 369.1MB. Free memory was 331.7MB in the beginning and 328.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 11:08:10,847 INFO L158 Benchmark]: Boogie Preprocessor took 57.64ms. Allocated memory is still 369.1MB. Free memory was 328.8MB in the beginning and 325.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:08:10,847 INFO L158 Benchmark]: RCFGBuilder took 815.40ms. Allocated memory is still 369.1MB. Free memory was 325.9MB in the beginning and 277.2MB in the end (delta: 48.7MB). Peak memory consumption was 48.2MB. Max. memory is 16.0GB. [2023-08-26 11:08:10,847 INFO L158 Benchmark]: TraceAbstraction took 826732.76ms. Allocated memory was 369.1MB in the beginning and 15.8GB in the end (delta: 15.4GB). Free memory was 276.4MB in the beginning and 13.6GB in the end (delta: -13.3GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2023-08-26 11:08:10,849 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 369.1MB. Free memory was 345.8MB in the beginning and 345.7MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 304.49ms. Allocated memory is still 369.1MB. Free memory was 344.3MB in the beginning and 331.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.49ms. Allocated memory is still 369.1MB. Free memory was 331.7MB in the beginning and 328.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 57.64ms. Allocated memory is still 369.1MB. Free memory was 328.8MB in the beginning and 325.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 815.40ms. Allocated memory is still 369.1MB. Free memory was 325.9MB in the beginning and 277.2MB in the end (delta: 48.7MB). Peak memory consumption was 48.2MB. Max. memory is 16.0GB. * TraceAbstraction took 826732.76ms. Allocated memory was 369.1MB in the beginning and 15.8GB in the end (delta: 15.4GB). Free memory was 276.4MB in the beginning and 13.6GB in the end (delta: -13.3GB). 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.4s, 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: 826.6s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 440.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.6s, HoareTripleCheckerStatistics: 65 mSolverCounterUnknown, 3312 SdHoareTripleChecker+Valid, 250.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3312 mSDsluCounter, 894 SdHoareTripleChecker+Invalid, 247.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2473 IncrementalHoareTripleChecker+Unchecked, 586 mSDsCounter, 556 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8983 IncrementalHoareTripleChecker+Invalid, 12078 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 556 mSolverCounterUnsat, 308 mSDtfsCounter, 8983 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 207 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 121.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, 296.4s SatisfiabilityAnalysisTime, 73.8s 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