/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 10:50:45,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 10:50:45,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 10:50:45,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 10:50:45,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 10:50:45,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 10:50:45,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 10:50:45,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 10:50:45,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 10:50:45,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 10:50:45,665 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 10:50:45,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 10:50:45,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 10:50:45,666 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 10:50:45,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 10:50:45,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 10:50:45,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 10:50:45,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 10:50:45,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 10:50:45,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 10:50:45,668 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 10:50:45,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 10:50:45,668 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 10:50:45,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 10:50:45,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 10:50:45,669 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 10:50:45,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 10:50:45,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 10:50:45,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 10:50:45,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 10:50:45,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 10:50:45,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 10:50:45,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 10:50:45,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 10:50:45,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 10:50:45,671 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-26 10:50:45,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 10:50:45,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 10:50:45,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 10:50:45,915 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 10:50:45,917 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 10:50:45,920 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-26 10:50:47,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 10:50:47,135 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 10:50:47,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2023-08-26 10:50:47,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244970875/72ceea9ef52c470988152c1ad93daf4b/FLAG01eb65eb1 [2023-08-26 10:50:47,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244970875/72ceea9ef52c470988152c1ad93daf4b [2023-08-26 10:50:47,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 10:50:47,555 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 10:50:47,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 10:50:47,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 10:50:47,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 10:50:47,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@419dd9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47, skipping insertion in model container [2023-08-26 10:50:47,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,575 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 10:50:47,680 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 10:50:47,688 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 10:50:47,706 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 10:50:47,711 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 10:50:47,711 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 10:50:47,715 INFO L206 MainTranslator]: Completed translation [2023-08-26 10:50:47,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47 WrapperNode [2023-08-26 10:50:47,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 10:50:47,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 10:50:47,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 10:50:47,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 10:50:47,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,745 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 179 [2023-08-26 10:50:47,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 10:50:47,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 10:50:47,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 10:50:47,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 10:50:47,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 10:50:47,789 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 10:50:47,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 10:50:47,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 10:50:47,789 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47" (1/1) ... [2023-08-26 10:50:47,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 10:50:47,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:50:47,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 10:50:47,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 10:50:47,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 10:50:47,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 10:50:47,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 10:50:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 10:50:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 10:50:47,862 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 10:50:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 10:50:47,862 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 10:50:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 10:50:47,863 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 10:50:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 10:50:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 10:50:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 10:50:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-26 10:50:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 10:50:47,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 10:50:47,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 10:50:47,864 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 10:50:47,963 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 10:50:47,965 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 10:50:48,369 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 10:50:48,448 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 10:50:48,449 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-26 10:50:48,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:50:48 BoogieIcfgContainer [2023-08-26 10:50:48,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 10:50:48,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 10:50:48,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 10:50:48,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 10:50:48,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 10:50:47" (1/3) ... [2023-08-26 10:50:48,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b49c4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:50:48, skipping insertion in model container [2023-08-26 10:50:48,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:50:47" (2/3) ... [2023-08-26 10:50:48,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b49c4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:50:48, skipping insertion in model container [2023-08-26 10:50:48,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:50:48" (3/3) ... [2023-08-26 10:50:48,460 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2023-08-26 10:50:48,472 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 10:50:48,472 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-08-26 10:50:48,473 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 10:50:48,549 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-26 10:50:48,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 274 places, 280 transitions, 584 flow [2023-08-26 10:50:48,667 INFO L124 PetriNetUnfolderBase]: 16/277 cut-off events. [2023-08-26 10:50:48,667 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 10:50:48,674 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-26 10:50:48,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 280 transitions, 584 flow [2023-08-26 10:50:48,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 260 places, 266 transitions, 550 flow [2023-08-26 10:50:48,687 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 10:50:48,696 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 266 transitions, 550 flow [2023-08-26 10:50:48,698 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 266 transitions, 550 flow [2023-08-26 10:50:48,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 266 transitions, 550 flow [2023-08-26 10:50:48,766 INFO L124 PetriNetUnfolderBase]: 16/266 cut-off events. [2023-08-26 10:50:48,767 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 10:50:48,768 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-26 10:50:48,770 INFO L119 LiptonReduction]: Number of co-enabled transitions 7186 [2023-08-26 10:50:54,254 INFO L134 LiptonReduction]: Checked pairs total: 43304 [2023-08-26 10:50:54,254 INFO L136 LiptonReduction]: Total number of compositions: 251 [2023-08-26 10:50:54,265 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 10:50:54,268 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;@21e60efc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 10:50:54,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-08-26 10:50:54,269 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 10:50:54,269 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 10:50:54,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 10:50:54,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:54,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 10:50:54,270 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-26 10:50:54,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1079, now seen corresponding path program 1 times [2023-08-26 10:50:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:54,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951599195] [2023-08-26 10:50:54,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:54,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:54,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951599195] [2023-08-26 10:50:54,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951599195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:50:54,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:50:54,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 10:50:54,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253707503] [2023-08-26 10:50:54,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:50:54,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 10:50:54,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:54,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 10:50:54,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 10:50:54,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 531 [2023-08-26 10:50:54,380 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-26 10:50:54,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:54,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 531 [2023-08-26 10:50:54,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:50:54,650 INFO L124 PetriNetUnfolderBase]: 759/1840 cut-off events. [2023-08-26 10:50:54,651 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-08-26 10:50:54,655 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-26 10:50:54,661 INFO L140 encePairwiseOnDemand]: 506/531 looper letters, 28 selfloop transitions, 0 changer transitions 0/64 dead transitions. [2023-08-26 10:50:54,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 202 flow [2023-08-26 10:50:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 10:50:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 10:50:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 551 transitions. [2023-08-26 10:50:54,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188323917137476 [2023-08-26 10:50:54,672 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 551 transitions. [2023-08-26 10:50:54,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 551 transitions. [2023-08-26 10:50:54,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:54,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 551 transitions. [2023-08-26 10:50:54,677 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-26 10:50:54,680 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-26 10:50:54,681 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-26 10:50:54,682 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 196 flow. Second operand 2 states and 551 transitions. [2023-08-26 10:50:54,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 202 flow [2023-08-26 10:50:54,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 190 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-26 10:50:54,686 INFO L231 Difference]: Finished difference. Result has 63 places, 64 transitions, 134 flow [2023-08-26 10:50:54,687 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-26 10:50:54,689 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -27 predicate places. [2023-08-26 10:50:54,689 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 134 flow [2023-08-26 10:50:54,689 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-26 10:50:54,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:54,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:50:54,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 10:50:54,690 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-26 10:50:54,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1019390562, now seen corresponding path program 1 times [2023-08-26 10:50:54,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:54,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706952541] [2023-08-26 10:50:54,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:54,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:54,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706952541] [2023-08-26 10:50:54,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706952541] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:50:54,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:50:54,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:50:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243618149] [2023-08-26 10:50:54,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:50:54,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:50:54,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:54,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:50:54,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:50:54,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 531 [2023-08-26 10:50:54,768 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-26 10:50:54,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:54,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 531 [2023-08-26 10:50:54,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:50:54,909 INFO L124 PetriNetUnfolderBase]: 1447/2666 cut-off events. [2023-08-26 10:50:54,909 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-08-26 10:50:54,911 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-26 10:50:54,919 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 32 selfloop transitions, 1 changer transitions 0/61 dead transitions. [2023-08-26 10:50:54,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 194 flow [2023-08-26 10:50:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:50:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:50:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2023-08-26 10:50:54,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519774011299435 [2023-08-26 10:50:54,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2023-08-26 10:50:54,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2023-08-26 10:50:54,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:54,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2023-08-26 10:50:54,923 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-26 10:50:54,926 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-26 10:50:54,926 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-26 10:50:54,926 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 134 flow. Second operand 3 states and 720 transitions. [2023-08-26 10:50:54,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 194 flow [2023-08-26 10:50:54,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:50:54,928 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 130 flow [2023-08-26 10:50:54,928 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-26 10:50:54,929 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -28 predicate places. [2023-08-26 10:50:54,929 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 130 flow [2023-08-26 10:50:54,929 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-26 10:50:54,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:54,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:50:54,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 10:50:54,930 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-26 10:50:54,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:54,930 INFO L85 PathProgramCache]: Analyzing trace with hash 382001754, now seen corresponding path program 1 times [2023-08-26 10:50:54,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:54,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544177421] [2023-08-26 10:50:54,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:54,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:54,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:54,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544177421] [2023-08-26 10:50:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544177421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:50:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:50:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:50:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705852570] [2023-08-26 10:50:54,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:50:54,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:50:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:54,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:50:54,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:50:54,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 531 [2023-08-26 10:50:54,979 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-26 10:50:54,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:54,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 531 [2023-08-26 10:50:54,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:50:55,150 INFO L124 PetriNetUnfolderBase]: 1107/2121 cut-off events. [2023-08-26 10:50:55,150 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-26 10:50:55,153 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-26 10:50:55,160 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 47 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-08-26 10:50:55,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 80 transitions, 271 flow [2023-08-26 10:50:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:50:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:50:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 779 transitions. [2023-08-26 10:50:55,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48901443816698054 [2023-08-26 10:50:55,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 779 transitions. [2023-08-26 10:50:55,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 779 transitions. [2023-08-26 10:50:55,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:55,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 779 transitions. [2023-08-26 10:50:55,164 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-26 10:50:55,166 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-26 10:50:55,167 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-26 10:50:55,167 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 130 flow. Second operand 3 states and 779 transitions. [2023-08-26 10:50:55,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 80 transitions, 271 flow [2023-08-26 10:50:55,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:50:55,169 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 141 flow [2023-08-26 10:50:55,169 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-26 10:50:55,169 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -27 predicate places. [2023-08-26 10:50:55,170 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 141 flow [2023-08-26 10:50:55,170 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-26 10:50:55,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:55,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:50:55,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 10:50:55,170 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-26 10:50:55,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash 806442394, now seen corresponding path program 1 times [2023-08-26 10:50:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:55,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606720660] [2023-08-26 10:50:55,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:55,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:55,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:55,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606720660] [2023-08-26 10:50:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606720660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:50:55,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:50:55,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:50:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664579586] [2023-08-26 10:50:55,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:50:55,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:50:55,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:55,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:50:55,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:50:55,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 531 [2023-08-26 10:50:55,526 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-26 10:50:55,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:55,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 531 [2023-08-26 10:50:55,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:50:56,362 INFO L124 PetriNetUnfolderBase]: 8690/11706 cut-off events. [2023-08-26 10:50:56,362 INFO L125 PetriNetUnfolderBase]: For 1261/1271 co-relation queries the response was YES. [2023-08-26 10:50:56,373 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-26 10:50:56,411 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 132 selfloop transitions, 13 changer transitions 0/155 dead transitions. [2023-08-26 10:50:56,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 155 transitions, 660 flow [2023-08-26 10:50:56,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:50:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:50:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1378 transitions. [2023-08-26 10:50:56,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325172630257376 [2023-08-26 10:50:56,414 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1378 transitions. [2023-08-26 10:50:56,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1378 transitions. [2023-08-26 10:50:56,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:56,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1378 transitions. [2023-08-26 10:50:56,417 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-26 10:50:56,420 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-26 10:50:56,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-26 10:50:56,422 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 141 flow. Second operand 6 states and 1378 transitions. [2023-08-26 10:50:56,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 155 transitions, 660 flow [2023-08-26 10:50:56,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 155 transitions, 660 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:50:56,424 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 251 flow [2023-08-26 10:50:56,424 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-26 10:50:56,425 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -17 predicate places. [2023-08-26 10:50:56,425 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 251 flow [2023-08-26 10:50:56,426 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-26 10:50:56,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:56,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:50:56,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 10:50:56,426 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-26 10:50:56,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:56,426 INFO L85 PathProgramCache]: Analyzing trace with hash 302131646, now seen corresponding path program 1 times [2023-08-26 10:50:56,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:56,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992262907] [2023-08-26 10:50:56,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:56,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:56,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:56,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992262907] [2023-08-26 10:50:56,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992262907] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:50:56,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:50:56,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 10:50:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607060203] [2023-08-26 10:50:56,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:50:56,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 10:50:56,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:56,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 10:50:56,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 10:50:56,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 531 [2023-08-26 10:50:56,490 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-26 10:50:56,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:56,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 531 [2023-08-26 10:50:56,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:50:57,205 INFO L124 PetriNetUnfolderBase]: 5200/8740 cut-off events. [2023-08-26 10:50:57,206 INFO L125 PetriNetUnfolderBase]: For 6028/6367 co-relation queries the response was YES. [2023-08-26 10:50:57,220 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-26 10:50:57,240 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 94 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2023-08-26 10:50:57,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 133 transitions, 707 flow [2023-08-26 10:50:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:50:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:50:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1223 transitions. [2023-08-26 10:50:57,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38386691776522286 [2023-08-26 10:50:57,244 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1223 transitions. [2023-08-26 10:50:57,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1223 transitions. [2023-08-26 10:50:57,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:57,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1223 transitions. [2023-08-26 10:50:57,246 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-26 10:50:57,249 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-26 10:50:57,250 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-26 10:50:57,250 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 251 flow. Second operand 6 states and 1223 transitions. [2023-08-26 10:50:57,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 133 transitions, 707 flow [2023-08-26 10:50:57,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 133 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:50:57,261 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 319 flow [2023-08-26 10:50:57,262 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-26 10:50:57,262 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -8 predicate places. [2023-08-26 10:50:57,262 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 319 flow [2023-08-26 10:50:57,263 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-26 10:50:57,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:57,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:50:57,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 10:50:57,263 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-26 10:50:57,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:57,263 INFO L85 PathProgramCache]: Analyzing trace with hash 796196054, now seen corresponding path program 1 times [2023-08-26 10:50:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:57,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814475093] [2023-08-26 10:50:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:57,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:57,429 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-26 10:50:57,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814475093] [2023-08-26 10:50:57,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814475093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:50:57,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:50:57,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:50:57,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572320803] [2023-08-26 10:50:57,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:50:57,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:50:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:50:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:50:57,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 531 [2023-08-26 10:50:57,433 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-26 10:50:57,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:57,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 531 [2023-08-26 10:50:57,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:50:59,248 INFO L124 PetriNetUnfolderBase]: 14534/19791 cut-off events. [2023-08-26 10:50:59,248 INFO L125 PetriNetUnfolderBase]: For 11583/11709 co-relation queries the response was YES. [2023-08-26 10:50:59,277 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-26 10:50:59,331 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 157 selfloop transitions, 25 changer transitions 0/190 dead transitions. [2023-08-26 10:50:59,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 190 transitions, 1139 flow [2023-08-26 10:50:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:50:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:50:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1353 transitions. [2023-08-26 10:50:59,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246704331450094 [2023-08-26 10:50:59,335 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1353 transitions. [2023-08-26 10:50:59,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1353 transitions. [2023-08-26 10:50:59,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:59,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1353 transitions. [2023-08-26 10:50:59,406 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-26 10:50:59,409 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-26 10:50:59,409 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-26 10:50:59,410 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 319 flow. Second operand 6 states and 1353 transitions. [2023-08-26 10:50:59,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 190 transitions, 1139 flow [2023-08-26 10:50:59,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 190 transitions, 1137 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 10:50:59,451 INFO L231 Difference]: Finished difference. Result has 91 places, 106 transitions, 575 flow [2023-08-26 10:50:59,451 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-26 10:50:59,453 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 1 predicate places. [2023-08-26 10:50:59,455 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 106 transitions, 575 flow [2023-08-26 10:50:59,456 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-26 10:50:59,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:59,457 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-26 10:50:59,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 10:50:59,457 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-26 10:50:59,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:59,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1016168326, now seen corresponding path program 1 times [2023-08-26 10:50:59,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:59,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076649778] [2023-08-26 10:50:59,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:59,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:59,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:59,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076649778] [2023-08-26 10:50:59,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076649778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:50:59,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:50:59,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 10:50:59,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173020121] [2023-08-26 10:50:59,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:50:59,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 10:50:59,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:59,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 10:50:59,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 10:50:59,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 531 [2023-08-26 10:50:59,535 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-26 10:50:59,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:59,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 531 [2023-08-26 10:50:59,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:51:00,090 INFO L124 PetriNetUnfolderBase]: 3470/6490 cut-off events. [2023-08-26 10:51:00,091 INFO L125 PetriNetUnfolderBase]: For 6727/7212 co-relation queries the response was YES. [2023-08-26 10:51:00,109 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-26 10:51:00,128 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 87 selfloop transitions, 10 changer transitions 0/136 dead transitions. [2023-08-26 10:51:00,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 136 transitions, 849 flow [2023-08-26 10:51:00,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:51:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:51:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1255 transitions. [2023-08-26 10:51:00,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39391086001255493 [2023-08-26 10:51:00,132 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1255 transitions. [2023-08-26 10:51:00,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1255 transitions. [2023-08-26 10:51:00,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:51:00,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1255 transitions. [2023-08-26 10:51:00,134 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-26 10:51:00,137 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-26 10:51:00,138 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-26 10:51:00,138 INFO L175 Difference]: Start difference. First operand has 91 places, 106 transitions, 575 flow. Second operand 6 states and 1255 transitions. [2023-08-26 10:51:00,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 136 transitions, 849 flow [2023-08-26 10:51:00,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 136 transitions, 809 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-08-26 10:51:00,153 INFO L231 Difference]: Finished difference. Result has 98 places, 108 transitions, 580 flow [2023-08-26 10:51:00,154 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-26 10:51:00,155 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places. [2023-08-26 10:51:00,156 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 580 flow [2023-08-26 10:51:00,157 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-26 10:51:00,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:51:00,157 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-26 10:51:00,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 10:51:00,157 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-26 10:51:00,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:51:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash -198617508, now seen corresponding path program 1 times [2023-08-26 10:51:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:51:00,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992852379] [2023-08-26 10:51:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:51:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:51:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:51:00,686 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-26 10:51:00,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:51:00,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992852379] [2023-08-26 10:51:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992852379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:51:00,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:51:00,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 10:51:00,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760050883] [2023-08-26 10:51:00,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:51:00,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 10:51:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:51:00,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 10:51:00,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-26 10:51:00,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 531 [2023-08-26 10:51:00,690 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-26 10:51:00,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:51:00,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 531 [2023-08-26 10:51:00,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:51:02,020 INFO L124 PetriNetUnfolderBase]: 11351/15548 cut-off events. [2023-08-26 10:51:02,020 INFO L125 PetriNetUnfolderBase]: For 12882/13242 co-relation queries the response was YES. [2023-08-26 10:51:02,053 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-26 10:51:02,093 INFO L140 encePairwiseOnDemand]: 525/531 looper letters, 200 selfloop transitions, 8 changer transitions 0/219 dead transitions. [2023-08-26 10:51:02,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 219 transitions, 1508 flow [2023-08-26 10:51:02,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 10:51:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 10:51:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1442 transitions. [2023-08-26 10:51:02,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3879472693032015 [2023-08-26 10:51:02,099 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1442 transitions. [2023-08-26 10:51:02,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1442 transitions. [2023-08-26 10:51:02,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:51:02,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1442 transitions. [2023-08-26 10:51:02,101 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-26 10:51:02,105 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-26 10:51:02,105 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-26 10:51:02,105 INFO L175 Difference]: Start difference. First operand has 98 places, 108 transitions, 580 flow. Second operand 7 states and 1442 transitions. [2023-08-26 10:51:02,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 219 transitions, 1508 flow [2023-08-26 10:51:02,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 219 transitions, 1487 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 10:51:02,172 INFO L231 Difference]: Finished difference. Result has 99 places, 107 transitions, 571 flow [2023-08-26 10:51:02,172 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-26 10:51:02,174 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2023-08-26 10:51:02,175 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 107 transitions, 571 flow [2023-08-26 10:51:02,175 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-26 10:51:02,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:51:02,176 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-26 10:51:02,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 10:51:02,176 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-26 10:51:02,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:51:02,179 INFO L85 PathProgramCache]: Analyzing trace with hash 400247658, now seen corresponding path program 1 times [2023-08-26 10:51:02,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:51:02,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744815873] [2023-08-26 10:51:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:51:02,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:51:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:51:02,503 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-26 10:51:02,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:51:02,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744815873] [2023-08-26 10:51:02,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744815873] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:51:02,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:51:02,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 10:51:02,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817954212] [2023-08-26 10:51:02,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:51:02,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 10:51:02,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:51:02,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 10:51:02,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 10:51:02,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-26 10:51:02,509 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-26 10:51:02,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:51:02,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-26 10:51:02,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:51:05,887 INFO L124 PetriNetUnfolderBase]: 29705/41915 cut-off events. [2023-08-26 10:51:05,888 INFO L125 PetriNetUnfolderBase]: For 42536/42766 co-relation queries the response was YES. [2023-08-26 10:51:06,025 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-26 10:51:06,145 INFO L140 encePairwiseOnDemand]: 521/531 looper letters, 253 selfloop transitions, 54 changer transitions 0/314 dead transitions. [2023-08-26 10:51:06,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 314 transitions, 2475 flow [2023-08-26 10:51:06,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 10:51:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 10:51:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1567 transitions. [2023-08-26 10:51:06,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.368879472693032 [2023-08-26 10:51:06,149 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1567 transitions. [2023-08-26 10:51:06,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1567 transitions. [2023-08-26 10:51:06,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:51:06,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1567 transitions. [2023-08-26 10:51:06,152 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-26 10:51:06,155 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-26 10:51:06,156 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-26 10:51:06,156 INFO L175 Difference]: Start difference. First operand has 99 places, 107 transitions, 571 flow. Second operand 8 states and 1567 transitions. [2023-08-26 10:51:06,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 314 transitions, 2475 flow [2023-08-26 10:51:06,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 314 transitions, 2418 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 10:51:06,341 INFO L231 Difference]: Finished difference. Result has 105 places, 154 transitions, 1173 flow [2023-08-26 10:51:06,341 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-26 10:51:06,342 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 15 predicate places. [2023-08-26 10:51:06,342 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 154 transitions, 1173 flow [2023-08-26 10:51:06,343 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-26 10:51:06,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:51:06,343 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-26 10:51:06,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 10:51:06,343 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-26 10:51:06,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:51:06,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1638471860, now seen corresponding path program 2 times [2023-08-26 10:51:06,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:51:06,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547972370] [2023-08-26 10:51:06,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:51:06,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:51:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:51:06,736 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-26 10:51:06,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:51:06,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547972370] [2023-08-26 10:51:06,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547972370] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:51:06,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:51:06,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 10:51:06,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124652879] [2023-08-26 10:51:06,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:51:06,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 10:51:06,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:51:06,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 10:51:06,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 10:51:06,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-26 10:51:06,753 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-26 10:51:06,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:51:06,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-26 10:51:06,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:51:12,276 INFO L124 PetriNetUnfolderBase]: 44776/62123 cut-off events. [2023-08-26 10:51:12,276 INFO L125 PetriNetUnfolderBase]: For 83139/83449 co-relation queries the response was YES. [2023-08-26 10:51:12,588 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-26 10:51:12,783 INFO L140 encePairwiseOnDemand]: 521/531 looper letters, 302 selfloop transitions, 59 changer transitions 0/368 dead transitions. [2023-08-26 10:51:12,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 368 transitions, 3344 flow [2023-08-26 10:51:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 10:51:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 10:51:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1574 transitions. [2023-08-26 10:51:12,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3705273069679849 [2023-08-26 10:51:12,787 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1574 transitions. [2023-08-26 10:51:12,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1574 transitions. [2023-08-26 10:51:12,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:51:12,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1574 transitions. [2023-08-26 10:51:12,790 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-26 10:51:12,793 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-26 10:51:12,794 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-26 10:51:12,794 INFO L175 Difference]: Start difference. First operand has 105 places, 154 transitions, 1173 flow. Second operand 8 states and 1574 transitions. [2023-08-26 10:51:12,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 368 transitions, 3344 flow [2023-08-26 10:51:13,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 368 transitions, 3339 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 10:51:13,307 INFO L231 Difference]: Finished difference. Result has 114 places, 202 transitions, 1911 flow [2023-08-26 10:51:13,308 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-26 10:51:13,308 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 24 predicate places. [2023-08-26 10:51:13,308 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 202 transitions, 1911 flow [2023-08-26 10:51:13,309 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-26 10:51:13,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:51:13,309 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-26 10:51:13,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 10:51:13,309 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-26 10:51:13,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:51:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1526112448, now seen corresponding path program 1 times [2023-08-26 10:51:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:51:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129959284] [2023-08-26 10:51:13,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:51:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:51:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:51:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:51:13,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:51:13,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129959284] [2023-08-26 10:51:13,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129959284] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:51:13,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:51:13,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:51:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350546420] [2023-08-26 10:51:13,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:51:13,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:51:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:51:13,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:51:13,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:51:13,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 531 [2023-08-26 10:51:13,490 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-26 10:51:13,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:51:13,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 531 [2023-08-26 10:51:13,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:51:18,924 INFO L124 PetriNetUnfolderBase]: 38688/53524 cut-off events. [2023-08-26 10:51:18,925 INFO L125 PetriNetUnfolderBase]: For 128677/132586 co-relation queries the response was YES. [2023-08-26 10:51:19,244 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-26 10:51:19,422 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 230 selfloop transitions, 17 changer transitions 0/263 dead transitions. [2023-08-26 10:51:19,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 263 transitions, 2793 flow [2023-08-26 10:51:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:51:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:51:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1333 transitions. [2023-08-26 10:51:19,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41839296924042685 [2023-08-26 10:51:19,425 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1333 transitions. [2023-08-26 10:51:19,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1333 transitions. [2023-08-26 10:51:19,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:51:19,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1333 transitions. [2023-08-26 10:51:19,427 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-26 10:51:19,429 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-26 10:51:19,430 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-26 10:51:19,430 INFO L175 Difference]: Start difference. First operand has 114 places, 202 transitions, 1911 flow. Second operand 6 states and 1333 transitions. [2023-08-26 10:51:19,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 263 transitions, 2793 flow [2023-08-26 10:51:20,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 263 transitions, 2718 flow, removed 35 selfloop flow, removed 2 redundant places. [2023-08-26 10:51:20,033 INFO L231 Difference]: Finished difference. Result has 122 places, 218 transitions, 2084 flow [2023-08-26 10:51:20,033 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-26 10:51:20,034 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 32 predicate places. [2023-08-26 10:51:20,034 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 218 transitions, 2084 flow [2023-08-26 10:51:20,034 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-26 10:51:20,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:51:20,034 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-26 10:51:20,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 10:51:20,034 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-26 10:51:20,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:51:20,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1131525155, now seen corresponding path program 1 times [2023-08-26 10:51:20,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:51:20,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659224411] [2023-08-26 10:51:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:51:20,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:51:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:51:20,252 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-26 10:51:20,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:51:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659224411] [2023-08-26 10:51:20,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659224411] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:51:20,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229422231] [2023-08-26 10:51:20,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:51:20,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:51:20,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:51:20,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:51:20,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 10:51:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:51:20,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-26 10:51:20,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:51:20,497 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-26 10:51:20,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:51:20,551 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-26 10:51:20,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229422231] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:51:20,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:51:20,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-26 10:51:20,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073123186] [2023-08-26 10:51:20,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:51:20,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-26 10:51:20,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:51:20,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-26 10:51:20,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-08-26 10:51:20,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 531 [2023-08-26 10:51:20,555 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-26 10:51:20,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:51:20,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 531 [2023-08-26 10:51:20,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:51:24,315 INFO L124 PetriNetUnfolderBase]: 21124/38109 cut-off events. [2023-08-26 10:51:24,316 INFO L125 PetriNetUnfolderBase]: For 162007/172909 co-relation queries the response was YES. [2023-08-26 10:51:24,677 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-26 10:51:24,805 INFO L140 encePairwiseOnDemand]: 522/531 looper letters, 337 selfloop transitions, 32 changer transitions 0/413 dead transitions. [2023-08-26 10:51:24,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 413 transitions, 4686 flow [2023-08-26 10:51:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 10:51:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 10:51:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2075 transitions. [2023-08-26 10:51:24,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3907721280602637 [2023-08-26 10:51:24,809 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2075 transitions. [2023-08-26 10:51:24,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2075 transitions. [2023-08-26 10:51:24,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:51:24,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2075 transitions. [2023-08-26 10:51:24,813 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-26 10:51:24,817 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-26 10:51:24,817 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-26 10:51:24,818 INFO L175 Difference]: Start difference. First operand has 122 places, 218 transitions, 2084 flow. Second operand 10 states and 2075 transitions. [2023-08-26 10:51:24,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 413 transitions, 4686 flow [2023-08-26 10:51:25,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 413 transitions, 4662 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-26 10:51:25,282 INFO L231 Difference]: Finished difference. Result has 136 places, 237 transitions, 2416 flow [2023-08-26 10:51:25,283 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-26 10:51:25,283 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 46 predicate places. [2023-08-26 10:51:25,283 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 237 transitions, 2416 flow [2023-08-26 10:51:25,284 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-26 10:51:25,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:51:25,284 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-26 10:51:25,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 10:51:25,489 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-26 10:51:25,489 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-26 10:51:25,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:51:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash -719744885, now seen corresponding path program 2 times [2023-08-26 10:51:25,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:51:25,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587303850] [2023-08-26 10:51:25,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:51:25,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:51:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:51:26,196 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-26 10:51:26,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:51:26,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587303850] [2023-08-26 10:51:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587303850] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:51:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265755869] [2023-08-26 10:51:26,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 10:51:26,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:51:26,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:51:26,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:51:26,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 10:51:26,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 10:51:26,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:51:26,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-26 10:51:26,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:51:26,580 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-26 10:51:26,580 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-26 10:51:26,621 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 10:51:26,622 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-26 10:51:26,754 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-26 10:51:26,784 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-26 10:51:26,817 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-26 10:51:26,860 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-26 10:51:26,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:51:26,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:51:26,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:51:26,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:51:26,933 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-26 10:51:26,938 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-26 10:51:30,999 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-26 10:51:30,999 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 10:51:30,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265755869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:51:30,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 10:51:30,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 22 [2023-08-26 10:51:31,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511301937] [2023-08-26 10:51:31,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:51:31,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 10:51:31,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:51:31,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 10:51:31,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=427, Unknown=1, NotChecked=0, Total=552 [2023-08-26 10:51:31,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-26 10:51:31,003 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-26 10:51:31,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:51:31,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-26 10:51:31,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:51:36,732 WARN L539 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-26 10:51:39,067 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-26 10:51:45,671 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 [0] [2023-08-26 10:51:47,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 [0] [2023-08-26 10:51:49,686 WARN L539 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-26 10:51:51,695 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-26 10:51:55,063 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 [0] [2023-08-26 10:52:02,882 WARN L539 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-26 10:52:09,824 INFO L124 PetriNetUnfolderBase]: 81894/118899 cut-off events. [2023-08-26 10:52:09,824 INFO L125 PetriNetUnfolderBase]: For 396476/396710 co-relation queries the response was YES. [2023-08-26 10:52:10,680 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-26 10:52:11,057 INFO L140 encePairwiseOnDemand]: 517/531 looper letters, 481 selfloop transitions, 67 changer transitions 0/555 dead transitions. [2023-08-26 10:52:11,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 555 transitions, 5898 flow [2023-08-26 10:52:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 10:52:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 10:52:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2534 transitions. [2023-08-26 10:52:11,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3670867738664349 [2023-08-26 10:52:11,062 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2534 transitions. [2023-08-26 10:52:11,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2534 transitions. [2023-08-26 10:52:11,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:52:11,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2534 transitions. [2023-08-26 10:52:11,065 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-26 10:52:11,070 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-26 10:52:11,070 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-26 10:52:11,070 INFO L175 Difference]: Start difference. First operand has 136 places, 237 transitions, 2416 flow. Second operand 13 states and 2534 transitions. [2023-08-26 10:52:11,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 555 transitions, 5898 flow [2023-08-26 10:52:15,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 555 transitions, 5834 flow, removed 29 selfloop flow, removed 1 redundant places. [2023-08-26 10:52:15,978 INFO L231 Difference]: Finished difference. Result has 155 places, 272 transitions, 2997 flow [2023-08-26 10:52:15,978 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-26 10:52:15,979 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 65 predicate places. [2023-08-26 10:52:15,979 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 272 transitions, 2997 flow [2023-08-26 10:52:15,979 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-26 10:52:15,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:52:15,979 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-26 10:52:16,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-26 10:52:16,183 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-26 10:52:16,186 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-26 10:52:16,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:52:16,186 INFO L85 PathProgramCache]: Analyzing trace with hash -236810947, now seen corresponding path program 3 times [2023-08-26 10:52:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:52:16,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505363371] [2023-08-26 10:52:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:52:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:52:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:52:16,812 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-26 10:52:16,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:52:16,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505363371] [2023-08-26 10:52:16,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505363371] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:52:16,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351566989] [2023-08-26 10:52:16,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 10:52:16,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:52:16,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:52:16,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:52:16,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 10:52:16,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 10:52:16,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:52:16,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-26 10:52:16,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:52:17,013 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-26 10:52:17,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-26 10:52:17,047 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 10:52:17,048 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-26 10:52:17,155 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-26 10:52:17,187 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-26 10:52:17,218 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-26 10:52:17,255 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-26 10:52:17,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:52:17,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:52:17,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:52:17,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:52:17,367 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-26 10:52:17,373 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-26 10:52:23,429 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-26 10:52:23,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 10:52:23,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351566989] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:52:23,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 10:52:23,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 22 [2023-08-26 10:52:23,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876175557] [2023-08-26 10:52:23,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:52:23,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 10:52:23,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:52:23,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 10:52:23,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=439, Unknown=2, NotChecked=0, Total=552 [2023-08-26 10:52:23,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-26 10:52:23,433 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-26 10:52:23,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:52:23,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-26 10:52:23,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:52:28,305 WARN L539 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-26 10:52:30,517 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-26 10:52:32,688 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 [0] [2023-08-26 10:52:34,698 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-26 10:52:36,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 [0] [2023-08-26 10:52:38,712 WARN L539 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-26 10:52:40,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 10:52:45,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 [0] [2023-08-26 10:52:47,685 WARN L539 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-26 10:52:50,031 WARN L539 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-26 10:52:52,047 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-26 10:52:54,051 WARN L539 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-26 10:52:56,054 WARN L539 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-26 10:52: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-26 10:53:07,281 WARN L539 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-26 10:53:21,032 INFO L124 PetriNetUnfolderBase]: 84960/119323 cut-off events. [2023-08-26 10:53:21,032 INFO L125 PetriNetUnfolderBase]: For 535445/536579 co-relation queries the response was YES. [2023-08-26 10:53:22,290 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-26 10:53:22,694 INFO L140 encePairwiseOnDemand]: 517/531 looper letters, 457 selfloop transitions, 131 changer transitions 0/595 dead transitions. [2023-08-26 10:53:22,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 595 transitions, 6917 flow [2023-08-26 10:53:22,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 10:53:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 10:53:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2516 transitions. [2023-08-26 10:53:22,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3644792119368391 [2023-08-26 10:53:22,699 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2516 transitions. [2023-08-26 10:53:22,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2516 transitions. [2023-08-26 10:53:22,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:53:22,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2516 transitions. [2023-08-26 10:53:22,702 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-26 10:53:22,707 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-26 10:53:22,707 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-26 10:53:22,707 INFO L175 Difference]: Start difference. First operand has 155 places, 272 transitions, 2997 flow. Second operand 13 states and 2516 transitions. [2023-08-26 10:53:22,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 595 transitions, 6917 flow [2023-08-26 10:53:29,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 595 transitions, 6639 flow, removed 111 selfloop flow, removed 3 redundant places. [2023-08-26 10:53:29,815 INFO L231 Difference]: Finished difference. Result has 172 places, 346 transitions, 4206 flow [2023-08-26 10:53:29,815 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-26 10:53:29,815 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 82 predicate places. [2023-08-26 10:53:29,816 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 346 transitions, 4206 flow [2023-08-26 10:53:29,816 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-26 10:53:29,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:53:29,816 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-26 10:53:29,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-26 10:53:30,021 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-26 10:53:30,021 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-26 10:53:30,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:53:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1421222234, now seen corresponding path program 1 times [2023-08-26 10:53:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:53:30,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898106160] [2023-08-26 10:53:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:53:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:53:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:53:30,092 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-26 10:53:30,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:53:30,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898106160] [2023-08-26 10:53:30,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898106160] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:53:30,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294588136] [2023-08-26 10:53:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:53:30,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:53:30,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:53:30,093 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:53:30,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 10:53:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:53:30,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 10:53:30,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:53:30,248 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-26 10:53:30,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:53:30,271 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-26 10:53:30,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294588136] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-26 10:53:30,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-26 10:53:30,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-26 10:53:30,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564632177] [2023-08-26 10:53:30,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:53:30,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 10:53:30,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:53:30,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 10:53:30,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-26 10:53:30,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 531 [2023-08-26 10:53:30,274 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-26 10:53:30,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:53:30,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 531 [2023-08-26 10:53:30,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:53:38,141 INFO L124 PetriNetUnfolderBase]: 40938/62420 cut-off events. [2023-08-26 10:53:38,141 INFO L125 PetriNetUnfolderBase]: For 398632/411033 co-relation queries the response was YES. [2023-08-26 10:53:38,733 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-26 10:53:38,964 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 288 selfloop transitions, 42 changer transitions 8/375 dead transitions. [2023-08-26 10:53:38,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 375 transitions, 5024 flow [2023-08-26 10:53:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 10:53:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 10:53:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1027 transitions. [2023-08-26 10:53:38,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38681732580037664 [2023-08-26 10:53:38,967 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1027 transitions. [2023-08-26 10:53:38,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1027 transitions. [2023-08-26 10:53:38,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:53:38,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1027 transitions. [2023-08-26 10:53:38,968 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-26 10:53:38,970 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-26 10:53:38,970 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-26 10:53:38,970 INFO L175 Difference]: Start difference. First operand has 172 places, 346 transitions, 4206 flow. Second operand 5 states and 1027 transitions. [2023-08-26 10:53:38,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 375 transitions, 5024 flow [2023-08-26 10:53:43,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 375 transitions, 4913 flow, removed 51 selfloop flow, removed 2 redundant places. [2023-08-26 10:53:43,473 INFO L231 Difference]: Finished difference. Result has 176 places, 330 transitions, 4046 flow [2023-08-26 10:53:43,474 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-26 10:53:43,474 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 86 predicate places. [2023-08-26 10:53:43,474 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 330 transitions, 4046 flow [2023-08-26 10:53:43,474 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-26 10:53:43,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:53:43,474 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-26 10:53:43,481 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-26 10:53:43,679 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-26 10:53:43,679 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-26 10:53:43,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:53:43,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2112585811, now seen corresponding path program 1 times [2023-08-26 10:53:43,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:53:43,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895692995] [2023-08-26 10:53:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:53:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:53:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:53:44,171 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-26 10:53:44,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:53:44,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895692995] [2023-08-26 10:53:44,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895692995] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:53:44,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743308303] [2023-08-26 10:53:44,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:53:44,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:53:44,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:53:44,173 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-26 10:53:44,175 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-26 10:53:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:53:44,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-26 10:53:44,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:53:44,348 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-26 10:53:44,348 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-26 10:53:44,378 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 10:53:44,378 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-26 10:53:44,494 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-26 10:53:44,545 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-26 10:53:44,581 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-26 10:53:44,622 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-26 10:53:44,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:53:44,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:53:44,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:53:44,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:53:44,703 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-26 10:53:44,709 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-26 10:53:48,821 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-26 10:53:48,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:54:05,687 INFO L322 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2023-08-26 10:54:05,688 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-26 10:54:05,698 INFO L322 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-08-26 10:54:05,698 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-26 10:54:05,704 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-26 10:54:05,741 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-26 10:54:05,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743308303] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:54:05,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:54:05,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 29 [2023-08-26 10:54:05,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826073339] [2023-08-26 10:54:05,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:54:05,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-26 10:54:05,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:05,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-26 10:54:05,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=698, Unknown=54, NotChecked=0, Total=930 [2023-08-26 10:54:05,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-26 10:54:05,747 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-26 10:54:05,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:05,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-26 10:54:05,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:14,505 WARN L539 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-26 10:54:16,512 WARN L539 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-26 10:54:23,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 10:54:25,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 10:54:28,179 WARN L539 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-26 10:54:30,223 WARN L539 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-26 10:54:32,236 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-26 10:54:34,242 WARN L539 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-26 10:54:36,255 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-26 10:54:38,272 WARN L539 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-26 10:54:40,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 [0] [2023-08-26 10:54:48,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 10:54:50,391 WARN L539 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-26 10:54:52,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 10:54:54,402 WARN L539 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-26 10:54:56,407 WARN L539 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-26 10:55:00,549 WARN L539 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-26 10:55:02,564 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-26 10:55:19,476 WARN L539 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-26 10:55:25,249 WARN L539 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-26 10:55:40,019 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-26 10:55:58,720 INFO L124 PetriNetUnfolderBase]: 119007/169700 cut-off events. [2023-08-26 10:55:58,720 INFO L125 PetriNetUnfolderBase]: For 903878/905732 co-relation queries the response was YES. [2023-08-26 10:56:00,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711572 conditions, 169700 events. 119007/169700 cut-off events. For 903878/905732 co-relation queries the response was YES. Maximal size of possible extension queue 6859. Compared 1384742 event pairs, 6106 based on Foata normal form. 1314/154142 useless extension candidates. Maximal degree in co-relation 711515. Up to 24648 conditions per place. [2023-08-26 10:56:01,413 INFO L140 encePairwiseOnDemand]: 515/531 looper letters, 967 selfloop transitions, 474 changer transitions 0/1448 dead transitions. [2023-08-26 10:56:01,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 1448 transitions, 16961 flow [2023-08-26 10:56:01,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-26 10:56:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-26 10:56:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 7011 transitions. [2023-08-26 10:56:01,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3667608286252354 [2023-08-26 10:56:01,422 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 7011 transitions. [2023-08-26 10:56:01,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 7011 transitions. [2023-08-26 10:56:01,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:56:01,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 7011 transitions. [2023-08-26 10:56:01,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 194.75) internal successors, (7011), 36 states have internal predecessors, (7011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:56:01,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 531.0) internal successors, (19647), 37 states have internal predecessors, (19647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:56:01,439 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 531.0) internal successors, (19647), 37 states have internal predecessors, (19647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:56:01,439 INFO L175 Difference]: Start difference. First operand has 176 places, 330 transitions, 4046 flow. Second operand 36 states and 7011 transitions. [2023-08-26 10:56:01,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 1448 transitions, 16961 flow [2023-08-26 10:56:19,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 1448 transitions, 16709 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-26 10:56:19,561 INFO L231 Difference]: Finished difference. Result has 231 places, 667 transitions, 10135 flow [2023-08-26 10:56:19,562 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=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=10135, PETRI_PLACES=231, PETRI_TRANSITIONS=667} [2023-08-26 10:56:19,563 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 141 predicate places. [2023-08-26 10:56:19,563 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 667 transitions, 10135 flow [2023-08-26 10:56:19,563 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-26 10:56:19,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:56:19,563 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-26 10:56:19,570 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-26 10:56:19,768 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-26 10:56:19,769 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-26 10:56:19,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:56:19,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1286806641, now seen corresponding path program 2 times [2023-08-26 10:56:19,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:56:19,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864563268] [2023-08-26 10:56:19,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:56:19,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:56:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:56:20,472 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-26 10:56:20,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:56:20,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864563268] [2023-08-26 10:56:20,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864563268] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:56:20,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081340894] [2023-08-26 10:56:20,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 10:56:20,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:56:20,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:56:20,482 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-26 10:56:20,482 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-26 10:56:20,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 10:56:20,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:56:20,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-26 10:56:20,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:56:20,708 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-26 10:56:20,708 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-26 10:56:20,742 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 10:56:20,742 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-26 10:56:20,849 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-26 10:56:20,878 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-26 10:56:20,909 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-26 10:56:20,990 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-26 10:56:21,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:56:21,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:56:21,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:56:21,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:56:21,061 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-26 10:56:21,066 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-26 10:56:25,187 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-26 10:56:25,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:56:25,421 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-26 10:56:29,724 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset 2 .cse3))) (let ((.cse0 (+ c_thread2Thread1of1ForFork0_~i~1 1)) (.cse1 (store (store (select |c_#race| c_~A~0.base) .cse5 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)))) (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 ((.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) .cse5) 0)) (< v_thread2Thread1of1ForFork0_~i~1_72 .cse0))) (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 ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_72 4))) (store (store (store (store .cse1 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 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-26 10:56:31,752 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse7 (+ c_~A~0.offset .cse5 1)) (.cse3 (+ c_~A~0.offset 2 .cse5))) (let ((.cse0 (+ c_thread2Thread1of1ForFork0_~i~1 1)) (.cse1 (store (store (store (select |c_#race| c_~A~0.base) .cse7 0) .cse3 0) (+ c_~A~0.offset .cse5 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) .cse3) 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 .cse5)) 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 ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_72 4))) (store (store (store (store .cse1 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1492) c_~A~0.base) .cse7) 0)))))))) is different from false [2023-08-26 10:56:31,805 INFO L322 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2023-08-26 10:56:31,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 81 treesize of output 117 [2023-08-26 10:56:31,812 INFO L322 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-08-26 10:56:31,812 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-26 10:56:31,817 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-26 10:56:31,828 INFO L322 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2023-08-26 10:56:31,828 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2023-08-26 10:56:31,839 INFO L322 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2023-08-26 10:56:31,839 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2023-08-26 10:56:31,873 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-26 10:56:31,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081340894] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:56:31,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:56:31,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 29 [2023-08-26 10:56:31,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272391065] [2023-08-26 10:56:31,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:56:31,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-26 10:56:31,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:56:31,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-26 10:56:31,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=622, Unknown=6, NotChecked=162, Total=930 [2023-08-26 10:56:31,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-26 10:56:31,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 667 transitions, 10135 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-26 10:56:31,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:56:31,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-26 10:56:31,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:56:46,557 WARN L539 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-26 10:56:48,567 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-26 10:56:50,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:56:52,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:56:54,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-26 10:56:56,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:56:58,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:19,082 WARN L234 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 62 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:57:21,129 WARN L539 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-26 10:57:25,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-26 10:57:27,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:29,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:31,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:33,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:35,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:37,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:39,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:41,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:43,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:53,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:55,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:57,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:57:59,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:01,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:03,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:05,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-26 10:58:07,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:09,980 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-26 10:58:12,093 WARN L539 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-26 10:58:14,099 WARN L539 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-26 10:58:16,104 WARN L539 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-26 10:58:18,110 WARN L539 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-26 10:58:20,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:22,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:24,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-26 10:58:26,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:28,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:32,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:34,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:37,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:39,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:41,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:43,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-26 10:58:45,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:47,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:49,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:51,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:53,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:55,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:57,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:58:59,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 [1] [2023-08-26 10:59:01,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:03,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:07,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:09,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:11,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-26 10:59:13,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:15,160 WARN L539 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-26 10:59:19,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:21,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:23,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:25,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:27,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:29,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:31,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:33,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:35,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:39,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-26 10:59:49,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:51,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-26 10:59:53,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:55,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:57,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:59:59,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:00:01,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:00:16,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 11:00:24,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:00:26,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:00:28,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-26 11:00:30,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:00:49,437 WARN L234 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 63 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:00:53,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 11:00:58,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:00,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:02,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:04,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:15,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:17,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:19,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:21,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:23,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:25,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:27,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:29,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:33,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:35,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:37,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:41,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:43,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:01:56,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 [0] [2023-08-26 11:01:58,533 WARN L539 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-26 11:02:06,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:02:13,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:02:36,116 INFO L124 PetriNetUnfolderBase]: 174538/245136 cut-off events. [2023-08-26 11:02:36,116 INFO L125 PetriNetUnfolderBase]: For 2119760/2125373 co-relation queries the response was YES. [2023-08-26 11:02:40,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224975 conditions, 245136 events. 174538/245136 cut-off events. For 2119760/2125373 co-relation queries the response was YES. Maximal size of possible extension queue 8846. Compared 1963570 event pairs, 10464 based on Foata normal form. 4626/225333 useless extension candidates. Maximal degree in co-relation 1224896. Up to 44873 conditions per place. [2023-08-26 11:02:41,803 INFO L140 encePairwiseOnDemand]: 500/531 looper letters, 844 selfloop transitions, 1259 changer transitions 0/2110 dead transitions. [2023-08-26 11:02:41,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 2110 transitions, 30523 flow [2023-08-26 11:02:41,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-26 11:02:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-26 11:02:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 8378 transitions. [2023-08-26 11:02:41,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3669250645994832 [2023-08-26 11:02:41,817 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 8378 transitions. [2023-08-26 11:02:41,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 8378 transitions. [2023-08-26 11:02:41,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:02:41,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 8378 transitions. [2023-08-26 11:02:41,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 194.8372093023256) internal successors, (8378), 43 states have internal predecessors, (8378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:02:41,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 531.0) internal successors, (23364), 44 states have internal predecessors, (23364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:02:41,835 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 531.0) internal successors, (23364), 44 states have internal predecessors, (23364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:02:41,835 INFO L175 Difference]: Start difference. First operand has 231 places, 667 transitions, 10135 flow. Second operand 43 states and 8378 transitions. [2023-08-26 11:02:41,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 2110 transitions, 30523 flow [2023-08-26 11:04:15,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 2110 transitions, 29424 flow, removed 485 selfloop flow, removed 5 redundant places. [2023-08-26 11:04:15,988 INFO L231 Difference]: Finished difference. Result has 299 places, 1547 transitions, 25757 flow [2023-08-26 11:04:15,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=9508, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=419, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=25757, PETRI_PLACES=299, PETRI_TRANSITIONS=1547} [2023-08-26 11:04:15,989 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 209 predicate places. [2023-08-26 11:04:15,989 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 1547 transitions, 25757 flow [2023-08-26 11:04:15,990 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-26 11:04:15,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:04:15,990 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-26 11:04:15,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-26 11:04:16,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 11:04:16,194 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-26 11:04:16,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:04:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1418908967, now seen corresponding path program 3 times [2023-08-26 11:04:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:04:16,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048461431] [2023-08-26 11:04:16,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:04:16,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:04:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:04:16,738 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-26 11:04:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:04:16,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048461431] [2023-08-26 11:04:16,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048461431] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:04:16,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067535681] [2023-08-26 11:04:16,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 11:04:16,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:04:16,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:04:16,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 11:04:16,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 11:04:17,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-26 11:04:17,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:04:17,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-26 11:04:17,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:04:17,206 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-26 11:04:17,207 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-26 11:04:17,271 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 11:04:17,271 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-26 11:04:17,409 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-26 11:04:17,432 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-26 11:04:17,494 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-26 11:04:17,594 INFO L322 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2023-08-26 11:04:17,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 19 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 83 [2023-08-26 11:04:17,599 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 63 treesize of output 55 [2023-08-26 11:04:21,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:04:21,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:04:21,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:04:21,835 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:04:21,835 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 64 treesize of output 78 [2023-08-26 11:04:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 11:04:23,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:04:24,760 INFO L322 Elim1Store]: treesize reduction 60, result has 61.3 percent of original size [2023-08-26 11:04:24,760 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 7 case distinctions, treesize of input 73 treesize of output 109 [2023-08-26 11:04:24,767 INFO L322 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-08-26 11:04:24,767 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 111 treesize of output 51 [2023-08-26 11:04:24,772 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-26 11:04:24,802 INFO L322 Elim1Store]: treesize reduction 99, result has 36.1 percent of original size [2023-08-26 11:04:24,802 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 1 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 71 [2023-08-26 11:04:24,806 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:04:24,808 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:04:24,809 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 16 [2023-08-26 11:04:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 11:04:25,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067535681] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:04:25,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:04:25,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 36 [2023-08-26 11:04:25,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632515225] [2023-08-26 11:04:25,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:04:25,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-26 11:04:25,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:04:25,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-26 11:04:25,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1226, Unknown=3, NotChecked=0, Total=1406 [2023-08-26 11:04:25,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 531 [2023-08-26 11:04:25,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 1547 transitions, 25757 flow. Second operand has 38 states, 38 states have (on average 153.81578947368422) internal successors, (5845), 38 states have internal predecessors, (5845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:04:25,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:04:25,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 531 [2023-08-26 11:04:25,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:04:36,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 [0] [2023-08-26 11:04:38,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 [0] Received shutdown request... [2023-08-26 11:04:43,735 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 11:04:43,748 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 11:04:44,566 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-26 11:04:44,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 11:04:44,937 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-26 11:04:44,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-26 11:04:44,988 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2023-08-26 11:04:44,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 11:04:44,988 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 11:04:44,989 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2023-08-26 11:04:44,989 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2023-08-26 11:04:44,989 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2023-08-26 11:04:44,989 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2023-08-26 11:04:44,989 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2023-08-26 11:04:44,990 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2023-08-26 11:04:44,991 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2023-08-26 11:04:44,991 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2023-08-26 11:04:44,991 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2023-08-26 11:04:44,991 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2023-08-26 11:04:44,991 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2023-08-26 11:04:44,991 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2023-08-26 11:04:44,991 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2023-08-26 11:04:44,991 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2023-08-26 11:04:44,991 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2023-08-26 11:04:44,991 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2023-08-26 11:04:44,991 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2023-08-26 11:04:44,991 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONASSERT (19 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2023-08-26 11:04:44,992 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2023-08-26 11:04:44,993 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2023-08-26 11:04:44,993 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2023-08-26 11:04:44,993 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2023-08-26 11:04:44,993 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2023-08-26 11:04:44,993 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2023-08-26 11:04:44,993 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2023-08-26 11:04:44,993 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2023-08-26 11:04:44,993 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:04:44,998 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 11:04:44,998 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 11:04:45,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 11:04:45 BasicIcfg [2023-08-26 11:04:45,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 11:04:45,000 INFO L158 Benchmark]: Toolchain (without parser) took 837444.79ms. Allocated memory was 423.6MB in the beginning and 15.3GB in the end (delta: 14.9GB). Free memory was 382.9MB in the beginning and 6.2GB in the end (delta: -5.8GB). Peak memory consumption was 9.1GB. Max. memory is 16.0GB. [2023-08-26 11:04:45,000 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 423.6MB. Free memory is still 400.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 11:04:45,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.50ms. Allocated memory is still 423.6MB. Free memory was 382.9MB in the beginning and 370.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 11:04:45,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.60ms. Allocated memory is still 423.6MB. Free memory was 370.4MB in the beginning and 368.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:04:45,001 INFO L158 Benchmark]: Boogie Preprocessor took 42.70ms. Allocated memory is still 423.6MB. Free memory was 368.3MB in the beginning and 365.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:04:45,001 INFO L158 Benchmark]: RCFGBuilder took 664.59ms. Allocated memory is still 423.6MB. Free memory was 365.8MB in the beginning and 372.6MB in the end (delta: -6.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.0GB. [2023-08-26 11:04:45,001 INFO L158 Benchmark]: TraceAbstraction took 836544.56ms. Allocated memory was 423.6MB in the beginning and 15.3GB in the end (delta: 14.9GB). Free memory was 371.8MB in the beginning and 6.2GB in the end (delta: -5.8GB). Peak memory consumption was 9.0GB. Max. memory is 16.0GB. [2023-08-26 11:04:45,001 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 423.6MB. Free memory is still 400.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 157.50ms. Allocated memory is still 423.6MB. Free memory was 382.9MB in the beginning and 370.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 28.60ms. Allocated memory is still 423.6MB. Free memory was 370.4MB in the beginning and 368.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.70ms. Allocated memory is still 423.6MB. Free memory was 368.3MB in the beginning and 365.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 664.59ms. Allocated memory is still 423.6MB. Free memory was 365.8MB in the beginning and 372.6MB in the end (delta: -6.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.0GB. * TraceAbstraction took 836544.56ms. Allocated memory was 423.6MB in the beginning and 15.3GB in the end (delta: 14.9GB). Free memory was 371.8MB in the beginning and 6.2GB in the end (delta: -5.8GB). Peak memory consumption was 9.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 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: 836.4s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 770.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 696 mSolverCounterUnknown, 3348 SdHoareTripleChecker+Valid, 326.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3348 mSDsluCounter, 974 SdHoareTripleChecker+Invalid, 324.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2246 IncrementalHoareTripleChecker+Unchecked, 666 mSDsCounter, 789 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9967 IncrementalHoareTripleChecker+Invalid, 13699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 789 mSolverCounterUnsat, 308 mSDtfsCounter, 9967 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 652 GetRequests, 270 SyntacticMatches, 28 SemanticMatches, 354 ConstructedPredicates, 3 IntricatePredicates, 9 DeprecatedPredicates, 4949 ImplicationChecksByTransitivity, 231.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25757occurred in iteration=17, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 56.9s InterpolantComputationTime, 593 NumberOfCodeBlocks, 593 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 716 ConstructedInterpolants, 37 QuantifiedInterpolants, 12765 SizeOfPredicates, 65 NumberOfNonLiveVariables, 2467 ConjunctsInSsa, 324 ConjunctsInUnsatCore, 30 InterpolantComputations, 14 PerfectInterpolantSequences, 114/191 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