/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 07:05:28,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 07:05:29,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 07:05:29,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 07:05:29,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 07:05:29,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 07:05:29,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 07:05:29,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 07:05:29,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 07:05:29,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 07:05:29,027 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 07:05:29,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 07:05:29,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 07:05:29,027 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 07:05:29,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 07:05:29,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 07:05:29,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 07:05:29,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 07:05:29,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 07:05:29,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 07:05:29,029 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 07:05:29,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 07:05:29,031 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 07:05:29,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 07:05:29,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 07:05:29,032 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 07:05:29,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 07:05:29,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 07:05:29,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 07:05:29,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 07:05:29,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 07:05:29,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 07:05:29,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 07:05:29,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 07:05:29,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 07:05:29,034 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 07:05:29,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 07:05:29,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 07:05:29,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 07:05:29,299 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 07:05:29,300 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 07:05:29,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2023-08-25 07:05:30,291 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 07:05:30,483 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 07:05:30,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2023-08-25 07:05:30,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89cff1ede/5b4020aad84144f5867f34656e11b41d/FLAGb13633ecb [2023-08-25 07:05:30,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89cff1ede/5b4020aad84144f5867f34656e11b41d [2023-08-25 07:05:30,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 07:05:30,507 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 07:05:30,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 07:05:30,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 07:05:30,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 07:05:30,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e5695c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30, skipping insertion in model container [2023-08-25 07:05:30,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,531 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 07:05:30,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 07:05:30,702 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 07:05:30,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 07:05:30,747 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 07:05:30,748 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 07:05:30,752 INFO L206 MainTranslator]: Completed translation [2023-08-25 07:05:30,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30 WrapperNode [2023-08-25 07:05:30,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 07:05:30,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 07:05:30,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 07:05:30,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 07:05:30,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,794 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 179 [2023-08-25 07:05:30,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 07:05:30,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 07:05:30,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 07:05:30,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 07:05:30,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 07:05:30,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 07:05:30,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 07:05:30,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 07:05:30,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30" (1/1) ... [2023-08-25 07:05:30,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 07:05:30,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:05:30,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 07:05:30,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 07:05:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 07:05:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 07:05:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 07:05:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 07:05:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 07:05:30,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 07:05:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 07:05:30,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 07:05:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 07:05:30,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 07:05:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 07:05:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 07:05:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 07:05:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 07:05:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 07:05:30,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 07:05:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 07:05:30,873 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 07:05:30,959 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 07:05:30,961 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 07:05:31,362 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 07:05:31,462 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 07:05:31,463 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-25 07:05:31,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:05:31 BoogieIcfgContainer [2023-08-25 07:05:31,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 07:05:31,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 07:05:31,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 07:05:31,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 07:05:31,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 07:05:30" (1/3) ... [2023-08-25 07:05:31,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed0c8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:05:31, skipping insertion in model container [2023-08-25 07:05:31,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:05:30" (2/3) ... [2023-08-25 07:05:31,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed0c8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:05:31, skipping insertion in model container [2023-08-25 07:05:31,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:05:31" (3/3) ... [2023-08-25 07:05:31,469 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2023-08-25 07:05:31,479 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 07:05:31,479 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-08-25 07:05:31,479 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 07:05:31,523 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-25 07:05:31,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 274 places, 280 transitions, 584 flow [2023-08-25 07:05:31,601 INFO L124 PetriNetUnfolderBase]: 16/277 cut-off events. [2023-08-25 07:05:31,602 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 07:05:31,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 277 events. 16/277 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 378 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 201. Up to 2 conditions per place. [2023-08-25 07:05:31,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 280 transitions, 584 flow [2023-08-25 07:05:31,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 260 places, 266 transitions, 550 flow [2023-08-25 07:05:31,615 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 07:05:31,620 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 266 transitions, 550 flow [2023-08-25 07:05:31,622 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 266 transitions, 550 flow [2023-08-25 07:05:31,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 266 transitions, 550 flow [2023-08-25 07:05:31,650 INFO L124 PetriNetUnfolderBase]: 16/266 cut-off events. [2023-08-25 07:05:31,651 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 07:05:31,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 16/266 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 376 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 201. Up to 2 conditions per place. [2023-08-25 07:05:31,655 INFO L119 LiptonReduction]: Number of co-enabled transitions 7186 [2023-08-25 07:05:37,595 INFO L134 LiptonReduction]: Checked pairs total: 43304 [2023-08-25 07:05:37,595 INFO L136 LiptonReduction]: Total number of compositions: 251 [2023-08-25 07:05:37,604 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 07:05:37,609 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;@6b7b366e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 07:05:37,609 INFO L358 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-08-25 07:05:37,611 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 07:05:37,611 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 07:05:37,611 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 07:05:37,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:05:37,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 07:05:37,612 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:05:37,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:05:37,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1079, now seen corresponding path program 1 times [2023-08-25 07:05:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:05:37,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454739557] [2023-08-25 07:05:37,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:05:37,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:05:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:05:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:05:37,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:05:37,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454739557] [2023-08-25 07:05:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454739557] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:05:37,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:05:37,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 07:05:37,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046680138] [2023-08-25 07:05:37,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:05:37,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 07:05:37,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:05:37,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 07:05:37,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 07:05:37,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 531 [2023-08-25 07:05:37,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 196 flow. Second operand has 2 states, 2 states have (on average 249.5) internal successors, (499), 2 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:37,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:05:37,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 531 [2023-08-25 07:05:37,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:05:38,036 INFO L124 PetriNetUnfolderBase]: 759/1840 cut-off events. [2023-08-25 07:05:38,037 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-08-25 07:05:38,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 1840 events. 759/1840 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13308 event pairs, 379 based on Foata normal form. 294/1687 useless extension candidates. Maximal degree in co-relation 2438. Up to 1002 conditions per place. [2023-08-25 07:05:38,053 INFO L140 encePairwiseOnDemand]: 506/531 looper letters, 28 selfloop transitions, 0 changer transitions 0/64 dead transitions. [2023-08-25 07:05:38,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 202 flow [2023-08-25 07:05:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 07:05:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 07:05:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 551 transitions. [2023-08-25 07:05:38,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188323917137476 [2023-08-25 07:05:38,072 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 551 transitions. [2023-08-25 07:05:38,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 551 transitions. [2023-08-25 07:05:38,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:05:38,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 551 transitions. [2023-08-25 07:05:38,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 275.5) internal successors, (551), 2 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 531.0) internal successors, (1593), 3 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,088 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 531.0) internal successors, (1593), 3 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,089 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 196 flow. Second operand 2 states and 551 transitions. [2023-08-25 07:05:38,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 202 flow [2023-08-25 07:05:38,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 190 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 07:05:38,096 INFO L231 Difference]: Finished difference. Result has 63 places, 64 transitions, 134 flow [2023-08-25 07:05:38,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=134, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2023-08-25 07:05:38,101 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -27 predicate places. [2023-08-25 07:05:38,101 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 134 flow [2023-08-25 07:05:38,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 249.5) internal successors, (499), 2 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:05:38,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:05:38,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 07:05:38,102 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:05:38,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:05:38,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1019390562, now seen corresponding path program 1 times [2023-08-25 07:05:38,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:05:38,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757547256] [2023-08-25 07:05:38,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:05:38,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:05:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:05:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:05:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:05:38,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757547256] [2023-08-25 07:05:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757547256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:05:38,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:05:38,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:05:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418859734] [2023-08-25 07:05:38,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:05:38,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:05:38,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:05:38,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:05:38,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:05:38,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 531 [2023-08-25 07:05:38,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:05:38,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 531 [2023-08-25 07:05:38,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:05:38,504 INFO L124 PetriNetUnfolderBase]: 1447/2666 cut-off events. [2023-08-25 07:05:38,505 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-08-25 07:05:38,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4753 conditions, 2666 events. 1447/2666 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15806 event pairs, 1091 based on Foata normal form. 0/2102 useless extension candidates. Maximal degree in co-relation 4750. Up to 2041 conditions per place. [2023-08-25 07:05:38,515 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 32 selfloop transitions, 1 changer transitions 0/61 dead transitions. [2023-08-25 07:05:38,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 194 flow [2023-08-25 07:05:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:05:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:05:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2023-08-25 07:05:38,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519774011299435 [2023-08-25 07:05:38,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2023-08-25 07:05:38,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2023-08-25 07:05:38,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:05:38,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2023-08-25 07:05:38,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,523 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 134 flow. Second operand 3 states and 720 transitions. [2023-08-25 07:05:38,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 194 flow [2023-08-25 07:05:38,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:05:38,524 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 130 flow [2023-08-25 07:05:38,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2023-08-25 07:05:38,525 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -28 predicate places. [2023-08-25 07:05:38,525 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 130 flow [2023-08-25 07:05:38,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:05:38,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:05:38,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 07:05:38,531 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:05:38,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:05:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash 382001754, now seen corresponding path program 1 times [2023-08-25 07:05:38,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:05:38,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077691146] [2023-08-25 07:05:38,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:05:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:05:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:05:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:05:38,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:05:38,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077691146] [2023-08-25 07:05:38,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077691146] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:05:38,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:05:38,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:05:38,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892748711] [2023-08-25 07:05:38,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:05:38,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:05:38,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:05:38,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:05:38,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:05:38,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 531 [2023-08-25 07:05:38,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:05:38,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 531 [2023-08-25 07:05:38,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:05:38,871 INFO L124 PetriNetUnfolderBase]: 1107/2121 cut-off events. [2023-08-25 07:05:38,872 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-25 07:05:38,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3642 conditions, 2121 events. 1107/2121 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13129 event pairs, 174 based on Foata normal form. 0/1762 useless extension candidates. Maximal degree in co-relation 3638. Up to 1227 conditions per place. [2023-08-25 07:05:38,886 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 47 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-08-25 07:05:38,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 80 transitions, 271 flow [2023-08-25 07:05:38,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:05:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:05:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 779 transitions. [2023-08-25 07:05:38,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48901443816698054 [2023-08-25 07:05:38,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 779 transitions. [2023-08-25 07:05:38,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 779 transitions. [2023-08-25 07:05:38,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:05:38,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 779 transitions. [2023-08-25 07:05:38,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 259.6666666666667) internal successors, (779), 3 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,896 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 130 flow. Second operand 3 states and 779 transitions. [2023-08-25 07:05:38,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 80 transitions, 271 flow [2023-08-25 07:05:38,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:05:38,898 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 141 flow [2023-08-25 07:05:38,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2023-08-25 07:05:38,899 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -27 predicate places. [2023-08-25 07:05:38,899 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 141 flow [2023-08-25 07:05:38,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:38,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:05:38,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:05:38,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 07:05:38,901 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:05:38,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:05:38,901 INFO L85 PathProgramCache]: Analyzing trace with hash 806442394, now seen corresponding path program 1 times [2023-08-25 07:05:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:05:38,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236855653] [2023-08-25 07:05:38,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:05:38,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:05:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:05:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:05:39,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:05:39,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236855653] [2023-08-25 07:05:39,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236855653] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:05:39,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:05:39,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:05:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436049636] [2023-08-25 07:05:39,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:05:39,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:05:39,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:05:39,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:05:39,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:05:39,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 531 [2023-08-25 07:05:39,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 209.33333333333334) internal successors, (1256), 6 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:39,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:05:39,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 531 [2023-08-25 07:05:39,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:05:40,399 INFO L124 PetriNetUnfolderBase]: 8690/11706 cut-off events. [2023-08-25 07:05:40,399 INFO L125 PetriNetUnfolderBase]: For 1261/1271 co-relation queries the response was YES. [2023-08-25 07:05:40,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24382 conditions, 11706 events. 8690/11706 cut-off events. For 1261/1271 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 65957 event pairs, 2134 based on Foata normal form. 0/9625 useless extension candidates. Maximal degree in co-relation 24378. Up to 6148 conditions per place. [2023-08-25 07:05:40,468 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 132 selfloop transitions, 13 changer transitions 0/155 dead transitions. [2023-08-25 07:05:40,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 155 transitions, 660 flow [2023-08-25 07:05:40,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:05:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:05:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1378 transitions. [2023-08-25 07:05:40,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325172630257376 [2023-08-25 07:05:40,473 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1378 transitions. [2023-08-25 07:05:40,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1378 transitions. [2023-08-25 07:05:40,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:05:40,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1378 transitions. [2023-08-25 07:05:40,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 229.66666666666666) internal successors, (1378), 6 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:40,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:40,483 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:40,483 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 141 flow. Second operand 6 states and 1378 transitions. [2023-08-25 07:05:40,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 155 transitions, 660 flow [2023-08-25 07:05:40,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 155 transitions, 660 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:05:40,486 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 251 flow [2023-08-25 07:05:40,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2023-08-25 07:05:40,487 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -17 predicate places. [2023-08-25 07:05:40,487 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 251 flow [2023-08-25 07:05:40,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.33333333333334) internal successors, (1256), 6 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:40,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:05:40,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:05:40,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 07:05:40,488 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:05:40,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:05:40,489 INFO L85 PathProgramCache]: Analyzing trace with hash 302131646, now seen corresponding path program 1 times [2023-08-25 07:05:40,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:05:40,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434179703] [2023-08-25 07:05:40,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:05:40,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:05:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:05:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:05:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:05:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434179703] [2023-08-25 07:05:40,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434179703] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:05:40,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:05:40,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 07:05:40,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977585129] [2023-08-25 07:05:40,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:05:40,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 07:05:40,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:05:40,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 07:05:40,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 07:05:40,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 531 [2023-08-25 07:05:40,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 193.6) internal successors, (968), 5 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:40,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:05:40,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 531 [2023-08-25 07:05:40,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:05:41,356 INFO L124 PetriNetUnfolderBase]: 5200/8740 cut-off events. [2023-08-25 07:05:41,356 INFO L125 PetriNetUnfolderBase]: For 6028/6367 co-relation queries the response was YES. [2023-08-25 07:05:41,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20003 conditions, 8740 events. 5200/8740 cut-off events. For 6028/6367 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 62809 event pairs, 2362 based on Foata normal form. 4/7388 useless extension candidates. Maximal degree in co-relation 19994. Up to 5426 conditions per place. [2023-08-25 07:05:41,395 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 94 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2023-08-25 07:05:41,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 133 transitions, 707 flow [2023-08-25 07:05:41,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:05:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:05:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1223 transitions. [2023-08-25 07:05:41,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38386691776522286 [2023-08-25 07:05:41,398 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1223 transitions. [2023-08-25 07:05:41,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1223 transitions. [2023-08-25 07:05:41,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:05:41,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1223 transitions. [2023-08-25 07:05:41,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 203.83333333333334) internal successors, (1223), 6 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:41,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:41,406 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:41,406 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 251 flow. Second operand 6 states and 1223 transitions. [2023-08-25 07:05:41,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 133 transitions, 707 flow [2023-08-25 07:05:41,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 133 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:05:41,417 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 319 flow [2023-08-25 07:05:41,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=82, PETRI_TRANSITIONS=82} [2023-08-25 07:05:41,418 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -8 predicate places. [2023-08-25 07:05:41,418 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 319 flow [2023-08-25 07:05:41,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 193.6) internal successors, (968), 5 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:41,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:05:41,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:05:41,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 07:05:41,419 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:05:41,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:05:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash 796196054, now seen corresponding path program 1 times [2023-08-25 07:05:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:05:41,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958802336] [2023-08-25 07:05:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:05:41,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:05:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:05:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:05:41,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:05:41,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958802336] [2023-08-25 07:05:41,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958802336] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:05:41,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:05:41,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:05:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884926579] [2023-08-25 07:05:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:05:41,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:05:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:05:41,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:05:41,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:05:41,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 531 [2023-08-25 07:05:41,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:41,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:05:41,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 531 [2023-08-25 07:05:41,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:05:43,311 INFO L124 PetriNetUnfolderBase]: 14534/19791 cut-off events. [2023-08-25 07:05:43,311 INFO L125 PetriNetUnfolderBase]: For 11583/11709 co-relation queries the response was YES. [2023-08-25 07:05:43,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49244 conditions, 19791 events. 14534/19791 cut-off events. For 11583/11709 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 120379 event pairs, 5767 based on Foata normal form. 0/16947 useless extension candidates. Maximal degree in co-relation 49230. Up to 15604 conditions per place. [2023-08-25 07:05:43,412 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 157 selfloop transitions, 25 changer transitions 0/190 dead transitions. [2023-08-25 07:05:43,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 190 transitions, 1139 flow [2023-08-25 07:05:43,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:05:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:05:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1353 transitions. [2023-08-25 07:05:43,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246704331450094 [2023-08-25 07:05:43,415 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1353 transitions. [2023-08-25 07:05:43,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1353 transitions. [2023-08-25 07:05:43,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:05:43,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1353 transitions. [2023-08-25 07:05:43,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:43,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:43,422 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:43,422 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 319 flow. Second operand 6 states and 1353 transitions. [2023-08-25 07:05:43,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 190 transitions, 1139 flow [2023-08-25 07:05:43,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 190 transitions, 1137 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-25 07:05:43,474 INFO L231 Difference]: Finished difference. Result has 91 places, 106 transitions, 575 flow [2023-08-25 07:05:43,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=91, PETRI_TRANSITIONS=106} [2023-08-25 07:05:43,476 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 1 predicate places. [2023-08-25 07:05:43,477 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 106 transitions, 575 flow [2023-08-25 07:05:43,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:43,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:05:43,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:05:43,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 07:05:43,478 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:05:43,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:05:43,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1016168326, now seen corresponding path program 1 times [2023-08-25 07:05:43,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:05:43,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714944373] [2023-08-25 07:05:43,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:05:43,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:05:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:05:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:05:43,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:05:43,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714944373] [2023-08-25 07:05:43,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714944373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:05:43,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:05:43,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 07:05:43,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352671307] [2023-08-25 07:05:43,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:05:43,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 07:05:43,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:05:43,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 07:05:43,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 07:05:43,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 531 [2023-08-25 07:05:43,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 106 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 200.2) internal successors, (1001), 5 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:43,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:05:43,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 531 [2023-08-25 07:05:43,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:05:44,129 INFO L124 PetriNetUnfolderBase]: 3470/6490 cut-off events. [2023-08-25 07:05:44,129 INFO L125 PetriNetUnfolderBase]: For 6727/7212 co-relation queries the response was YES. [2023-08-25 07:05:44,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16077 conditions, 6490 events. 3470/6490 cut-off events. For 6727/7212 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 49145 event pairs, 1331 based on Foata normal form. 96/5547 useless extension candidates. Maximal degree in co-relation 16058. Up to 4145 conditions per place. [2023-08-25 07:05:44,166 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 87 selfloop transitions, 10 changer transitions 0/136 dead transitions. [2023-08-25 07:05:44,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 136 transitions, 849 flow [2023-08-25 07:05:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:05:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:05:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1255 transitions. [2023-08-25 07:05:44,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39391086001255493 [2023-08-25 07:05:44,169 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1255 transitions. [2023-08-25 07:05:44,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1255 transitions. [2023-08-25 07:05:44,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:05:44,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1255 transitions. [2023-08-25 07:05:44,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.16666666666666) internal successors, (1255), 6 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:44,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:44,175 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:44,175 INFO L175 Difference]: Start difference. First operand has 91 places, 106 transitions, 575 flow. Second operand 6 states and 1255 transitions. [2023-08-25 07:05:44,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 136 transitions, 849 flow [2023-08-25 07:05:44,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 136 transitions, 809 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-08-25 07:05:44,188 INFO L231 Difference]: Finished difference. Result has 98 places, 108 transitions, 580 flow [2023-08-25 07:05:44,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=580, PETRI_PLACES=98, PETRI_TRANSITIONS=108} [2023-08-25 07:05:44,189 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places. [2023-08-25 07:05:44,189 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 580 flow [2023-08-25 07:05:44,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 200.2) internal successors, (1001), 5 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:44,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:05:44,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:05:44,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 07:05:44,189 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:05:44,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:05:44,190 INFO L85 PathProgramCache]: Analyzing trace with hash -198617508, now seen corresponding path program 1 times [2023-08-25 07:05:44,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:05:44,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604110345] [2023-08-25 07:05:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:05:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:05:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:05:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:05:44,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:05:44,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604110345] [2023-08-25 07:05:44,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604110345] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:05:44,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:05:44,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 07:05:44,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821118068] [2023-08-25 07:05:44,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:05:44,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-25 07:05:44,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:05:44,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-25 07:05:44,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-25 07:05:44,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 531 [2023-08-25 07:05:44,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 108 transitions, 580 flow. Second operand has 10 states, 10 states have (on average 190.7) internal successors, (1907), 10 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:44,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:05:44,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 531 [2023-08-25 07:05:44,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:05:45,978 INFO L124 PetriNetUnfolderBase]: 11351/15548 cut-off events. [2023-08-25 07:05:45,978 INFO L125 PetriNetUnfolderBase]: For 12882/13242 co-relation queries the response was YES. [2023-08-25 07:05:46,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43027 conditions, 15548 events. 11351/15548 cut-off events. For 12882/13242 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 93720 event pairs, 1386 based on Foata normal form. 453/13722 useless extension candidates. Maximal degree in co-relation 43005. Up to 5866 conditions per place. [2023-08-25 07:05:46,071 INFO L140 encePairwiseOnDemand]: 525/531 looper letters, 200 selfloop transitions, 8 changer transitions 0/219 dead transitions. [2023-08-25 07:05:46,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 219 transitions, 1508 flow [2023-08-25 07:05:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 07:05:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 07:05:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1442 transitions. [2023-08-25 07:05:46,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3879472693032015 [2023-08-25 07:05:46,075 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1442 transitions. [2023-08-25 07:05:46,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1442 transitions. [2023-08-25 07:05:46,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:05:46,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1442 transitions. [2023-08-25 07:05:46,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:46,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 531.0) internal successors, (4248), 8 states have internal predecessors, (4248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:46,081 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 531.0) internal successors, (4248), 8 states have internal predecessors, (4248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:46,082 INFO L175 Difference]: Start difference. First operand has 98 places, 108 transitions, 580 flow. Second operand 7 states and 1442 transitions. [2023-08-25 07:05:46,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 219 transitions, 1508 flow [2023-08-25 07:05:46,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 219 transitions, 1487 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 07:05:46,162 INFO L231 Difference]: Finished difference. Result has 99 places, 107 transitions, 571 flow [2023-08-25 07:05:46,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=571, PETRI_PLACES=99, PETRI_TRANSITIONS=107} [2023-08-25 07:05:46,162 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2023-08-25 07:05:46,163 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 107 transitions, 571 flow [2023-08-25 07:05:46,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 190.7) internal successors, (1907), 10 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:46,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:05:46,163 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] [2023-08-25 07:05:46,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 07:05:46,164 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:05:46,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:05:46,164 INFO L85 PathProgramCache]: Analyzing trace with hash 400247658, now seen corresponding path program 1 times [2023-08-25 07:05:46,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:05:46,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106785415] [2023-08-25 07:05:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:05:46,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:05:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:05:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:05:46,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:05:46,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106785415] [2023-08-25 07:05:46,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106785415] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:05:46,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:05:46,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 07:05:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330731459] [2023-08-25 07:05:46,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:05:46,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-25 07:05:46,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:05:46,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-25 07:05:46,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-25 07:05:46,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-25 07:05:46,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 107 transitions, 571 flow. Second operand has 8 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:46,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:05:46,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-25 07:05:46,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:05:50,056 INFO L124 PetriNetUnfolderBase]: 29705/41915 cut-off events. [2023-08-25 07:05:50,056 INFO L125 PetriNetUnfolderBase]: For 42536/42766 co-relation queries the response was YES. [2023-08-25 07:05:50,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116043 conditions, 41915 events. 29705/41915 cut-off events. For 42536/42766 co-relation queries the response was YES. Maximal size of possible extension queue 1887. Compared 289236 event pairs, 5053 based on Foata normal form. 0/36586 useless extension candidates. Maximal degree in co-relation 116022. Up to 15629 conditions per place. [2023-08-25 07:05:50,411 INFO L140 encePairwiseOnDemand]: 521/531 looper letters, 253 selfloop transitions, 54 changer transitions 0/314 dead transitions. [2023-08-25 07:05:50,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 314 transitions, 2475 flow [2023-08-25 07:05:50,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 07:05:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 07:05:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1567 transitions. [2023-08-25 07:05:50,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.368879472693032 [2023-08-25 07:05:50,415 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1567 transitions. [2023-08-25 07:05:50,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1567 transitions. [2023-08-25 07:05:50,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:05:50,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1567 transitions. [2023-08-25 07:05:50,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 195.875) internal successors, (1567), 8 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:50,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 531.0) internal successors, (4779), 9 states have internal predecessors, (4779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:50,423 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 531.0) internal successors, (4779), 9 states have internal predecessors, (4779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:50,423 INFO L175 Difference]: Start difference. First operand has 99 places, 107 transitions, 571 flow. Second operand 8 states and 1567 transitions. [2023-08-25 07:05:50,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 314 transitions, 2475 flow [2023-08-25 07:05:50,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 314 transitions, 2418 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 07:05:50,614 INFO L231 Difference]: Finished difference. Result has 105 places, 154 transitions, 1173 flow [2023-08-25 07:05:50,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1173, PETRI_PLACES=105, PETRI_TRANSITIONS=154} [2023-08-25 07:05:50,615 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 15 predicate places. [2023-08-25 07:05:50,615 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 154 transitions, 1173 flow [2023-08-25 07:05:50,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:50,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:05:50,616 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] [2023-08-25 07:05:50,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 07:05:50,616 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:05:50,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:05:50,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1638471860, now seen corresponding path program 2 times [2023-08-25 07:05:50,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:05:50,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916557222] [2023-08-25 07:05:50,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:05:50,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:05:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:05:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:05:50,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:05:50,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916557222] [2023-08-25 07:05:50,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916557222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:05:50,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:05:50,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 07:05:50,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354528387] [2023-08-25 07:05:50,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:05:50,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-25 07:05:50,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:05:50,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-25 07:05:50,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-25 07:05:50,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-25 07:05:50,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 154 transitions, 1173 flow. Second operand has 8 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:50,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:05:50,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-25 07:05:50,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:05:56,289 INFO L124 PetriNetUnfolderBase]: 44776/62123 cut-off events. [2023-08-25 07:05:56,290 INFO L125 PetriNetUnfolderBase]: For 83139/83449 co-relation queries the response was YES. [2023-08-25 07:05:56,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187862 conditions, 62123 events. 44776/62123 cut-off events. For 83139/83449 co-relation queries the response was YES. Maximal size of possible extension queue 2721. Compared 436136 event pairs, 10906 based on Foata normal form. 204/55960 useless extension candidates. Maximal degree in co-relation 187837. Up to 35215 conditions per place. [2023-08-25 07:05:56,735 INFO L140 encePairwiseOnDemand]: 521/531 looper letters, 302 selfloop transitions, 59 changer transitions 0/368 dead transitions. [2023-08-25 07:05:56,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 368 transitions, 3344 flow [2023-08-25 07:05:56,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 07:05:56,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 07:05:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1574 transitions. [2023-08-25 07:05:56,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3705273069679849 [2023-08-25 07:05:56,739 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1574 transitions. [2023-08-25 07:05:56,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1574 transitions. [2023-08-25 07:05:56,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:05:56,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1574 transitions. [2023-08-25 07:05:56,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 196.75) internal successors, (1574), 8 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:56,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 531.0) internal successors, (4779), 9 states have internal predecessors, (4779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:56,746 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 531.0) internal successors, (4779), 9 states have internal predecessors, (4779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:56,746 INFO L175 Difference]: Start difference. First operand has 105 places, 154 transitions, 1173 flow. Second operand 8 states and 1574 transitions. [2023-08-25 07:05:56,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 368 transitions, 3344 flow [2023-08-25 07:05:57,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 368 transitions, 3339 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 07:05:57,401 INFO L231 Difference]: Finished difference. Result has 114 places, 202 transitions, 1911 flow [2023-08-25 07:05:57,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1911, PETRI_PLACES=114, PETRI_TRANSITIONS=202} [2023-08-25 07:05:57,401 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 24 predicate places. [2023-08-25 07:05:57,401 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 202 transitions, 1911 flow [2023-08-25 07:05:57,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:57,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:05:57,402 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] [2023-08-25 07:05:57,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 07:05:57,402 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:05:57,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:05:57,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1526112448, now seen corresponding path program 1 times [2023-08-25 07:05:57,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:05:57,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881564634] [2023-08-25 07:05:57,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:05:57,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:05:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:05:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:05:57,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:05:57,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881564634] [2023-08-25 07:05:57,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881564634] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:05:57,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:05:57,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:05:57,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892501060] [2023-08-25 07:05:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:05:57,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:05:57,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:05:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:05:57,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:05:57,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 531 [2023-08-25 07:05:57,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 202 transitions, 1911 flow. Second operand has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:05:57,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:05:57,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 531 [2023-08-25 07:05:57,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:06:02,686 INFO L124 PetriNetUnfolderBase]: 38688/53524 cut-off events. [2023-08-25 07:06:02,686 INFO L125 PetriNetUnfolderBase]: For 128677/132586 co-relation queries the response was YES. [2023-08-25 07:06:02,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183954 conditions, 53524 events. 38688/53524 cut-off events. For 128677/132586 co-relation queries the response was YES. Maximal size of possible extension queue 2450. Compared 366413 event pairs, 14957 based on Foata normal form. 1239/48834 useless extension candidates. Maximal degree in co-relation 183925. Up to 48170 conditions per place. [2023-08-25 07:06:03,327 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 230 selfloop transitions, 17 changer transitions 0/263 dead transitions. [2023-08-25 07:06:03,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 263 transitions, 2793 flow [2023-08-25 07:06:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:06:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:06:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1333 transitions. [2023-08-25 07:06:03,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41839296924042685 [2023-08-25 07:06:03,342 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1333 transitions. [2023-08-25 07:06:03,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1333 transitions. [2023-08-25 07:06:03,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:06:03,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1333 transitions. [2023-08-25 07:06:03,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.16666666666666) internal successors, (1333), 6 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:03,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:03,348 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:03,348 INFO L175 Difference]: Start difference. First operand has 114 places, 202 transitions, 1911 flow. Second operand 6 states and 1333 transitions. [2023-08-25 07:06:03,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 263 transitions, 2793 flow [2023-08-25 07:06:03,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 263 transitions, 2718 flow, removed 35 selfloop flow, removed 2 redundant places. [2023-08-25 07:06:03,997 INFO L231 Difference]: Finished difference. Result has 122 places, 218 transitions, 2084 flow [2023-08-25 07:06:03,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2084, PETRI_PLACES=122, PETRI_TRANSITIONS=218} [2023-08-25 07:06:03,998 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 32 predicate places. [2023-08-25 07:06:03,998 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 218 transitions, 2084 flow [2023-08-25 07:06:03,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:03,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:06:03,999 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] [2023-08-25 07:06:03,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 07:06:03,999 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:06:03,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:06:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1131525155, now seen corresponding path program 1 times [2023-08-25 07:06:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:06:03,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932169825] [2023-08-25 07:06:03,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:06:03,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:06:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:06:04,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:06:04,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:06:04,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932169825] [2023-08-25 07:06:04,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932169825] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:06:04,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390347234] [2023-08-25 07:06:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:06:04,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:06:04,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:06:04,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:06:04,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 07:06:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:06:04,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-25 07:06:04,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:06:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:06:04,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:06:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:06:04,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390347234] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 07:06:04,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 07:06:04,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-25 07:06:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809602219] [2023-08-25 07:06:04,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 07:06:04,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-25 07:06:04,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:06:04,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-25 07:06:04,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-08-25 07:06:04,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 531 [2023-08-25 07:06:04,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 218 transitions, 2084 flow. Second operand has 14 states, 14 states have (on average 200.07142857142858) internal successors, (2801), 14 states have internal predecessors, (2801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:04,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:06:04,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 531 [2023-08-25 07:06:04,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:06:08,408 INFO L124 PetriNetUnfolderBase]: 21124/38109 cut-off events. [2023-08-25 07:06:08,409 INFO L125 PetriNetUnfolderBase]: For 162007/172909 co-relation queries the response was YES. [2023-08-25 07:06:08,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127898 conditions, 38109 events. 21124/38109 cut-off events. For 162007/172909 co-relation queries the response was YES. Maximal size of possible extension queue 1913. Compared 360731 event pairs, 5632 based on Foata normal form. 4337/38560 useless extension candidates. Maximal degree in co-relation 127865. Up to 15733 conditions per place. [2023-08-25 07:06:08,793 INFO L140 encePairwiseOnDemand]: 522/531 looper letters, 337 selfloop transitions, 32 changer transitions 0/413 dead transitions. [2023-08-25 07:06:08,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 413 transitions, 4686 flow [2023-08-25 07:06:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 07:06:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 07:06:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2075 transitions. [2023-08-25 07:06:08,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3907721280602637 [2023-08-25 07:06:08,798 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2075 transitions. [2023-08-25 07:06:08,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2075 transitions. [2023-08-25 07:06:08,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:06:08,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2075 transitions. [2023-08-25 07:06:08,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 207.5) internal successors, (2075), 10 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:08,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 531.0) internal successors, (5841), 11 states have internal predecessors, (5841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:08,805 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 531.0) internal successors, (5841), 11 states have internal predecessors, (5841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:08,806 INFO L175 Difference]: Start difference. First operand has 122 places, 218 transitions, 2084 flow. Second operand 10 states and 2075 transitions. [2023-08-25 07:06:08,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 413 transitions, 4686 flow [2023-08-25 07:06:09,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 413 transitions, 4662 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-25 07:06:09,294 INFO L231 Difference]: Finished difference. Result has 136 places, 237 transitions, 2416 flow [2023-08-25 07:06:09,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2416, PETRI_PLACES=136, PETRI_TRANSITIONS=237} [2023-08-25 07:06:09,295 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 46 predicate places. [2023-08-25 07:06:09,295 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 237 transitions, 2416 flow [2023-08-25 07:06:09,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 200.07142857142858) internal successors, (2801), 14 states have internal predecessors, (2801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:09,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:06:09,296 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:06:09,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-25 07:06:09,500 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,SelfDestructingSolverStorable11 [2023-08-25 07:06:09,501 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:06:09,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:06:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash -719744885, now seen corresponding path program 2 times [2023-08-25 07:06:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:06:09,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810543761] [2023-08-25 07:06:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:06:09,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:06:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:06:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 07:06:10,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:06:10,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810543761] [2023-08-25 07:06:10,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810543761] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:06:10,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618647549] [2023-08-25 07:06:10,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 07:06:10,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:06:10,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:06:10,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:06:10,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 07:06:10,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 07:06:10,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 07:06:10,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-25 07:06:10,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:06:10,784 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-25 07:06:10,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-25 07:06:10,833 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 07:06:10,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 07:06:10,972 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 07:06:11,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-25 07:06:11,042 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-25 07:06:11,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-08-25 07:06:11,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:06:11,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:06:11,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:06:11,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:06:11,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2023-08-25 07:06:11,179 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 77 treesize of output 65 [2023-08-25 07:06:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 07:06:15,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 07:06:15,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618647549] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:06:15,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 07:06:15,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 22 [2023-08-25 07:06:15,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544734045] [2023-08-25 07:06:15,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:06:15,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 07:06:15,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:06:15,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 07:06:15,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=427, Unknown=1, NotChecked=0, Total=552 [2023-08-25 07:06:15,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-25 07:06:15,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 237 transitions, 2416 flow. Second operand has 13 states, 13 states have (on average 178.6153846153846) internal successors, (2322), 13 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:15,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:06:15,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-25 07:06:15,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:06:21,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:06:23,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:06:29,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:06:31,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:06:33,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:06:35,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:06:39,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:06:47,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:06:53,545 INFO L124 PetriNetUnfolderBase]: 81894/118899 cut-off events. [2023-08-25 07:06:53,545 INFO L125 PetriNetUnfolderBase]: For 396476/396710 co-relation queries the response was YES. [2023-08-25 07:06:54,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412724 conditions, 118899 events. 81894/118899 cut-off events. For 396476/396710 co-relation queries the response was YES. Maximal size of possible extension queue 5325. Compared 965101 event pairs, 10281 based on Foata normal form. 258/107425 useless extension candidates. Maximal degree in co-relation 412685. Up to 38244 conditions per place. [2023-08-25 07:06:54,895 INFO L140 encePairwiseOnDemand]: 517/531 looper letters, 481 selfloop transitions, 67 changer transitions 0/555 dead transitions. [2023-08-25 07:06:54,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 555 transitions, 5898 flow [2023-08-25 07:06:54,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-25 07:06:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-25 07:06:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2534 transitions. [2023-08-25 07:06:54,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3670867738664349 [2023-08-25 07:06:54,900 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2534 transitions. [2023-08-25 07:06:54,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2534 transitions. [2023-08-25 07:06:54,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:06:54,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2534 transitions. [2023-08-25 07:06:54,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 194.92307692307693) internal successors, (2534), 13 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:54,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 531.0) internal successors, (7434), 14 states have internal predecessors, (7434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:54,913 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 531.0) internal successors, (7434), 14 states have internal predecessors, (7434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:06:54,913 INFO L175 Difference]: Start difference. First operand has 136 places, 237 transitions, 2416 flow. Second operand 13 states and 2534 transitions. [2023-08-25 07:06:54,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 555 transitions, 5898 flow [2023-08-25 07:07:00,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 555 transitions, 5834 flow, removed 29 selfloop flow, removed 1 redundant places. [2023-08-25 07:07:00,563 INFO L231 Difference]: Finished difference. Result has 155 places, 272 transitions, 2997 flow [2023-08-25 07:07:00,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=2382, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2997, PETRI_PLACES=155, PETRI_TRANSITIONS=272} [2023-08-25 07:07:00,563 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 65 predicate places. [2023-08-25 07:07:00,563 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 272 transitions, 2997 flow [2023-08-25 07:07:00,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 178.6153846153846) internal successors, (2322), 13 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:07:00,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:07:00,564 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:07:00,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 07:07:00,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-25 07:07:00,769 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:07:00,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:07:00,769 INFO L85 PathProgramCache]: Analyzing trace with hash -236810947, now seen corresponding path program 3 times [2023-08-25 07:07:00,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:07:00,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542316326] [2023-08-25 07:07:00,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:07:00,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:07:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:07:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 07:07:01,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:07:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542316326] [2023-08-25 07:07:01,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542316326] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:07:01,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190674282] [2023-08-25 07:07:01,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 07:07:01,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:07:01,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:07:01,425 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:07:01,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 07:07:01,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-25 07:07:01,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 07:07:01,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-25 07:07:01,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:07:01,625 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-25 07:07:01,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-25 07:07:01,661 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 07:07:01,662 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 07:07:01,782 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 07:07:01,822 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-25 07:07:01,855 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-25 07:07:01,894 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-08-25 07:07:02,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:07:02,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:07:02,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:07:02,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:07:02,019 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2023-08-25 07:07:02,024 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 77 treesize of output 65 [2023-08-25 07:07:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 07:07:08,085 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 07:07:08,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190674282] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:07:08,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 07:07:08,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 22 [2023-08-25 07:07:08,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943797005] [2023-08-25 07:07:08,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:07:08,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 07:07:08,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:07:08,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 07:07:08,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=439, Unknown=2, NotChecked=0, Total=552 [2023-08-25 07:07:08,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-25 07:07:08,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 272 transitions, 2997 flow. Second operand has 13 states, 13 states have (on average 178.6153846153846) internal successors, (2322), 13 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:07:08,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:07:08,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-25 07:07:08,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:07:13,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:15,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:17,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:19,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:21,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:23,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:25,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:30,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:32,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:34,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:36,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:38,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:40,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:43,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:07:51,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:08:06,009 INFO L124 PetriNetUnfolderBase]: 84960/119323 cut-off events. [2023-08-25 07:08:06,010 INFO L125 PetriNetUnfolderBase]: For 535445/536579 co-relation queries the response was YES. [2023-08-25 07:08:07,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460274 conditions, 119323 events. 84960/119323 cut-off events. For 535445/536579 co-relation queries the response was YES. Maximal size of possible extension queue 5098. Compared 908144 event pairs, 14186 based on Foata normal form. 654/107589 useless extension candidates. Maximal degree in co-relation 460227. Up to 40491 conditions per place. [2023-08-25 07:08:07,484 INFO L140 encePairwiseOnDemand]: 517/531 looper letters, 457 selfloop transitions, 131 changer transitions 0/595 dead transitions. [2023-08-25 07:08:07,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 595 transitions, 6917 flow [2023-08-25 07:08:07,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-25 07:08:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-25 07:08:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2516 transitions. [2023-08-25 07:08:07,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3644792119368391 [2023-08-25 07:08:07,488 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2516 transitions. [2023-08-25 07:08:07,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2516 transitions. [2023-08-25 07:08:07,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:08:07,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2516 transitions. [2023-08-25 07:08:07,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 193.53846153846155) internal successors, (2516), 13 states have internal predecessors, (2516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:08:07,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 531.0) internal successors, (7434), 14 states have internal predecessors, (7434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:08:07,497 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 531.0) internal successors, (7434), 14 states have internal predecessors, (7434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:08:07,497 INFO L175 Difference]: Start difference. First operand has 155 places, 272 transitions, 2997 flow. Second operand 13 states and 2516 transitions. [2023-08-25 07:08:07,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 595 transitions, 6917 flow [2023-08-25 07:08:15,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 595 transitions, 6639 flow, removed 111 selfloop flow, removed 3 redundant places. [2023-08-25 07:08:15,566 INFO L231 Difference]: Finished difference. Result has 172 places, 346 transitions, 4206 flow [2023-08-25 07:08:15,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=2857, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4206, PETRI_PLACES=172, PETRI_TRANSITIONS=346} [2023-08-25 07:08:15,566 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 82 predicate places. [2023-08-25 07:08:15,566 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 346 transitions, 4206 flow [2023-08-25 07:08:15,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 178.6153846153846) internal successors, (2322), 13 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:08:15,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:08:15,567 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] [2023-08-25 07:08:15,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 07:08:15,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:08:15,772 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:08:15,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:08:15,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1421222234, now seen corresponding path program 1 times [2023-08-25 07:08:15,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:08:15,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608045165] [2023-08-25 07:08:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:08:15,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:08:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:08:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:08:15,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:08:15,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608045165] [2023-08-25 07:08:15,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608045165] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:08:15,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398343189] [2023-08-25 07:08:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:08:15,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:08:15,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:08:15,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:08:15,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 07:08:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:08:15,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 07:08:15,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:08:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:08:16,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:08:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:08:16,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398343189] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 07:08:16,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 07:08:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-25 07:08:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219094780] [2023-08-25 07:08:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:08:16,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 07:08:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:08:16,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 07:08:16,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-25 07:08:16,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 531 [2023-08-25 07:08:16,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 346 transitions, 4206 flow. Second operand has 5 states, 5 states have (on average 194.2) internal successors, (971), 5 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:08:16,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:08:16,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 531 [2023-08-25 07:08:16,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:08:24,161 INFO L124 PetriNetUnfolderBase]: 40938/62420 cut-off events. [2023-08-25 07:08:24,161 INFO L125 PetriNetUnfolderBase]: For 398632/411033 co-relation queries the response was YES. [2023-08-25 07:08:24,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268619 conditions, 62420 events. 40938/62420 cut-off events. For 398632/411033 co-relation queries the response was YES. Maximal size of possible extension queue 3095. Compared 509306 event pairs, 11272 based on Foata normal form. 2341/57681 useless extension candidates. Maximal degree in co-relation 268564. Up to 46189 conditions per place. [2023-08-25 07:08:24,987 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 288 selfloop transitions, 42 changer transitions 8/375 dead transitions. [2023-08-25 07:08:24,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 375 transitions, 5024 flow [2023-08-25 07:08:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 07:08:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 07:08:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1027 transitions. [2023-08-25 07:08:24,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38681732580037664 [2023-08-25 07:08:24,990 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1027 transitions. [2023-08-25 07:08:24,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1027 transitions. [2023-08-25 07:08:24,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:08:24,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1027 transitions. [2023-08-25 07:08:24,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 205.4) internal successors, (1027), 5 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:08:24,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 531.0) internal successors, (3186), 6 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:08:24,993 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 531.0) internal successors, (3186), 6 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:08:24,993 INFO L175 Difference]: Start difference. First operand has 172 places, 346 transitions, 4206 flow. Second operand 5 states and 1027 transitions. [2023-08-25 07:08:24,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 375 transitions, 5024 flow [2023-08-25 07:08:30,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 375 transitions, 4913 flow, removed 51 selfloop flow, removed 2 redundant places. [2023-08-25 07:08:30,161 INFO L231 Difference]: Finished difference. Result has 176 places, 330 transitions, 4046 flow [2023-08-25 07:08:30,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=3906, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4046, PETRI_PLACES=176, PETRI_TRANSITIONS=330} [2023-08-25 07:08:30,162 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 86 predicate places. [2023-08-25 07:08:30,162 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 330 transitions, 4046 flow [2023-08-25 07:08:30,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 194.2) internal successors, (971), 5 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:08:30,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:08:30,162 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:08:30,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-25 07:08:30,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-25 07:08:30,367 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:08:30,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:08:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2112585811, now seen corresponding path program 1 times [2023-08-25 07:08:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:08:30,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728191630] [2023-08-25 07:08:30,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:08:30,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:08:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:08:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 07:08:30,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:08:30,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728191630] [2023-08-25 07:08:30,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728191630] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:08:30,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483561632] [2023-08-25 07:08:30,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:08:30,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:08:30,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:08:30,935 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:08:30,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 07:08:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:08:31,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-25 07:08:31,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:08:31,122 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-25 07:08:31,123 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-25 07:08:31,164 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 07:08:31,164 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 07:08:31,335 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 07:08:31,410 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-25 07:08:31,459 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-25 07:08:31,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-08-25 07:08:31,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:08:31,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:08:31,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:08:31,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:08:31,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2023-08-25 07:08:31,613 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 77 treesize of output 65 [2023-08-25 07:08:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 07:08:35,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:08:38,513 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_thread2Thread1of1ForFork0_~i~1_67 Int)) (or (< v_thread2Thread1of1ForFork0_~i~1_67 (+ c_thread2Thread1of1ForFork0_~i~1 1)) (forall ((v_ArrVal_1292 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_67 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1292) c_~A~0.base) (+ c_~A~0.offset .cse0))) 0)))) is different from false [2023-08-25 07:08:38,576 INFO L322 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2023-08-25 07:08:38,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 81 treesize of output 117 [2023-08-25 07:08:38,600 INFO L322 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-08-25 07:08:38,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 132 treesize of output 54 [2023-08-25 07:08:38,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-08-25 07:08:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-08-25 07:08:38,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483561632] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 07:08:38,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 07:08:38,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 29 [2023-08-25 07:08:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143992869] [2023-08-25 07:08:38,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 07:08:38,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-25 07:08:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:08:38,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-25 07:08:38,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=654, Unknown=54, NotChecked=56, Total=930 [2023-08-25 07:08:38,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-25 07:08:38,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 330 transitions, 4046 flow. Second operand has 31 states, 31 states have (on average 179.0) internal successors, (5549), 31 states have internal predecessors, (5549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:08:38,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:08:38,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-25 07:08:38,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:08:47,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:08:49,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:08:53,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:08:55,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:08:58,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:00,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:02,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:04,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:06,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:08,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:10,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:13,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:16,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:18,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:20,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:22,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:25,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:27,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:40,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:09:48,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:10:03,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:10:24,452 INFO L124 PetriNetUnfolderBase]: 132580/188156 cut-off events. [2023-08-25 07:10:24,452 INFO L125 PetriNetUnfolderBase]: For 973198/975400 co-relation queries the response was YES. [2023-08-25 07:10:26,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788356 conditions, 188156 events. 132580/188156 cut-off events. For 973198/975400 co-relation queries the response was YES. Maximal size of possible extension queue 7422. Compared 1525880 event pairs, 8548 based on Foata normal form. 1546/170920 useless extension candidates. Maximal degree in co-relation 788299. Up to 27957 conditions per place. [2023-08-25 07:10:27,662 INFO L140 encePairwiseOnDemand]: 500/531 looper letters, 1008 selfloop transitions, 683 changer transitions 0/1698 dead transitions. [2023-08-25 07:10:27,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 1698 transitions, 19436 flow [2023-08-25 07:10:27,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-08-25 07:10:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-08-25 07:10:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 8568 transitions. [2023-08-25 07:10:27,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3667180277349769 [2023-08-25 07:10:27,670 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 8568 transitions. [2023-08-25 07:10:27,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 8568 transitions. [2023-08-25 07:10:27,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:10:27,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 8568 transitions. [2023-08-25 07:10:27,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 194.72727272727272) internal successors, (8568), 44 states have internal predecessors, (8568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:10:27,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 531.0) internal successors, (23895), 45 states have internal predecessors, (23895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:10:27,690 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 531.0) internal successors, (23895), 45 states have internal predecessors, (23895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:10:27,690 INFO L175 Difference]: Start difference. First operand has 176 places, 330 transitions, 4046 flow. Second operand 44 states and 8568 transitions. [2023-08-25 07:10:27,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 1698 transitions, 19436 flow [2023-08-25 07:10:51,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 1698 transitions, 19136 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-08-25 07:10:51,465 INFO L231 Difference]: Finished difference. Result has 248 places, 904 transitions, 13051 flow [2023-08-25 07:10:51,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=3942, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=13051, PETRI_PLACES=248, PETRI_TRANSITIONS=904} [2023-08-25 07:10:51,465 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 158 predicate places. [2023-08-25 07:10:51,465 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 904 transitions, 13051 flow [2023-08-25 07:10:51,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 179.0) internal successors, (5549), 31 states have internal predecessors, (5549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:10:51,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:10:51,466 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:10:51,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-25 07:10:51,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-25 07:10:51,671 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 07:10:51,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:10:51,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1286806641, now seen corresponding path program 2 times [2023-08-25 07:10:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:10:51,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691535040] [2023-08-25 07:10:51,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:51,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:10:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 07:10:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:10:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691535040] [2023-08-25 07:10:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691535040] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:10:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45452975] [2023-08-25 07:10:52,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 07:10:52,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:10:52,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:10:52,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:10:52,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-25 07:10:52,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 07:10:52,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 07:10:52,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-25 07:10:52,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:10:52,597 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-25 07:10:52,597 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-25 07:10:52,633 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 07:10:52,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 07:10:52,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 07:10:52,787 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-25 07:10:52,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-25 07:10:52,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-08-25 07:10:52,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:10:52,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:10:52,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:10:52,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:10:52,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2023-08-25 07:10:52,993 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 77 treesize of output 65 [2023-08-25 07:10:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 07:10:57,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:10:57,158 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse2 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse2 c_~A~0.offset) 0) (+ .cse2 c_~A~0.offset 1) 0) (+ .cse2 c_~A~0.offset 2) 0) (+ .cse2 c_~A~0.offset 3) 0)))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) 0)) (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset .cse1 3)) 0)) (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset 2 .cse1)) 0)) (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)))) is different from false [2023-08-25 07:10:57,205 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse2 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse3 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse1 0) (+ .cse3 c_~A~0.offset) 0) (+ .cse3 c_~A~0.offset 1) 0) (+ .cse3 c_~A~0.offset 2) 0) (+ .cse3 c_~A~0.offset 3) 0))))) (and (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1492) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset 2 .cse2)) 0)) (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)) (forall ((v_ArrVal_1492 (Array Int Int))) (= 0 (select (select (store .cse0 c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset .cse2)))))))) is different from false [2023-08-25 07:11:11,950 INFO L322 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2023-08-25 07:11:11,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 81 treesize of output 117 [2023-08-25 07:11:11,958 INFO L322 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-08-25 07:11:11,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 132 treesize of output 54 [2023-08-25 07:11:11,963 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-08-25 07:11:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 5 not checked. [2023-08-25 07:11:12,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45452975] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 07:11:12,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 07:11:12,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 29 [2023-08-25 07:11:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042769616] [2023-08-25 07:11:12,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 07:11:12,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-25 07:11:12,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:12,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-25 07:11:12,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=8, NotChecked=110, Total=930 [2023-08-25 07:11:12,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-25 07:11:12,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 904 transitions, 13051 flow. Second operand has 31 states, 31 states have (on average 179.0) internal successors, (5549), 31 states have internal predecessors, (5549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:11:12,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:12,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-25 07:11:12,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:32,598 WARN L234 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 53 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:11:34,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:11:36,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:11:38,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:11:40,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:11:42,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:11:44,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:11:46,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:05,176 WARN L234 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 57 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:12:07,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:12:11,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:13,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:16,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:18,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-25 07:12:20,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:22,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:24,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:26,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:32,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:34,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:36,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:38,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:40,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:42,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:12:44,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:12:46,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:12:48,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:12:50,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:12:55,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:57,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:12:59,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:01,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:03,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:05,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:07,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:10,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:12,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:14,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:16,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:18,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:20,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:22,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:24,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:26,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:28,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-25 07:13:30,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-25 07:13:32,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:36,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:38,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:40,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:42,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:44,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:46,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:48,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:13:51,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:53,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:55,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:13:57,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-25 07:13:59,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:14:02,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:14:11,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:14:13,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:14:15,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:14:17,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:14:19,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:14:41,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:14:45,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:14:48,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:02,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:15:07,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:09,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-25 07:15:11,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:13,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:15,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:17,796 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 3) 0)) (.cse0 (+ c_thread2Thread1of1ForFork0_~i~1 1))) (and (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_72 Int)) (or (< v_thread2Thread1of1ForFork0_~i~1_72 .cse0) (forall ((v_ArrVal_1492 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_72 4))) (store (store (store (store .cse1 (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset .cse3 1)))))) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (forall ((v_thread2Thread1of1ForFork0_~i~1_72 Int)) (or (< v_thread2Thread1of1ForFork0_~i~1_72 .cse0) (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_72 4))) (store (store (store (store .cse1 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset 2 .cse3)) 0)))) (<= 0 c_thread2Thread1of1ForFork0_~i~1) (not (= c_~C~0.base c_~A~0.base)) (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_72 Int)) (or (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_72 4))) (store (store (store (store .cse1 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset .cse3)) 0)) (< v_thread2Thread1of1ForFork0_~i~1_72 .cse0))) (= c_~A~0.offset 0)))) is different from false [2023-08-25 07:15:19,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:21,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:29,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:31,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:33,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:35,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:38,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:46,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:49,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:54,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:15:59,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:16:03,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:16:05,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 07:16:19,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:16:21,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:16:23,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:16:25,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:16:48,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:16:50,174 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (+ c_thread2Thread1of1ForFork0_~i~1 1)) (.cse1 (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_72 Int)) (or (< v_thread2Thread1of1ForFork0_~i~1_72 .cse0) (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_72 4))) (store (store (store (store .cse1 (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset .cse3)) 0)))) (<= 0 c_thread2Thread1of1ForFork0_~i~1) (not (= c_~C~0.base c_~A~0.base)) (= c_~A~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_72 Int)) (or (< v_thread2Thread1of1ForFork0_~i~1_72 .cse0) (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_72 4))) (store (store (store (store .cse1 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset .cse3 1)) 0))))))) is different from false [2023-08-25 07:16:55,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:16:57,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:16:59,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:17:01,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:17:03,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-25 07:17:29,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:17:46,645 WARN L234 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 49 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:17:48,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:17:50,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:17:52,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:17:54,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:17:57,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:17:59,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:08,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:10,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:12,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:14,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:16,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] [2023-08-25 07:18:19,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:32,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:34,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:36,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:37,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:39,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:40,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:46,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:48,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:51,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:53,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:57,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:18:59,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:19:01,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:19:03,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:19:05,538 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-25 07:19:06,536 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 07:19:06,536 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 07:19:07,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-25 07:19:07,737 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-25 07:19:07,777 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2023-08-25 07:19:07,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-25 07:19:07,777 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-25 07:19:07,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2023-08-25 07:19:07,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2023-08-25 07:19:07,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2023-08-25 07:19:07,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2023-08-25 07:19:07,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2023-08-25 07:19:07,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2023-08-25 07:19:07,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2023-08-25 07:19:07,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2023-08-25 07:19:07,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2023-08-25 07:19:07,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2023-08-25 07:19:07,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2023-08-25 07:19:07,780 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2023-08-25 07:19:07,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONASSERT (19 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2023-08-25 07:19:07,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2023-08-25 07:19:07,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2023-08-25 07:19:07,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2023-08-25 07:19:07,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2023-08-25 07:19:07,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2023-08-25 07:19:07,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2023-08-25 07:19:07,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2023-08-25 07:19:07,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2023-08-25 07:19:07,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2023-08-25 07:19:07,783 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:19:07,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-25 07:19:07,791 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 07:19:07,791 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 07:19:07,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 07:19:07 BasicIcfg [2023-08-25 07:19:07,792 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 07:19:07,792 INFO L158 Benchmark]: Toolchain (without parser) took 817285.26ms. Allocated memory was 385.9MB in the beginning and 14.0GB in the end (delta: 13.7GB). Free memory was 362.2MB in the beginning and 9.1GB in the end (delta: -8.7GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. [2023-08-25 07:19:07,793 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 385.9MB. Free memory is still 362.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 07:19:07,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.46ms. Allocated memory is still 385.9MB. Free memory was 362.2MB in the beginning and 349.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-25 07:19:07,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.50ms. Allocated memory is still 385.9MB. Free memory was 349.9MB in the beginning and 347.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 07:19:07,793 INFO L158 Benchmark]: Boogie Preprocessor took 26.53ms. Allocated memory is still 385.9MB. Free memory was 347.4MB in the beginning and 345.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 07:19:07,793 INFO L158 Benchmark]: RCFGBuilder took 638.09ms. Allocated memory is still 385.9MB. Free memory was 345.0MB in the beginning and 361.5MB in the end (delta: -16.5MB). Peak memory consumption was 48.6MB. Max. memory is 16.0GB. [2023-08-25 07:19:07,793 INFO L158 Benchmark]: TraceAbstraction took 816326.78ms. Allocated memory was 385.9MB in the beginning and 14.0GB in the end (delta: 13.7GB). Free memory was 361.5MB in the beginning and 9.1GB in the end (delta: -8.7GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. [2023-08-25 07:19:07,794 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.10ms. Allocated memory is still 385.9MB. Free memory is still 362.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 242.46ms. Allocated memory is still 385.9MB. Free memory was 362.2MB in the beginning and 349.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 41.50ms. Allocated memory is still 385.9MB. Free memory was 349.9MB in the beginning and 347.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.53ms. Allocated memory is still 385.9MB. Free memory was 347.4MB in the beginning and 345.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 638.09ms. Allocated memory is still 385.9MB. Free memory was 345.0MB in the beginning and 361.5MB in the end (delta: -16.5MB). Peak memory consumption was 48.6MB. Max. memory is 16.0GB. * TraceAbstraction took 816326.78ms. Allocated memory was 385.9MB in the beginning and 14.0GB in the end (delta: 13.7GB). Free memory was 361.5MB in the beginning and 9.1GB in the end (delta: -8.7GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 260 PlacesBefore, 90 PlacesAfterwards, 266 TransitionsBefore, 89 TransitionsAfterwards, 7186 CoEnabledTransitionPairs, 8 FixpointIterations, 155 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 11 ConcurrentYvCompositions, 7 ChoiceCompositions, 251 TotalNumberOfCompositions, 43304 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15341, independent: 14443, independent conditional: 0, independent unconditional: 14443, dependent: 898, dependent conditional: 0, dependent unconditional: 898, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3792, independent: 3704, independent conditional: 0, independent unconditional: 3704, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15341, independent: 10739, independent conditional: 0, independent unconditional: 10739, dependent: 810, dependent conditional: 0, dependent unconditional: 810, unknown: 3792, unknown conditional: 0, unknown unconditional: 3792] , Statistics on independence cache: Total cache size (in pairs): 784, Positive cache size: 721, Positive conditional cache size: 0, Positive unconditional cache size: 721, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, 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: 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: 63]: 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: 74]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: 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: 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: 114]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 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: 100]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: 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: 97]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 339 locations, 51 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: 816.2s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 764.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 749 mSolverCounterUnknown, 3094 SdHoareTripleChecker+Valid, 364.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3094 mSDsluCounter, 724 SdHoareTripleChecker+Invalid, 362.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4154 IncrementalHoareTripleChecker+Unchecked, 451 mSDsCounter, 815 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8796 IncrementalHoareTripleChecker+Invalid, 14515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 815 mSolverCounterUnsat, 273 mSDtfsCounter, 8796 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 543 GetRequests, 234 SyntacticMatches, 19 SemanticMatches, 290 ConstructedPredicates, 5 IntricatePredicates, 6 DeprecatedPredicates, 3622 ImplicationChecksByTransitivity, 249.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13051occurred in iteration=16, InterpolantAutomatonStates: 146, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 43.2s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 623 ConstructedInterpolants, 24 QuantifiedInterpolants, 9462 SizeOfPredicates, 47 NumberOfNonLiveVariables, 2097 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 27 InterpolantComputations, 14 PerfectInterpolantSequences, 96/149 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