/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/pthread-ext/37_stack_lock_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 22:17:12,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 22:17:12,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 22:17:12,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 22:17:12,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 22:17:12,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 22:17:12,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 22:17:12,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 22:17:12,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 22:17:12,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 22:17:12,705 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 22:17:12,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 22:17:12,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 22:17:12,707 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 22:17:12,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 22:17:12,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 22:17:12,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 22:17:12,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 22:17:12,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 22:17:12,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 22:17:12,708 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 22:17:12,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 22:17:12,709 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 22:17:12,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 22:17:12,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 22:17:12,710 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 22:17:12,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 22:17:12,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 22:17:12,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 22:17:12,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 22:17:12,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 22:17:12,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 22:17:12,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 22:17:12,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 22:17:12,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 22:17:12,713 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-25 22:17:13,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 22:17:13,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 22:17:13,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 22:17:13,058 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 22:17:13,059 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 22:17:13,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-08-25 22:17:14,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 22:17:14,453 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 22:17:14,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-08-25 22:17:14,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ca38d08/82290ddb37694e339d668fcbbe390ea9/FLAGa4de09bcf [2023-08-25 22:17:14,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ca38d08/82290ddb37694e339d668fcbbe390ea9 [2023-08-25 22:17:14,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 22:17:14,491 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 22:17:14,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 22:17:14,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 22:17:14,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 22:17:14,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:14,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58e9ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14, skipping insertion in model container [2023-08-25 22:17:14,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:14,544 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 22:17:14,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 22:17:14,896 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 22:17:14,928 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [253] [2023-08-25 22:17:14,930 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [253] [2023-08-25 22:17:14,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 22:17:14,992 INFO L206 MainTranslator]: Completed translation [2023-08-25 22:17:14,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14 WrapperNode [2023-08-25 22:17:14,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 22:17:14,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 22:17:14,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 22:17:14,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 22:17:14,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:15,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:15,051 INFO L138 Inliner]: procedures = 171, calls = 27, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 158 [2023-08-25 22:17:15,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 22:17:15,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 22:17:15,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 22:17:15,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 22:17:15,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:15,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:15,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:15,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:15,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:15,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:15,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:15,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:15,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 22:17:15,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 22:17:15,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 22:17:15,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 22:17:15,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14" (1/1) ... [2023-08-25 22:17:15,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 22:17:15,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:17:15,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 22:17:15,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 22:17:15,151 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-25 22:17:15,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-25 22:17:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 22:17:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 22:17:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 22:17:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 22:17:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 22:17:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 22:17:15,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 22:17:15,154 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 22:17:15,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 22:17:15,273 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 22:17:15,274 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 22:17:15,570 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 22:17:15,703 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 22:17:15,703 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-25 22:17:15,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 10:17:15 BoogieIcfgContainer [2023-08-25 22:17:15,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 22:17:15,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 22:17:15,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 22:17:15,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 22:17:15,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 10:17:14" (1/3) ... [2023-08-25 22:17:15,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646b652f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 10:17:15, skipping insertion in model container [2023-08-25 22:17:15,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:14" (2/3) ... [2023-08-25 22:17:15,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646b652f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 10:17:15, skipping insertion in model container [2023-08-25 22:17:15,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 10:17:15" (3/3) ... [2023-08-25 22:17:15,714 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2023-08-25 22:17:15,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 22:17:15,729 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2023-08-25 22:17:15,729 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 22:17:15,803 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 22:17:15,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 131 transitions, 267 flow [2023-08-25 22:17:15,913 INFO L124 PetriNetUnfolderBase]: 8/141 cut-off events. [2023-08-25 22:17:15,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:15,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 141 events. 8/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 115. Up to 4 conditions per place. [2023-08-25 22:17:15,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 131 transitions, 267 flow [2023-08-25 22:17:15,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 131 transitions, 267 flow [2023-08-25 22:17:15,931 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 22:17:15,948 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 131 transitions, 267 flow [2023-08-25 22:17:15,952 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 131 transitions, 267 flow [2023-08-25 22:17:15,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 131 transitions, 267 flow [2023-08-25 22:17:15,985 INFO L124 PetriNetUnfolderBase]: 8/141 cut-off events. [2023-08-25 22:17:15,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:15,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 141 events. 8/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 115. Up to 4 conditions per place. [2023-08-25 22:17:15,988 INFO L119 LiptonReduction]: Number of co-enabled transitions 2678 [2023-08-25 22:17:18,945 INFO L134 LiptonReduction]: Checked pairs total: 4798 [2023-08-25 22:17:18,945 INFO L136 LiptonReduction]: Total number of compositions: 182 [2023-08-25 22:17:18,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 22:17:18,972 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;@55655ae8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 22:17:18,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2023-08-25 22:17:18,976 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 22:17:18,977 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-25 22:17:18,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:18,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:18,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-25 22:17:18,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err18ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-08-25 22:17:18,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:18,982 INFO L85 PathProgramCache]: Analyzing trace with hash 693930553, now seen corresponding path program 1 times [2023-08-25 22:17:18,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:18,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531116569] [2023-08-25 22:17:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:18,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:19,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:19,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531116569] [2023-08-25 22:17:19,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531116569] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:19,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:19,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 22:17:19,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521349155] [2023-08-25 22:17:19,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:19,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 22:17:19,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:19,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 22:17:19,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 22:17:19,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 313 [2023-08-25 22:17:19,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 81 flow. Second operand has 2 states, 2 states have (on average 111.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:19,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:19,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 313 [2023-08-25 22:17:19,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:19,279 INFO L124 PetriNetUnfolderBase]: 20/56 cut-off events. [2023-08-25 22:17:19,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:19,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 56 events. 20/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 17 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 98. Up to 52 conditions per place. [2023-08-25 22:17:19,283 INFO L140 encePairwiseOnDemand]: 291/313 looper letters, 13 selfloop transitions, 0 changer transitions 0/16 dead transitions. [2023-08-25 22:17:19,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 16 transitions, 63 flow [2023-08-25 22:17:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 22:17:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 22:17:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions. [2023-08-25 22:17:19,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40415335463258784 [2023-08-25 22:17:19,323 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions. [2023-08-25 22:17:19,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions. [2023-08-25 22:17:19,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:19,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions. [2023-08-25 22:17:19,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:19,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:19,335 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:19,337 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 81 flow. Second operand 2 states and 253 transitions. [2023-08-25 22:17:19,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 16 transitions, 63 flow [2023-08-25 22:17:19,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 16 transitions, 63 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:17:19,340 INFO L231 Difference]: Finished difference. Result has 19 places, 16 transitions, 37 flow [2023-08-25 22:17:19,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=37, PETRI_PLACES=19, PETRI_TRANSITIONS=16} [2023-08-25 22:17:19,344 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -20 predicate places. [2023-08-25 22:17:19,345 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 16 transitions, 37 flow [2023-08-25 22:17:19,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:19,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:19,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:19,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 22:17:19,346 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err19ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err18ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-08-25 22:17:19,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2042702465, now seen corresponding path program 1 times [2023-08-25 22:17:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:19,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228028384] [2023-08-25 22:17:19,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:19,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:19,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:19,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228028384] [2023-08-25 22:17:19,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228028384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:19,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:19,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 22:17:19,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343557417] [2023-08-25 22:17:19,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:19,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 22:17:19,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:19,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 22:17:19,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 22:17:19,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 313 [2023-08-25 22:17:19,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 16 transitions, 37 flow. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:19,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:19,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 313 [2023-08-25 22:17:19,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:19,665 INFO L124 PetriNetUnfolderBase]: 33/109 cut-off events. [2023-08-25 22:17:19,665 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:19,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 109 events. 33/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 260 event pairs, 4 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 219. Up to 27 conditions per place. [2023-08-25 22:17:19,666 INFO L140 encePairwiseOnDemand]: 306/313 looper letters, 22 selfloop transitions, 11 changer transitions 6/41 dead transitions. [2023-08-25 22:17:19,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 165 flow [2023-08-25 22:17:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 22:17:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 22:17:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2023-08-25 22:17:19,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24345047923322682 [2023-08-25 22:17:19,669 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 381 transitions. [2023-08-25 22:17:19,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 381 transitions. [2023-08-25 22:17:19,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:19,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 381 transitions. [2023-08-25 22:17:19,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:19,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 313.0) internal successors, (1878), 6 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:19,674 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 313.0) internal successors, (1878), 6 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:19,674 INFO L175 Difference]: Start difference. First operand has 19 places, 16 transitions, 37 flow. Second operand 5 states and 381 transitions. [2023-08-25 22:17:19,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 165 flow [2023-08-25 22:17:19,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 41 transitions, 165 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:17:19,676 INFO L231 Difference]: Finished difference. Result has 26 places, 23 transitions, 100 flow [2023-08-25 22:17:19,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=26, PETRI_TRANSITIONS=23} [2023-08-25 22:17:19,677 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -13 predicate places. [2023-08-25 22:17:19,677 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 100 flow [2023-08-25 22:17:19,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:19,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:19,678 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:19,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 22:17:19,678 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err19ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err18ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-08-25 22:17:19,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1830816863, now seen corresponding path program 1 times [2023-08-25 22:17:19,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:19,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381599157] [2023-08-25 22:17:19,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:19,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:20,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:20,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381599157] [2023-08-25 22:17:20,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381599157] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 22:17:20,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484799594] [2023-08-25 22:17:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:20,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:17:20,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:17:20,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 22:17:20,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 22:17:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:20,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-25 22:17:20,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 22:17:20,194 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 22:17:20,226 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 22:17:20,227 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 22:17:20,259 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 22:17:20,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2023-08-25 22:17:20,296 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 14 treesize of output 16 [2023-08-25 22:17:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:20,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 22:17:20,345 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_134) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-08-25 22:17:20,447 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:20,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 194 [2023-08-25 22:17:20,473 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:20,473 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 1 case distinctions, treesize of input 169 treesize of output 170 [2023-08-25 22:17:20,500 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:20,501 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-25 22:17:20,530 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 22:17:20,531 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 22:17:20,532 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 22:17:20,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:20,554 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 22:17:20,554 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 22:17:20,555 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 22:17:20,556 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:20,597 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 18 treesize of output 6 [2023-08-25 22:17:20,603 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 6 treesize of output 4 [2023-08-25 22:17:20,615 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:20,616 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-08-25 22:17:20,621 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 29 [2023-08-25 22:17:20,624 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 20 treesize of output 18 [2023-08-25 22:17:20,632 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-25 22:17:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-25 22:17:20,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484799594] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 22:17:20,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 22:17:20,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-08-25 22:17:20,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234893996] [2023-08-25 22:17:20,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 22:17:20,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-25 22:17:20,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:20,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-25 22:17:20,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2023-08-25 22:17:20,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 313 [2023-08-25 22:17:20,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 100 flow. Second operand has 14 states, 14 states have (on average 62.357142857142854) internal successors, (873), 14 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:20,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:20,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 313 [2023-08-25 22:17:20,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:21,235 INFO L124 PetriNetUnfolderBase]: 43/174 cut-off events. [2023-08-25 22:17:21,235 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-08-25 22:17:21,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 174 events. 43/174 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 469 event pairs, 4 based on Foata normal form. 2/176 useless extension candidates. Maximal degree in co-relation 491. Up to 34 conditions per place. [2023-08-25 22:17:21,236 INFO L140 encePairwiseOnDemand]: 303/313 looper letters, 33 selfloop transitions, 19 changer transitions 12/66 dead transitions. [2023-08-25 22:17:21,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 66 transitions, 380 flow [2023-08-25 22:17:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-25 22:17:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-25 22:17:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 963 transitions. [2023-08-25 22:17:21,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20511182108626197 [2023-08-25 22:17:21,240 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 963 transitions. [2023-08-25 22:17:21,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 963 transitions. [2023-08-25 22:17:21,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:21,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 963 transitions. [2023-08-25 22:17:21,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 64.2) internal successors, (963), 15 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:21,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 313.0) internal successors, (5008), 16 states have internal predecessors, (5008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:21,252 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 313.0) internal successors, (5008), 16 states have internal predecessors, (5008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:21,252 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 100 flow. Second operand 15 states and 963 transitions. [2023-08-25 22:17:21,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 66 transitions, 380 flow [2023-08-25 22:17:21,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:17:21,255 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 208 flow [2023-08-25 22:17:21,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=208, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-08-25 22:17:21,256 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2023-08-25 22:17:21,256 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 208 flow [2023-08-25 22:17:21,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.357142857142854) internal successors, (873), 14 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:21,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:21,257 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-25 22:17:21,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-25 22:17:21,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:17:21,463 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err19ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err18ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-08-25 22:17:21,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:21,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1496893815, now seen corresponding path program 1 times [2023-08-25 22:17:21,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:21,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593348453] [2023-08-25 22:17:21,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:21,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:22,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:22,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593348453] [2023-08-25 22:17:22,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593348453] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 22:17:22,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375253736] [2023-08-25 22:17:22,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:22,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:17:22,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:17:22,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 22:17:22,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 22:17:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:22,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-25 22:17:22,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 22:17:22,786 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 22:17:22,817 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-25 22:17:22,817 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-25 22:17:22,843 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 6 treesize of output 5 [2023-08-25 22:17:22,887 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-25 22:17:22,910 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:17:22,911 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-25 22:17:22,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-25 22:17:23,028 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:17:23,028 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-08-25 22:17:23,122 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:23,123 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 31 treesize of output 35 [2023-08-25 22:17:23,268 INFO L322 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-08-25 22:17:23,268 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 30 [2023-08-25 22:17:23,388 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:17:23,388 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 36 [2023-08-25 22:17:23,416 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8 [2023-08-25 22:17:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:23,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 22:17:23,551 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:23,552 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 1 case distinctions, treesize of input 180 treesize of output 181 [2023-08-25 22:17:23,569 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:23,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:23,596 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_375 Int) (v_ArrVal_379 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_375)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= v_ArrVal_375 0)))) (or (forall ((v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (= (select v_ArrVal_376 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-25 22:17:23,944 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:23,945 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 1 case distinctions, treesize of input 180 treesize of output 181 [2023-08-25 22:17:23,965 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:23,966 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:23,978 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:24,039 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_374 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (= (select v_ArrVal_376 0) 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)))))) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_374 Int) (v_ArrVal_370 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_370))) (or (= (select v_ArrVal_376 0) 0) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0))))))) is different from false [2023-08-25 22:17:24,135 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| Int) (v_ArrVal_374 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313|) 0 c_~next_alloc_idx~0)))) (or (= (select v_ArrVal_376 0) 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0)))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| Int) (v_ArrVal_374 Int) (v_ArrVal_370 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| v_ArrVal_370))) (or (= (select v_ArrVal_376 0) 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-25 22:17:24,198 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_368 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| Int) (v_ArrVal_374 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313|) 0 c_~next_alloc_idx~0)))) (or (= (select v_ArrVal_376 0) 0) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_368) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)))))) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_368 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| Int) (v_ArrVal_374 Int) (v_ArrVal_370 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| v_ArrVal_370))) (or (= (select v_ArrVal_376 0) 0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_368) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0))))))) is different from false [2023-08-25 22:17:24,373 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:24,374 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 1 case distinctions, treesize of input 175 treesize of output 176 [2023-08-25 22:17:24,385 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:24,386 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 185 [2023-08-25 22:17:24,409 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:24,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:24,425 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:24,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:24,433 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:24,434 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-08-25 22:17:24,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2023-08-25 22:17:24,464 INFO L322 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2023-08-25 22:17:24,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 58 [2023-08-25 22:17:24,476 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:24,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2023-08-25 22:17:24,514 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 51 treesize of output 47 [2023-08-25 22:17:24,521 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 24 treesize of output 22 [2023-08-25 22:17:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2023-08-25 22:17:24,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375253736] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 22:17:24,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 22:17:24,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 33 [2023-08-25 22:17:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88756436] [2023-08-25 22:17:24,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 22:17:24,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-25 22:17:24,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:24,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-25 22:17:24,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=763, Unknown=9, NotChecked=244, Total=1190 [2023-08-25 22:17:24,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 313 [2023-08-25 22:17:24,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 208 flow. Second operand has 35 states, 35 states have (on average 57.17142857142857) internal successors, (2001), 35 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:24,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:24,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 313 [2023-08-25 22:17:24,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:26,653 WARN L839 $PredicateComparison]: unable to prove that (and (not (= (+ c_~next_alloc_idx~0 3) 0)) (<= c_~next_alloc_idx~0 62) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_374 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (= (select v_ArrVal_376 0) 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)))))) (not (= c_~top~0 0)) (forall ((v_ArrVal_368 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| Int) (v_ArrVal_374 Int)) (or (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_368) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| v_ArrVal_374) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| |c_ULTIMATE.start_main_~#t~0#1.base|))) (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_374 Int) (v_ArrVal_370 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_370))) (or (= (select v_ArrVal_376 0) 0) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0))))))) is different from false [2023-08-25 22:17:28,305 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| Int) (v_ArrVal_374 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313|) 0 c_~next_alloc_idx~0)))) (or (= (select v_ArrVal_376 0) 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0)))))) (or .cse0 (forall ((v_ArrVal_375 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_379 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|))) (or (not (= (+ (select .cse2 0) 1) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| (store .cse2 0 v_ArrVal_375)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (= v_ArrVal_375 0))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| Int) (v_ArrVal_374 Int) (v_ArrVal_370 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| v_ArrVal_370))) (or (= (select v_ArrVal_376 0) 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_313| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0))))) (<= c_~next_alloc_idx~0 64)) (not (= c_~top~0 0)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (= (select v_ArrVal_376 0) 0) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)))))) is different from false [2023-08-25 22:17:28,399 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse2 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse3 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (forall ((v_ArrVal_374 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (= (select v_ArrVal_376 0) 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)))))) (or (and (or .cse0 (forall ((v_ArrVal_375 Int) (v_ArrVal_379 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_375)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= v_ArrVal_375 0)))) (or (forall ((v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (= (select v_ArrVal_376 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse3)) (not (= (+ (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 0))) (or .cse3 (forall ((v_ArrVal_374 Int) (v_ArrVal_370 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_370))) (or (= (select v_ArrVal_376 0) 0) (not (= (+ (select (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (select (select (store (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)))))))) is different from false [2023-08-25 22:17:28,498 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse3 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (forall ((v_ArrVal_375 Int) (v_ArrVal_379 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_375)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= v_ArrVal_375 0)))) (or .cse0 (forall ((v_ArrVal_374 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (= (select v_ArrVal_376 0) 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0)) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)))))) (or (forall ((v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (= (select v_ArrVal_376 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse3) (or .cse3 (forall ((v_ArrVal_374 Int) (v_ArrVal_370 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| Int) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_370))) (or (= (select v_ArrVal_376 0) 0) (not (= (+ (select (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_374) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0)) (not (= (select (select (store (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311| v_ArrVal_376) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_379) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_311|) 0) 0)))))))) is different from false [2023-08-25 22:17:28,877 INFO L124 PetriNetUnfolderBase]: 91/355 cut-off events. [2023-08-25 22:17:28,877 INFO L125 PetriNetUnfolderBase]: For 598/598 co-relation queries the response was YES. [2023-08-25 22:17:28,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 355 events. 91/355 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1151 event pairs, 3 based on Foata normal form. 2/356 useless extension candidates. Maximal degree in co-relation 1335. Up to 95 conditions per place. [2023-08-25 22:17:28,879 INFO L140 encePairwiseOnDemand]: 302/313 looper letters, 35 selfloop transitions, 45 changer transitions 89/171 dead transitions. [2023-08-25 22:17:28,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 171 transitions, 1308 flow [2023-08-25 22:17:28,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-08-25 22:17:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-08-25 22:17:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 3029 transitions. [2023-08-25 22:17:28,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18610223642172524 [2023-08-25 22:17:28,890 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 3029 transitions. [2023-08-25 22:17:28,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 3029 transitions. [2023-08-25 22:17:28,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:28,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 3029 transitions. [2023-08-25 22:17:28,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 58.25) internal successors, (3029), 52 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:28,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 313.0) internal successors, (16589), 53 states have internal predecessors, (16589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:28,918 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 313.0) internal successors, (16589), 53 states have internal predecessors, (16589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:28,919 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 208 flow. Second operand 52 states and 3029 transitions. [2023-08-25 22:17:28,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 171 transitions, 1308 flow [2023-08-25 22:17:28,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 171 transitions, 1190 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-25 22:17:28,925 INFO L231 Difference]: Finished difference. Result has 98 places, 63 transitions, 494 flow [2023-08-25 22:17:28,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=494, PETRI_PLACES=98, PETRI_TRANSITIONS=63} [2023-08-25 22:17:28,926 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2023-08-25 22:17:28,926 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 63 transitions, 494 flow [2023-08-25 22:17:28,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 57.17142857142857) internal successors, (2001), 35 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:28,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:28,927 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1] [2023-08-25 22:17:28,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 22:17:29,133 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,SelfDestructingSolverStorable3 [2023-08-25 22:17:29,134 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err19ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err18ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-08-25 22:17:29,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:29,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1118366875, now seen corresponding path program 2 times [2023-08-25 22:17:29,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:29,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977725011] [2023-08-25 22:17:29,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:30,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977725011] [2023-08-25 22:17:30,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977725011] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 22:17:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52162789] [2023-08-25 22:17:30,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 22:17:30,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:17:30,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:17:30,221 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 22:17:30,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 22:17:30,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 22:17:30,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 22:17:30,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-25 22:17:30,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 22:17:30,408 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 22:17:30,429 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-25 22:17:30,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-25 22:17:30,465 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 6 treesize of output 5 [2023-08-25 22:17:30,510 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-25 22:17:30,544 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:17:30,544 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-25 22:17:30,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 22:17:30,645 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:17:30,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-08-25 22:17:30,700 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:17:30,700 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2023-08-25 22:17:30,825 INFO L322 Elim1Store]: treesize reduction 36, result has 61.7 percent of original size [2023-08-25 22:17:30,826 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 85 [2023-08-25 22:17:31,154 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:17:31,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 29 [2023-08-25 22:17:31,246 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:31,246 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 42 treesize of output 46 [2023-08-25 22:17:31,426 INFO L322 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-08-25 22:17:31,426 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 27 [2023-08-25 22:17:31,545 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:17:31,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2023-08-25 22:17:31,580 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8 [2023-08-25 22:17:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:31,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 22:17:31,600 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-08-25 22:17:31,697 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:31,697 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 1 case distinctions, treesize of input 180 treesize of output 181 [2023-08-25 22:17:31,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:31,728 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:31,753 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_699 Int)) (or (= v_ArrVal_699 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) (< 64 c_~next_alloc_idx~0)) (or (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (or (= (select v_ArrVal_698 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_698) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-25 22:17:32,063 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:32,064 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 1 case distinctions, treesize of input 180 treesize of output 181 [2023-08-25 22:17:32,086 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:32,087 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:32,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:32,187 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_697 Int) (v_ArrVal_696 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_696)))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (< v_ArrVal_696 c_~next_alloc_idx~0) (= v_ArrVal_699 0) (not (= (+ (select .cse0 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse0 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0))))))) (or (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_695))) (let ((.cse2 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (+ (select .cse2 0) 1) 0)) (= v_ArrVal_699 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse2 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-25 22:17:32,285 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_699 Int)) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320|) 0 v_ArrVal_696)))) (let ((.cse1 (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse1 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (< v_ArrVal_696 c_~next_alloc_idx~0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (= v_ArrVal_699 0) (not (= (+ (select .cse1 0) 1) 0))))))) (or (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse2 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (+ (select .cse2 0) 1) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (= v_ArrVal_699 0) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse2 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-25 22:17:32,356 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (+ (select .cse0 0) 1) 0)) (= v_ArrVal_699 0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse0 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0))))))) (or (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_699 Int)) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320|) 0 v_ArrVal_696)))) (let ((.cse3 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse3 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (< v_ArrVal_696 c_~next_alloc_idx~0) (= v_ArrVal_699 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (+ (select .cse3 0) 1) 0)))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-25 22:17:32,559 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:32,559 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 1 case distinctions, treesize of input 180 treesize of output 181 [2023-08-25 22:17:32,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:32,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:32,652 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_689) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse1 (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (= v_ArrVal_699 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse1 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (not (= (+ (select .cse1 0) 1) 0))))))) (or (< 64 c_~next_alloc_idx~0) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_699 Int)) (let ((.cse2 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| (store (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320|) 0 v_ArrVal_696)))) (let ((.cse3 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (< v_ArrVal_696 (+ c_~next_alloc_idx~0 2)) (= v_ArrVal_699 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse3 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (not (= 0 (+ (select .cse3 0) 1)))))))) (or (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse6 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse5 (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (+ (select .cse5 0) 1) 0)) (= v_ArrVal_699 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse5 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))) (<= c_~next_alloc_idx~0 62)))))) is different from false [2023-08-25 22:17:32,795 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse1 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_689) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= 0 (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (= v_ArrVal_699 0) (not (= (+ (select .cse0 0) 1) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse0 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))) (<= c_~next_alloc_idx~0 64)) (or (and (or (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse2 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse3 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= 0 (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (= v_ArrVal_699 0) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse3 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (not (= (+ (select .cse3 0) 1) 0)))))) (<= c_~next_alloc_idx~0 62)) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int) (v_ArrVal_699 Int)) (let ((.cse5 (let ((.cse6 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322|) 0 c_~next_alloc_idx~0)))) (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| (store (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320|) 0 v_ArrVal_696))))) (let ((.cse4 (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= 0 (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (< v_ArrVal_696 (+ c_~next_alloc_idx~0 2)) (not (= (+ (select .cse4 0) 1) 0)) (= v_ArrVal_699 0) (not (= (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse4 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-25 22:17:32,938 WARN L839 $PredicateComparison]: unable to prove that (and (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_697 Int) (v_ArrVal_685 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int) (v_ArrVal_699 Int)) (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322|) 0 c_~next_alloc_idx~0)))) (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| (store (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320|) 0 v_ArrVal_696))))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (< v_ArrVal_696 (+ c_~next_alloc_idx~0 2)) (not (= (+ (select .cse0 0) 1) 0)) (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_685) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (= v_ArrVal_699 0) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse0 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0))))))) (or (<= c_~next_alloc_idx~0 62) (forall ((v_ArrVal_697 Int) (v_ArrVal_685 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse3 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse4 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_685) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (= v_ArrVal_699 0) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse4 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (not (= (+ (select .cse4 0) 1) 0)))))))) (< 64 c_~next_alloc_idx~0)) (or (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_685 Int) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse6 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_689) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse5 (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_685) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (= v_ArrVal_699 0) (not (= (+ (select .cse5 0) 1) 0)) (not (= (select (select (store (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse5 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-25 22:17:33,283 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:33,283 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 1 case distinctions, treesize of input 175 treesize of output 176 [2023-08-25 22:17:33,295 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:33,295 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 185 [2023-08-25 22:17:33,317 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:33,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:33,332 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:33,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:17:33,341 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2023-08-25 22:17:33,347 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:33,347 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-08-25 22:17:33,358 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 175 treesize of output 171 [2023-08-25 22:17:33,367 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 70 treesize of output 62 [2023-08-25 22:17:33,374 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 60 treesize of output 56 [2023-08-25 22:17:33,380 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 56 treesize of output 54 [2023-08-25 22:17:33,435 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 22:17:33,465 INFO L322 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2023-08-25 22:17:33,465 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 194 treesize of output 168 [2023-08-25 22:17:33,493 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:33,493 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 70 [2023-08-25 22:17:33,617 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:33,618 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 1 case distinctions, treesize of input 63 treesize of output 47 [2023-08-25 22:17:33,641 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:17:33,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2023-08-25 22:17:33,650 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 30 treesize of output 26 [2023-08-25 22:17:33,658 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 24 treesize of output 22 [2023-08-25 22:17:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 49 not checked. [2023-08-25 22:17:34,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52162789] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 22:17:34,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 22:17:34,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 41 [2023-08-25 22:17:34,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200215373] [2023-08-25 22:17:34,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 22:17:34,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-08-25 22:17:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:34,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-08-25 22:17:34,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1004, Unknown=14, NotChecked=584, Total=1806 [2023-08-25 22:17:34,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 313 [2023-08-25 22:17:34,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 63 transitions, 494 flow. Second operand has 43 states, 43 states have (on average 62.627906976744185) internal successors, (2693), 43 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:34,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 313 [2023-08-25 22:17:34,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:36,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:17:38,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:17:40,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:17:42,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:17:44,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:17:46,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:17:48,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:17:50,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:17:52,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:17:54,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:17:56,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:17:58,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:00,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:02,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:05,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:18:07,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:09,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:11,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:13,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:15,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:17,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:19,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:21,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:23,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:25,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:27,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:29,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:31,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:18:34,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:40,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:18:50,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:18:52,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, 1] [2023-08-25 22:18:54,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:18:56,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, 1] [2023-08-25 22:18:58,789 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (< 64 c_~next_alloc_idx~0)) (.cse3 (<= c_~next_alloc_idx~0 64)) (.cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_324| Int)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_324|) 0))))) (and (or (not (= (+ c_~next_alloc_idx~0 3) 0)) .cse0) (or (< 0 (+ c_~next_alloc_idx~0 5)) .cse0) (or (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse2 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_689) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse1 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= 0 (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (= v_ArrVal_699 0) (not (= (+ (select .cse1 0) 1) 0)) (not (= (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse1 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))) .cse3) (not (= c_~top~0 0)) (or .cse4 (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_699 Int)) (let ((.cse5 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320|) 0 v_ArrVal_696)))) (let ((.cse6 (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse6 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (< v_ArrVal_696 c_~next_alloc_idx~0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (= v_ArrVal_699 0) (not (= (+ (select .cse6 0) 1) 0))))))) (or (and (or (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse7 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse8 (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= 0 (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (= v_ArrVal_699 0) (not (= (select (select (store (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse8 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (not (= (+ (select .cse8 0) 1) 0)))))) (<= c_~next_alloc_idx~0 62)) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int) (v_ArrVal_699 Int)) (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322|) 0 c_~next_alloc_idx~0)))) (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| (store (select .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320|) 0 v_ArrVal_696))))) (let ((.cse9 (select .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= 0 (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (< v_ArrVal_696 (+ c_~next_alloc_idx~0 2)) (not (= (+ (select .cse9 0) 1) 0)) (= v_ArrVal_699 0) (not (= (select (select (store (store .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse9 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))))) .cse4) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_324| Int)) (or (forall ((v_ArrVal_697 Int) (v_ArrVal_685 Int) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int)) (or (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| |c_ULTIMATE.start_main_~#t~0#1.base|) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_324| v_ArrVal_685) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_324|) 0)))) (or (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse13 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse12 (select .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (+ (select .cse12 0) 1) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (= v_ArrVal_699 0) (not (= (select (select (store (store .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse12 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))) .cse3) (or (<= c_~next_alloc_idx~0 60) .cse0))) is different from false [2023-08-25 22:19:00,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:19:02,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:19:03,165 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~next_alloc_idx~0 64)) (.cse3 (< 64 c_~next_alloc_idx~0)) (.cse6 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_689) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse2 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (= v_ArrVal_699 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse2 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (not (= (+ (select .cse2 0) 1) 0))))))) (not (= (+ c_~next_alloc_idx~0 3) 0)) (or .cse3 (forall ((v_ArrVal_697 Int) (v_ArrVal_696 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse5 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_696)))) (let ((.cse4 (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (< v_ArrVal_696 c_~next_alloc_idx~0) (= v_ArrVal_699 0) (not (= (+ (select .cse4 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse4 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0))))))) (<= c_~next_alloc_idx~0 60) (or (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_695))) (let ((.cse7 (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (+ (select .cse7 0) 1) 0)) (= v_ArrVal_699 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse7 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))) .cse0) (forall ((v_ArrVal_697 Int) (v_ArrVal_685 Int) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int)) (or (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_685) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| |c_ULTIMATE.start_main_~#t~0#1.base|))) (or .cse3 (let ((.cse11 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_699 Int)) (let ((.cse9 (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| (store (select .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320|) 0 v_ArrVal_696)))) (let ((.cse10 (select .cse9 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (< v_ArrVal_696 (+ c_~next_alloc_idx~0 2)) (= v_ArrVal_699 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse9 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse10 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (not (= 0 (+ (select .cse10 0) 1)))))))) (or (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse13 (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse12 (select .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (+ (select .cse12 0) 1) 0)) (= v_ArrVal_699 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse12 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))) (<= c_~next_alloc_idx~0 62))))) (< 0 (+ c_~next_alloc_idx~0 5)))) is different from false [2023-08-25 22:19:05,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, 1] [2023-08-25 22:19:07,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:19:09,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:19:11,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:19:11,308 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse1 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_689) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse0 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= 0 (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (= v_ArrVal_699 0) (not (= (+ (select .cse0 0) 1) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse0 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))) (<= c_~next_alloc_idx~0 64)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse2 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (+ (select .cse2 0) 1) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse2 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (= v_ArrVal_699 0)))) (not (= c_~top~0 0)) (or (and (or (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse3 (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322|) 0 c_~next_alloc_idx~0)) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse4 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= 0 (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (= v_ArrVal_699 0) (not (= (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse4 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (not (= (+ (select .cse4 0) 1) 0)))))) (<= c_~next_alloc_idx~0 62)) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int) (v_ArrVal_699 Int)) (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322|) 0 c_~next_alloc_idx~0)))) (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| (store (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320|) 0 v_ArrVal_696))))) (let ((.cse5 (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= 0 (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (< v_ArrVal_696 (+ c_~next_alloc_idx~0 2)) (not (= (+ (select .cse5 0) 1) 0)) (= v_ArrVal_699 0) (not (= (select (select (store (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse5 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-25 22:19:11,332 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~next_alloc_idx~0 64)) (.cse3 (< 64 c_~next_alloc_idx~0)) (.cse6 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_689) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse2 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (= v_ArrVal_699 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse2 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (not (= (+ (select .cse2 0) 1) 0))))))) (not (= (+ c_~next_alloc_idx~0 3) 0)) (or .cse3 (forall ((v_ArrVal_697 Int) (v_ArrVal_696 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse5 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_696)))) (let ((.cse4 (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (< v_ArrVal_696 c_~next_alloc_idx~0) (= v_ArrVal_699 0) (not (= (+ (select .cse4 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse4 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0))))))) (<= c_~next_alloc_idx~0 60) (or (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_695))) (let ((.cse7 (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (+ (select .cse7 0) 1) 0)) (= v_ArrVal_699 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse7 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))) .cse0) (or (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_699 Int)) (or (= v_ArrVal_699 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse3) (or (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (or (= (select v_ArrVal_698 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_698) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (forall ((v_ArrVal_697 Int) (v_ArrVal_685 Int) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| Int)) (or (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_685) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_322| |c_ULTIMATE.start_main_~#t~0#1.base|))) (or .cse3 (let ((.cse11 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_699 Int)) (let ((.cse9 (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| (store (select .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320|) 0 v_ArrVal_696)))) (let ((.cse10 (select .cse9 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (< v_ArrVal_696 (+ c_~next_alloc_idx~0 2)) (= v_ArrVal_699 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse9 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse10 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)) (not (= 0 (+ (select .cse10 0) 1)))))))) (or (forall ((v_ArrVal_697 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_691 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_699 Int)) (let ((.cse13 (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_695))) (let ((.cse12 (select .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|))) (or (not (= (+ (select .cse12 0) 1) 0)) (= v_ArrVal_699 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_691) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_320| v_ArrVal_697) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0)) (not (= (select (select (store (store .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318| (store .cse12 0 v_ArrVal_699)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_702) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_318|) 0) 0)))))) (<= c_~next_alloc_idx~0 62))))) (< 0 (+ c_~next_alloc_idx~0 5)))) is different from false [2023-08-25 22:19:14,820 INFO L124 PetriNetUnfolderBase]: 25/178 cut-off events. [2023-08-25 22:19:14,821 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2023-08-25 22:19:14,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 178 events. 25/178 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 456 event pairs, 3 based on Foata normal form. 2/180 useless extension candidates. Maximal degree in co-relation 788. Up to 57 conditions per place. [2023-08-25 22:19:14,822 INFO L140 encePairwiseOnDemand]: 302/313 looper letters, 37 selfloop transitions, 42 changer transitions 49/130 dead transitions. [2023-08-25 22:19:14,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 130 transitions, 1209 flow [2023-08-25 22:19:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-25 22:19:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-25 22:19:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 3368 transitions. [2023-08-25 22:19:14,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19926635901076795 [2023-08-25 22:19:14,833 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 3368 transitions. [2023-08-25 22:19:14,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 3368 transitions. [2023-08-25 22:19:14,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:19:14,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 3368 transitions. [2023-08-25 22:19:14,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 62.370370370370374) internal successors, (3368), 54 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:19:14,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 313.0) internal successors, (17215), 55 states have internal predecessors, (17215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:19:14,880 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 313.0) internal successors, (17215), 55 states have internal predecessors, (17215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:19:14,880 INFO L175 Difference]: Start difference. First operand has 98 places, 63 transitions, 494 flow. Second operand 54 states and 3368 transitions. [2023-08-25 22:19:14,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 130 transitions, 1209 flow [2023-08-25 22:19:14,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 130 transitions, 1120 flow, removed 32 selfloop flow, removed 15 redundant places. [2023-08-25 22:19:14,887 INFO L231 Difference]: Finished difference. Result has 127 places, 61 transitions, 539 flow [2023-08-25 22:19:14,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=539, PETRI_PLACES=127, PETRI_TRANSITIONS=61} [2023-08-25 22:19:14,887 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 88 predicate places. [2023-08-25 22:19:14,888 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 61 transitions, 539 flow [2023-08-25 22:19:14,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 62.627906976744185) internal successors, (2693), 43 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:19:14,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:19:14,889 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1] [2023-08-25 22:19:14,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-25 22:19:15,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:19:15,096 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err19ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err18ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-08-25 22:19:15,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:19:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash -664434121, now seen corresponding path program 3 times [2023-08-25 22:19:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:19:15,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73138750] [2023-08-25 22:19:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:19:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:19:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:19:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:19:16,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:19:16,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73138750] [2023-08-25 22:19:16,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73138750] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 22:19:16,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519634280] [2023-08-25 22:19:16,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 22:19:16,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:19:16,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:19:16,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 22:19:16,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 22:19:19,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-08-25 22:19:19,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 22:19:19,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-25 22:19:19,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 22:19:19,245 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 22:19:19,278 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-25 22:19:19,279 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-25 22:19:19,306 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 6 treesize of output 5 [2023-08-25 22:19:19,346 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-25 22:19:19,380 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:19:19,380 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-25 22:19:19,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 22:19:19,494 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:19:19,494 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-08-25 22:19:19,553 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:19:19,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2023-08-25 22:19:19,691 INFO L322 Elim1Store]: treesize reduction 36, result has 61.7 percent of original size [2023-08-25 22:19:19,691 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 85 [2023-08-25 22:19:20,236 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:19:20,237 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 29 [2023-08-25 22:19:20,314 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:19:20,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 49 [2023-08-25 22:19:20,470 INFO L322 Elim1Store]: treesize reduction 36, result has 61.7 percent of original size [2023-08-25 22:19:20,471 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 89 [2023-08-25 22:19:20,858 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:19:20,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2023-08-25 22:19:20,943 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:19:20,944 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 26 treesize of output 30 [2023-08-25 22:19:21,057 INFO L322 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-08-25 22:19:21,057 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 27 [2023-08-25 22:19:21,190 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 22:19:21,190 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2023-08-25 22:19:21,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8 [2023-08-25 22:19:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:19:21,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 22:19:21,236 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1106 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1106) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-08-25 22:19:21,345 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:19:21,345 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 1 case distinctions, treesize of input 185 treesize of output 186 [2023-08-25 22:19:21,371 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:19:21,382 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-25 22:19:21,766 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:19:21,766 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 1 case distinctions, treesize of input 185 treesize of output 186 [2023-08-25 22:19:21,789 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:19:22,325 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:19:22,326 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 1 case distinctions, treesize of input 185 treesize of output 186 [2023-08-25 22:19:22,350 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:19:22,913 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:19:22,913 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 1 case distinctions, treesize of input 180 treesize of output 181 [2023-08-25 22:19:22,940 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:19:23,613 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:19:23,614 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 191 [2023-08-25 22:19:23,630 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:19:23,630 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 1 case distinctions, treesize of input 169 treesize of output 170 [2023-08-25 22:19:23,655 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:19:23,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:19:23,675 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:19:23,676 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 294 [2023-08-25 22:19:24,452 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2991725 treesize of output 2975597 [2023-08-25 22:19:28,891 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 20470 treesize of output 18422 [2023-08-25 22:19:29,333 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 16502 treesize of output 16374 [2023-08-25 22:19:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 61 refuted. 21 times theorem prover too weak. 0 trivial. 9 not checked. [2023-08-25 22:19:40,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519634280] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 22:19:40,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 22:19:40,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 56 [2023-08-25 22:19:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389284737] [2023-08-25 22:19:40,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 22:19:40,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-08-25 22:19:40,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:19:40,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-08-25 22:19:40,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=2709, Unknown=37, NotChecked=110, Total=3306 [2023-08-25 22:19:40,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 313 [2023-08-25 22:19:40,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 61 transitions, 539 flow. Second operand has 58 states, 58 states have (on average 57.41379310344828) internal successors, (3330), 58 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:19:40,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:19:40,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 313 [2023-08-25 22:19:40,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:19:42,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:19:45,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:19:47,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:19:49,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-25 22:19:51,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:19:53,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:19:55,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:19:57,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:19:59,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:01,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:03,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:05,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:07,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:09,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:11,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:13,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:15,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:17,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:19,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:21,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:23,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:25,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-25 22:20:27,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-25 22:20:29,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:31,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 [0] [2023-08-25 22:20:33,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:35,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:37,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:39,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:41,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:44,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-25 22:20:46,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:48,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:50,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:52,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:54,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:56,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:20:58,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:21:00,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:21:02,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:21:04,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:21:07,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:21:09,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:21:11,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:21:13,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:21:15,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 22:21:21,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:21:23,593 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, 1] [2023-08-25 22:21:26,231 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, 1] [2023-08-25 22:21:28,262 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, 1] [2023-08-25 22:21:30,732 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, 1] [2023-08-25 22:21:32,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:21:35,906 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, 1] [2023-08-25 22:21:37,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:21:39,969 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, 1] [2023-08-25 22:21:42,010 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, 1] [2023-08-25 22:21:44,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:21:46,683 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, 1] [2023-08-25 22:21:49,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, 1] [2023-08-25 22:21:51,636 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, 1] [2023-08-25 22:21:53,682 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, 1] [2023-08-25 22:21:56,069 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, 1] [2023-08-25 22:21:58,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:22:00,550 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, 1] [2023-08-25 22:22:02,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:22:05,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 22:22:22,250 INFO L124 PetriNetUnfolderBase]: 7/111 cut-off events. [2023-08-25 22:22:22,250 INFO L125 PetriNetUnfolderBase]: For 415/415 co-relation queries the response was YES. [2023-08-25 22:22:22,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 111 events. 7/111 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 164 event pairs, 0 based on Foata normal form. 3/114 useless extension candidates. Maximal degree in co-relation 541. Up to 27 conditions per place. [2023-08-25 22:22:22,251 INFO L140 encePairwiseOnDemand]: 301/313 looper letters, 0 selfloop transitions, 0 changer transitions 92/92 dead transitions. [2023-08-25 22:22:22,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 92 transitions, 948 flow [2023-08-25 22:22:22,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-08-25 22:22:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-08-25 22:22:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 2395 transitions. [2023-08-25 22:22:22,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1821846949642477 [2023-08-25 22:22:22,257 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 2395 transitions. [2023-08-25 22:22:22,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 2395 transitions. [2023-08-25 22:22:22,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:22:22,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 2395 transitions. [2023-08-25 22:22:22,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 57.023809523809526) internal successors, (2395), 42 states have internal predecessors, (2395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:22,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 313.0) internal successors, (13459), 43 states have internal predecessors, (13459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:22,278 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 313.0) internal successors, (13459), 43 states have internal predecessors, (13459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:22,278 INFO L175 Difference]: Start difference. First operand has 127 places, 61 transitions, 539 flow. Second operand 42 states and 2395 transitions. [2023-08-25 22:22:22,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 92 transitions, 948 flow [2023-08-25 22:22:22,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 92 transitions, 769 flow, removed 32 selfloop flow, removed 36 redundant places. [2023-08-25 22:22:22,281 INFO L231 Difference]: Finished difference. Result has 104 places, 0 transitions, 0 flow [2023-08-25 22:22:22,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=0, PETRI_PLACES=104, PETRI_TRANSITIONS=0} [2023-08-25 22:22:22,282 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 65 predicate places. [2023-08-25 22:22:22,282 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 0 transitions, 0 flow [2023-08-25 22:22:22,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 57.41379310344828) internal successors, (3330), 58 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:22,285 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (39 of 40 remaining) [2023-08-25 22:22:22,286 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2023-08-25 22:22:22,286 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err18ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2023-08-25 22:22:22,286 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2023-08-25 22:22:22,286 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err19ASSERT_VIOLATIONASSERT (35 of 40 remaining) [2023-08-25 22:22:22,286 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2023-08-25 22:22:22,286 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err16ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2023-08-25 22:22:22,286 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2023-08-25 22:22:22,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err17ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2023-08-25 22:22:22,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2023-08-25 22:22:22,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2023-08-25 22:22:22,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2023-08-25 22:22:22,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2023-08-25 22:22:22,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2023-08-25 22:22:22,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err19ASSERT_VIOLATIONASSERT (25 of 40 remaining) [2023-08-25 22:22:22,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2023-08-25 22:22:22,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2023-08-25 22:22:22,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2023-08-25 22:22:22,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2023-08-25 22:22:22,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2023-08-25 22:22:22,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2023-08-25 22:22:22,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2023-08-25 22:22:22,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2023-08-25 22:22:22,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2023-08-25 22:22:22,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2023-08-25 22:22:22,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2023-08-25 22:22:22,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2023-08-25 22:22:22,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err16ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2023-08-25 22:22:22,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2023-08-25 22:22:22,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2023-08-25 22:22:22,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2023-08-25 22:22:22,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2023-08-25 22:22:22,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2023-08-25 22:22:22,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2023-08-25 22:22:22,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2023-08-25 22:22:22,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2023-08-25 22:22:22,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2023-08-25 22:22:22,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err18ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2023-08-25 22:22:22,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2023-08-25 22:22:22,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2023-08-25 22:22:22,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 22:22:22,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:22:22,498 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-08-25 22:22:22,499 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-25 22:22:22,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 131 transitions, 267 flow [2023-08-25 22:22:22,512 INFO L124 PetriNetUnfolderBase]: 8/141 cut-off events. [2023-08-25 22:22:22,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:22:22,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 141 events. 8/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 115. Up to 4 conditions per place. [2023-08-25 22:22:22,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 131 transitions, 267 flow [2023-08-25 22:22:22,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 131 transitions, 267 flow [2023-08-25 22:22:22,513 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 22:22:22,513 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 131 transitions, 267 flow [2023-08-25 22:22:22,513 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 131 transitions, 267 flow [2023-08-25 22:22:22,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 131 transitions, 267 flow [2023-08-25 22:22:22,522 INFO L124 PetriNetUnfolderBase]: 8/141 cut-off events. [2023-08-25 22:22:22,522 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:22:22,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 141 events. 8/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 115. Up to 4 conditions per place. [2023-08-25 22:22:22,523 INFO L119 LiptonReduction]: Number of co-enabled transitions 2678 [2023-08-25 22:22:24,801 INFO L134 LiptonReduction]: Checked pairs total: 4407 [2023-08-25 22:22:24,801 INFO L136 LiptonReduction]: Total number of compositions: 186 [2023-08-25 22:22:24,802 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-25 22:22:24,803 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;@55655ae8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 22:22:24,803 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-25 22:22:24,804 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 22:22:24,804 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-25 22:22:24,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:22:24,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:22:24,804 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-25 22:22:24,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-25 22:22:24,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:22:24,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1246538055, now seen corresponding path program 1 times [2023-08-25 22:22:24,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:22:24,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608627145] [2023-08-25 22:22:24,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:22:24,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:22:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 22:22:24,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 22:22:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 22:22:24,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 22:22:24,844 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 22:22:24,844 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-25 22:22:24,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 22:22:24,844 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-25 22:22:24,845 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-25 22:22:24,845 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-25 22:22:24,845 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-25 22:22:24,886 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 22:22:24,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 235 transitions, 482 flow [2023-08-25 22:22:24,914 INFO L124 PetriNetUnfolderBase]: 15/257 cut-off events. [2023-08-25 22:22:24,915 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 22:22:24,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 257 events. 15/257 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 218. Up to 6 conditions per place. [2023-08-25 22:22:24,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 235 transitions, 482 flow [2023-08-25 22:22:24,919 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 235 transitions, 482 flow [2023-08-25 22:22:24,919 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 22:22:24,919 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 235 transitions, 482 flow [2023-08-25 22:22:24,919 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 235 transitions, 482 flow [2023-08-25 22:22:24,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 235 transitions, 482 flow [2023-08-25 22:22:24,946 INFO L124 PetriNetUnfolderBase]: 15/257 cut-off events. [2023-08-25 22:22:24,946 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 22:22:24,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 257 events. 15/257 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 218. Up to 6 conditions per place. [2023-08-25 22:22:24,958 INFO L119 LiptonReduction]: Number of co-enabled transitions 26780 [2023-08-25 22:22:26,479 INFO L134 LiptonReduction]: Checked pairs total: 140464 [2023-08-25 22:22:26,479 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-25 22:22:26,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 22:22:26,481 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;@55655ae8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 22:22:26,481 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2023-08-25 22:22:26,483 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 22:22:26,483 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-25 22:22:26,483 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-25 22:22:26,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:22:26,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:22:26,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:22:26,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:22:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash 188289219, now seen corresponding path program 1 times [2023-08-25 22:22:26,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:22:26,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623257682] [2023-08-25 22:22:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:22:26,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:22:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:22:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:22:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:22:26,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623257682] [2023-08-25 22:22:26,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623257682] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:22:26,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:22:26,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 22:22:26,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307993892] [2023-08-25 22:22:26,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:22:26,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 22:22:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:22:26,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 22:22:26,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 22:22:26,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 357 [2023-08-25 22:22:26,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 149 transitions, 310 flow. Second operand has 2 states, 2 states have (on average 195.5) internal successors, (391), 2 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:26,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:22:26,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 357 [2023-08-25 22:22:26,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:22:26,824 INFO L124 PetriNetUnfolderBase]: 1184/3591 cut-off events. [2023-08-25 22:22:26,824 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-08-25 22:22:26,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5530 conditions, 3591 events. 1184/3591 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 29092 event pairs, 1032 based on Foata normal form. 74/3226 useless extension candidates. Maximal degree in co-relation 3047. Up to 1867 conditions per place. [2023-08-25 22:22:26,846 INFO L140 encePairwiseOnDemand]: 332/357 looper letters, 40 selfloop transitions, 0 changer transitions 0/123 dead transitions. [2023-08-25 22:22:26,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 123 transitions, 338 flow [2023-08-25 22:22:26,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 22:22:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 22:22:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 451 transitions. [2023-08-25 22:22:26,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6316526610644257 [2023-08-25 22:22:26,848 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 451 transitions. [2023-08-25 22:22:26,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 451 transitions. [2023-08-25 22:22:26,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:22:26,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 451 transitions. [2023-08-25 22:22:26,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 225.5) internal successors, (451), 2 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:26,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:26,850 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:26,851 INFO L175 Difference]: Start difference. First operand has 148 places, 149 transitions, 310 flow. Second operand 2 states and 451 transitions. [2023-08-25 22:22:26,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 123 transitions, 338 flow [2023-08-25 22:22:26,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 336 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-25 22:22:26,854 INFO L231 Difference]: Finished difference. Result has 125 places, 123 transitions, 256 flow [2023-08-25 22:22:26,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=256, PETRI_PLACES=125, PETRI_TRANSITIONS=123} [2023-08-25 22:22:26,855 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, -23 predicate places. [2023-08-25 22:22:26,855 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 123 transitions, 256 flow [2023-08-25 22:22:26,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 195.5) internal successors, (391), 2 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:26,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:22:26,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:22:26,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 22:22:26,856 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:22:26,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:22:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash -44178964, now seen corresponding path program 1 times [2023-08-25 22:22:26,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:22:26,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415733144] [2023-08-25 22:22:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:22:26,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:22:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:22:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:22:27,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:22:27,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415733144] [2023-08-25 22:22:27,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415733144] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:22:27,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:22:27,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 22:22:27,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863993609] [2023-08-25 22:22:27,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:22:27,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 22:22:27,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:22:27,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 22:22:27,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 22:22:27,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 357 [2023-08-25 22:22:27,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 123 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:27,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:22:27,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 357 [2023-08-25 22:22:27,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:22:29,060 INFO L124 PetriNetUnfolderBase]: 11158/20607 cut-off events. [2023-08-25 22:22:29,060 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2023-08-25 22:22:29,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39104 conditions, 20607 events. 11158/20607 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 169459 event pairs, 2753 based on Foata normal form. 0/18707 useless extension candidates. Maximal degree in co-relation 39099. Up to 8800 conditions per place. [2023-08-25 22:22:29,362 INFO L140 encePairwiseOnDemand]: 330/357 looper letters, 279 selfloop transitions, 26 changer transitions 0/338 dead transitions. [2023-08-25 22:22:29,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 338 transitions, 1316 flow [2023-08-25 22:22:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 22:22:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 22:22:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1125 transitions. [2023-08-25 22:22:29,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252100840336135 [2023-08-25 22:22:29,365 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1125 transitions. [2023-08-25 22:22:29,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1125 transitions. [2023-08-25 22:22:29,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:22:29,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1125 transitions. [2023-08-25 22:22:29,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.5) internal successors, (1125), 6 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:29,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:29,382 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:29,382 INFO L175 Difference]: Start difference. First operand has 125 places, 123 transitions, 256 flow. Second operand 6 states and 1125 transitions. [2023-08-25 22:22:29,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 338 transitions, 1316 flow [2023-08-25 22:22:29,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 338 transitions, 1316 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:22:29,387 INFO L231 Difference]: Finished difference. Result has 135 places, 148 transitions, 462 flow [2023-08-25 22:22:29,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=462, PETRI_PLACES=135, PETRI_TRANSITIONS=148} [2023-08-25 22:22:29,388 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, -13 predicate places. [2023-08-25 22:22:29,388 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 148 transitions, 462 flow [2023-08-25 22:22:29,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:29,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:22:29,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:22:29,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 22:22:29,388 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err18ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:22:29,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:22:29,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1869319521, now seen corresponding path program 1 times [2023-08-25 22:22:29,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:22:29,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104485526] [2023-08-25 22:22:29,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:22:29,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:22:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:22:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:22:29,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:22:29,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104485526] [2023-08-25 22:22:29,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104485526] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:22:29,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:22:29,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 22:22:29,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954744251] [2023-08-25 22:22:29,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:22:29,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:22:29,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:22:29,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:22:29,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:22:29,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 357 [2023-08-25 22:22:29,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 148 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:29,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:22:29,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 357 [2023-08-25 22:22:29,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:22:30,197 INFO L124 PetriNetUnfolderBase]: 2171/7145 cut-off events. [2023-08-25 22:22:30,198 INFO L125 PetriNetUnfolderBase]: For 687/759 co-relation queries the response was YES. [2023-08-25 22:22:30,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12225 conditions, 7145 events. 2171/7145 cut-off events. For 687/759 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 66617 event pairs, 1691 based on Foata normal form. 108/6522 useless extension candidates. Maximal degree in co-relation 12215. Up to 3439 conditions per place. [2023-08-25 22:22:30,249 INFO L140 encePairwiseOnDemand]: 355/357 looper letters, 65 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2023-08-25 22:22:30,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 168 transitions, 647 flow [2023-08-25 22:22:30,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:22:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:22:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2023-08-25 22:22:30,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5910364145658263 [2023-08-25 22:22:30,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 633 transitions. [2023-08-25 22:22:30,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 633 transitions. [2023-08-25 22:22:30,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:22:30,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 633 transitions. [2023-08-25 22:22:30,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:30,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:30,254 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:30,254 INFO L175 Difference]: Start difference. First operand has 135 places, 148 transitions, 462 flow. Second operand 3 states and 633 transitions. [2023-08-25 22:22:30,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 168 transitions, 647 flow [2023-08-25 22:22:30,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 168 transitions, 647 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:22:30,263 INFO L231 Difference]: Finished difference. Result has 137 places, 147 transitions, 464 flow [2023-08-25 22:22:30,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=137, PETRI_TRANSITIONS=147} [2023-08-25 22:22:30,264 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, -11 predicate places. [2023-08-25 22:22:30,264 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 147 transitions, 464 flow [2023-08-25 22:22:30,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:30,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:22:30,265 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:22:30,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 22:22:30,265 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:22:30,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:22:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash -972981811, now seen corresponding path program 1 times [2023-08-25 22:22:30,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:22:30,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700807051] [2023-08-25 22:22:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:22:30,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:22:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:22:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:22:30,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:22:30,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700807051] [2023-08-25 22:22:30,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700807051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:22:30,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:22:30,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 22:22:30,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793267455] [2023-08-25 22:22:30,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:22:30,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 22:22:30,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:22:30,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 22:22:30,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 22:22:30,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 357 [2023-08-25 22:22:30,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 147 transitions, 464 flow. Second operand has 6 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:30,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:22:30,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 357 [2023-08-25 22:22:30,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:22:33,164 INFO L124 PetriNetUnfolderBase]: 15099/28221 cut-off events. [2023-08-25 22:22:33,165 INFO L125 PetriNetUnfolderBase]: For 9255/9255 co-relation queries the response was YES. [2023-08-25 22:22:33,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62711 conditions, 28221 events. 15099/28221 cut-off events. For 9255/9255 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 243942 event pairs, 3142 based on Foata normal form. 0/26941 useless extension candidates. Maximal degree in co-relation 62700. Up to 12828 conditions per place. [2023-08-25 22:22:33,310 INFO L140 encePairwiseOnDemand]: 330/357 looper letters, 379 selfloop transitions, 26 changer transitions 0/438 dead transitions. [2023-08-25 22:22:33,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 438 transitions, 2424 flow [2023-08-25 22:22:33,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 22:22:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 22:22:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1116 transitions. [2023-08-25 22:22:33,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210084033613446 [2023-08-25 22:22:33,312 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1116 transitions. [2023-08-25 22:22:33,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1116 transitions. [2023-08-25 22:22:33,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:22:33,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1116 transitions. [2023-08-25 22:22:33,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:33,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:33,318 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:33,318 INFO L175 Difference]: Start difference. First operand has 137 places, 147 transitions, 464 flow. Second operand 6 states and 1116 transitions. [2023-08-25 22:22:33,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 438 transitions, 2424 flow [2023-08-25 22:22:33,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 438 transitions, 2414 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 22:22:33,365 INFO L231 Difference]: Finished difference. Result has 146 places, 172 transitions, 668 flow [2023-08-25 22:22:33,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=668, PETRI_PLACES=146, PETRI_TRANSITIONS=172} [2023-08-25 22:22:33,367 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, -2 predicate places. [2023-08-25 22:22:33,368 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 172 transitions, 668 flow [2023-08-25 22:22:33,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:33,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:22:33,368 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:22:33,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 22:22:33,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err18ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:22:33,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:22:33,369 INFO L85 PathProgramCache]: Analyzing trace with hash 643001669, now seen corresponding path program 1 times [2023-08-25 22:22:33,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:22:33,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141500527] [2023-08-25 22:22:33,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:22:33,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:22:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:22:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:22:33,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:22:33,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141500527] [2023-08-25 22:22:33,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141500527] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:22:33,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:22:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 22:22:33,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975616539] [2023-08-25 22:22:33,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:22:33,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 22:22:33,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:22:33,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 22:22:33,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-25 22:22:33,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 357 [2023-08-25 22:22:33,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 172 transitions, 668 flow. Second operand has 5 states, 5 states have (on average 150.0) internal successors, (750), 5 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:33,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:22:33,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 357 [2023-08-25 22:22:33,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:22:35,461 INFO L124 PetriNetUnfolderBase]: 8890/20880 cut-off events. [2023-08-25 22:22:35,461 INFO L125 PetriNetUnfolderBase]: For 5502/5646 co-relation queries the response was YES. [2023-08-25 22:22:35,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47137 conditions, 20880 events. 8890/20880 cut-off events. For 5502/5646 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 198875 event pairs, 2968 based on Foata normal form. 68/19612 useless extension candidates. Maximal degree in co-relation 47122. Up to 13628 conditions per place. [2023-08-25 22:22:35,565 INFO L140 encePairwiseOnDemand]: 349/357 looper letters, 176 selfloop transitions, 16 changer transitions 0/263 dead transitions. [2023-08-25 22:22:35,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 263 transitions, 1376 flow [2023-08-25 22:22:35,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 22:22:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 22:22:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1031 transitions. [2023-08-25 22:22:35,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48132586367880487 [2023-08-25 22:22:35,567 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1031 transitions. [2023-08-25 22:22:35,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1031 transitions. [2023-08-25 22:22:35,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:22:35,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1031 transitions. [2023-08-25 22:22:35,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:35,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:35,573 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:35,574 INFO L175 Difference]: Start difference. First operand has 146 places, 172 transitions, 668 flow. Second operand 6 states and 1031 transitions. [2023-08-25 22:22:35,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 263 transitions, 1376 flow [2023-08-25 22:22:35,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 263 transitions, 1376 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:22:35,607 INFO L231 Difference]: Finished difference. Result has 155 places, 188 transitions, 823 flow [2023-08-25 22:22:35,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=823, PETRI_PLACES=155, PETRI_TRANSITIONS=188} [2023-08-25 22:22:35,609 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 7 predicate places. [2023-08-25 22:22:35,609 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 188 transitions, 823 flow [2023-08-25 22:22:35,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.0) internal successors, (750), 5 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:35,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:22:35,609 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:22:35,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 22:22:35,609 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:22:35,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:22:35,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1942024971, now seen corresponding path program 1 times [2023-08-25 22:22:35,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:22:35,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011793829] [2023-08-25 22:22:35,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:22:35,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:22:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:22:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:22:35,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:22:35,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011793829] [2023-08-25 22:22:35,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011793829] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:22:35,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:22:35,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:22:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095424603] [2023-08-25 22:22:35,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:22:35,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:22:35,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:22:35,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:22:35,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:22:35,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:22:35,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 188 transitions, 823 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:35,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:22:35,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:22:35,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:22:40,799 INFO L124 PetriNetUnfolderBase]: 23834/44025 cut-off events. [2023-08-25 22:22:40,800 INFO L125 PetriNetUnfolderBase]: For 46659/46659 co-relation queries the response was YES. [2023-08-25 22:22:40,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129501 conditions, 44025 events. 23834/44025 cut-off events. For 46659/46659 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 396999 event pairs, 5220 based on Foata normal form. 320/42842 useless extension candidates. Maximal degree in co-relation 129481. Up to 22949 conditions per place. [2023-08-25 22:22:41,063 INFO L140 encePairwiseOnDemand]: 337/357 looper letters, 346 selfloop transitions, 50 changer transitions 0/425 dead transitions. [2023-08-25 22:22:41,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 425 transitions, 2673 flow [2023-08-25 22:22:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 22:22:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 22:22:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1611 transitions. [2023-08-25 22:22:41,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4102368220015279 [2023-08-25 22:22:41,067 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1611 transitions. [2023-08-25 22:22:41,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1611 transitions. [2023-08-25 22:22:41,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:22:41,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1611 transitions. [2023-08-25 22:22:41,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 146.45454545454547) internal successors, (1611), 11 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:41,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 357.0) internal successors, (4284), 12 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:41,073 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 357.0) internal successors, (4284), 12 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:41,074 INFO L175 Difference]: Start difference. First operand has 155 places, 188 transitions, 823 flow. Second operand 11 states and 1611 transitions. [2023-08-25 22:22:41,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 425 transitions, 2673 flow [2023-08-25 22:22:41,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 425 transitions, 2663 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-08-25 22:22:41,178 INFO L231 Difference]: Finished difference. Result has 173 places, 234 transitions, 1389 flow [2023-08-25 22:22:41,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1389, PETRI_PLACES=173, PETRI_TRANSITIONS=234} [2023-08-25 22:22:41,179 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 25 predicate places. [2023-08-25 22:22:41,179 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 234 transitions, 1389 flow [2023-08-25 22:22:41,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:41,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:22:41,180 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:22:41,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-25 22:22:41,180 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:22:41,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:22:41,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1788607509, now seen corresponding path program 2 times [2023-08-25 22:22:41,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:22:41,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317145480] [2023-08-25 22:22:41,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:22:41,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:22:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:22:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:22:41,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:22:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317145480] [2023-08-25 22:22:41,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317145480] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:22:41,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:22:41,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:22:41,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663231732] [2023-08-25 22:22:41,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:22:41,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:22:41,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:22:41,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:22:41,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:22:41,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:22:41,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 234 transitions, 1389 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:41,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:22:41,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:22:41,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:22:48,601 INFO L124 PetriNetUnfolderBase]: 29822/54931 cut-off events. [2023-08-25 22:22:48,601 INFO L125 PetriNetUnfolderBase]: For 77704/77706 co-relation queries the response was YES. [2023-08-25 22:22:48,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171306 conditions, 54931 events. 29822/54931 cut-off events. For 77704/77706 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 511089 event pairs, 6704 based on Foata normal form. 322/53418 useless extension candidates. Maximal degree in co-relation 171278. Up to 24421 conditions per place. [2023-08-25 22:22:49,040 INFO L140 encePairwiseOnDemand]: 337/357 looper letters, 378 selfloop transitions, 66 changer transitions 0/473 dead transitions. [2023-08-25 22:22:49,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 473 transitions, 3479 flow [2023-08-25 22:22:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 22:22:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 22:22:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1610 transitions. [2023-08-25 22:22:49,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40998217468805703 [2023-08-25 22:22:49,043 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1610 transitions. [2023-08-25 22:22:49,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1610 transitions. [2023-08-25 22:22:49,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:22:49,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1610 transitions. [2023-08-25 22:22:49,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 146.36363636363637) internal successors, (1610), 11 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:49,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 357.0) internal successors, (4284), 12 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:49,049 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 357.0) internal successors, (4284), 12 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:49,049 INFO L175 Difference]: Start difference. First operand has 173 places, 234 transitions, 1389 flow. Second operand 11 states and 1610 transitions. [2023-08-25 22:22:49,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 473 transitions, 3479 flow [2023-08-25 22:22:49,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 473 transitions, 3453 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-25 22:22:49,234 INFO L231 Difference]: Finished difference. Result has 189 places, 284 transitions, 2155 flow [2023-08-25 22:22:49,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2155, PETRI_PLACES=189, PETRI_TRANSITIONS=284} [2023-08-25 22:22:49,235 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 41 predicate places. [2023-08-25 22:22:49,235 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 284 transitions, 2155 flow [2023-08-25 22:22:49,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:49,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:22:49,236 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:22:49,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-25 22:22:49,236 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:22:49,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:22:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash -193320335, now seen corresponding path program 3 times [2023-08-25 22:22:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:22:49,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575169916] [2023-08-25 22:22:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:22:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:22:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:22:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:22:49,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:22:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575169916] [2023-08-25 22:22:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575169916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:22:49,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:22:49,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:22:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554122166] [2023-08-25 22:22:49,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:22:49,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:22:49,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:22:49,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:22:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:22:49,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:22:49,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 284 transitions, 2155 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:49,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:22:49,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:22:49,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:22:58,483 INFO L124 PetriNetUnfolderBase]: 35506/65307 cut-off events. [2023-08-25 22:22:58,483 INFO L125 PetriNetUnfolderBase]: For 128408/128408 co-relation queries the response was YES. [2023-08-25 22:22:58,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214436 conditions, 65307 events. 35506/65307 cut-off events. For 128408/128408 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 622293 event pairs, 6194 based on Foata normal form. 320/63390 useless extension candidates. Maximal degree in co-relation 214401. Up to 31906 conditions per place. [2023-08-25 22:22:59,017 INFO L140 encePairwiseOnDemand]: 335/357 looper letters, 410 selfloop transitions, 115 changer transitions 0/554 dead transitions. [2023-08-25 22:22:59,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 554 transitions, 4627 flow [2023-08-25 22:22:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-25 22:22:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-25 22:22:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1896 transitions. [2023-08-25 22:22:59,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853264382676147 [2023-08-25 22:22:59,021 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1896 transitions. [2023-08-25 22:22:59,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1896 transitions. [2023-08-25 22:22:59,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:22:59,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1896 transitions. [2023-08-25 22:22:59,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 145.84615384615384) internal successors, (1896), 13 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:59,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 357.0) internal successors, (4998), 14 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:59,027 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 357.0) internal successors, (4998), 14 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:59,027 INFO L175 Difference]: Start difference. First operand has 189 places, 284 transitions, 2155 flow. Second operand 13 states and 1896 transitions. [2023-08-25 22:22:59,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 554 transitions, 4627 flow [2023-08-25 22:22:59,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 554 transitions, 4575 flow, removed 26 selfloop flow, removed 0 redundant places. [2023-08-25 22:22:59,298 INFO L231 Difference]: Finished difference. Result has 209 places, 328 transitions, 3080 flow [2023-08-25 22:22:59,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=2107, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3080, PETRI_PLACES=209, PETRI_TRANSITIONS=328} [2023-08-25 22:22:59,300 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 61 predicate places. [2023-08-25 22:22:59,300 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 328 transitions, 3080 flow [2023-08-25 22:22:59,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:59,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:22:59,300 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:22:59,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-25 22:22:59,300 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:22:59,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:22:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1865112305, now seen corresponding path program 4 times [2023-08-25 22:22:59,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:22:59,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30627521] [2023-08-25 22:22:59,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:22:59,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:22:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:22:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:22:59,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:22:59,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30627521] [2023-08-25 22:22:59,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30627521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:22:59,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:22:59,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:22:59,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691270538] [2023-08-25 22:22:59,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:22:59,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:22:59,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:22:59,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:22:59,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:22:59,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:22:59,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 328 transitions, 3080 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:22:59,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:22:59,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:22:59,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:23:10,850 INFO L124 PetriNetUnfolderBase]: 40694/74783 cut-off events. [2023-08-25 22:23:10,850 INFO L125 PetriNetUnfolderBase]: For 205841/205841 co-relation queries the response was YES. [2023-08-25 22:23:11,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259777 conditions, 74783 events. 40694/74783 cut-off events. For 205841/205841 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 724439 event pairs, 7174 based on Foata normal form. 320/72598 useless extension candidates. Maximal degree in co-relation 259734. Up to 40839 conditions per place. [2023-08-25 22:23:11,580 INFO L140 encePairwiseOnDemand]: 334/357 looper letters, 463 selfloop transitions, 139 changer transitions 0/631 dead transitions. [2023-08-25 22:23:11,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 631 transitions, 5893 flow [2023-08-25 22:23:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-25 22:23:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-25 22:23:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2065 transitions. [2023-08-25 22:23:11,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41316526610644255 [2023-08-25 22:23:11,583 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2065 transitions. [2023-08-25 22:23:11,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2065 transitions. [2023-08-25 22:23:11,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:23:11,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2065 transitions. [2023-08-25 22:23:11,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 147.5) internal successors, (2065), 14 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:11,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 357.0) internal successors, (5355), 15 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:11,590 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 357.0) internal successors, (5355), 15 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:11,590 INFO L175 Difference]: Start difference. First operand has 209 places, 328 transitions, 3080 flow. Second operand 14 states and 2065 transitions. [2023-08-25 22:23:11,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 631 transitions, 5893 flow [2023-08-25 22:23:12,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 631 transitions, 5848 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-25 22:23:12,230 INFO L231 Difference]: Finished difference. Result has 227 places, 365 transitions, 4102 flow [2023-08-25 22:23:12,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=3039, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4102, PETRI_PLACES=227, PETRI_TRANSITIONS=365} [2023-08-25 22:23:12,230 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 79 predicate places. [2023-08-25 22:23:12,231 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 365 transitions, 4102 flow [2023-08-25 22:23:12,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:12,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:23:12,231 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:23:12,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 22:23:12,231 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:23:12,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:23:12,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1380237143, now seen corresponding path program 5 times [2023-08-25 22:23:12,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:23:12,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016713271] [2023-08-25 22:23:12,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:23:12,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:23:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:23:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:23:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:23:12,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016713271] [2023-08-25 22:23:12,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016713271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:23:12,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:23:12,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:23:12,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296534819] [2023-08-25 22:23:12,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:23:12,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:23:12,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:23:12,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:23:12,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:23:12,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:23:12,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 365 transitions, 4102 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:12,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:23:12,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:23:12,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:23:24,500 INFO L124 PetriNetUnfolderBase]: 41018/75155 cut-off events. [2023-08-25 22:23:24,500 INFO L125 PetriNetUnfolderBase]: For 251909/251909 co-relation queries the response was YES. [2023-08-25 22:23:24,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269575 conditions, 75155 events. 41018/75155 cut-off events. For 251909/251909 co-relation queries the response was YES. Maximal size of possible extension queue 1433. Compared 726468 event pairs, 7100 based on Foata normal form. 80/72652 useless extension candidates. Maximal degree in co-relation 269525. Up to 39816 conditions per place. [2023-08-25 22:23:25,490 INFO L140 encePairwiseOnDemand]: 338/357 looper letters, 467 selfloop transitions, 141 changer transitions 0/637 dead transitions. [2023-08-25 22:23:25,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 637 transitions, 6563 flow [2023-08-25 22:23:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-25 22:23:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-25 22:23:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2057 transitions. [2023-08-25 22:23:25,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41156462585034015 [2023-08-25 22:23:25,493 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2057 transitions. [2023-08-25 22:23:25,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2057 transitions. [2023-08-25 22:23:25,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:23:25,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2057 transitions. [2023-08-25 22:23:25,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 146.92857142857142) internal successors, (2057), 14 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:25,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 357.0) internal successors, (5355), 15 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:25,499 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 357.0) internal successors, (5355), 15 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:25,499 INFO L175 Difference]: Start difference. First operand has 227 places, 365 transitions, 4102 flow. Second operand 14 states and 2057 transitions. [2023-08-25 22:23:25,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 637 transitions, 6563 flow [2023-08-25 22:23:26,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 637 transitions, 6492 flow, removed 29 selfloop flow, removed 3 redundant places. [2023-08-25 22:23:26,248 INFO L231 Difference]: Finished difference. Result has 240 places, 370 transitions, 4573 flow [2023-08-25 22:23:26,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=4043, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4573, PETRI_PLACES=240, PETRI_TRANSITIONS=370} [2023-08-25 22:23:26,249 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 92 predicate places. [2023-08-25 22:23:26,249 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 370 transitions, 4573 flow [2023-08-25 22:23:26,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:26,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:23:26,249 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:23:26,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-25 22:23:26,250 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:23:26,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:23:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash -603344367, now seen corresponding path program 6 times [2023-08-25 22:23:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:23:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239775108] [2023-08-25 22:23:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:23:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:23:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:23:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:23:26,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:23:26,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239775108] [2023-08-25 22:23:26,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239775108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:23:26,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:23:26,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:23:26,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741679759] [2023-08-25 22:23:26,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:23:26,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:23:26,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:23:26,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:23:26,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:23:26,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:23:26,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 370 transitions, 4573 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:26,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:23:26,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:23:26,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:23:40,667 INFO L124 PetriNetUnfolderBase]: 46334/84883 cut-off events. [2023-08-25 22:23:40,667 INFO L125 PetriNetUnfolderBase]: For 370905/370905 co-relation queries the response was YES. [2023-08-25 22:23:41,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314749 conditions, 84883 events. 46334/84883 cut-off events. For 370905/370905 co-relation queries the response was YES. Maximal size of possible extension queue 1646. Compared 836284 event pairs, 8196 based on Foata normal form. 80/82054 useless extension candidates. Maximal degree in co-relation 314696. Up to 40432 conditions per place. [2023-08-25 22:23:41,525 INFO L140 encePairwiseOnDemand]: 338/357 looper letters, 435 selfloop transitions, 156 changer transitions 0/620 dead transitions. [2023-08-25 22:23:41,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 620 transitions, 7242 flow [2023-08-25 22:23:41,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-25 22:23:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-25 22:23:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1895 transitions. [2023-08-25 22:23:41,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40831717302305537 [2023-08-25 22:23:41,528 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1895 transitions. [2023-08-25 22:23:41,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1895 transitions. [2023-08-25 22:23:41,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:23:41,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1895 transitions. [2023-08-25 22:23:41,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 145.76923076923077) internal successors, (1895), 13 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:41,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 357.0) internal successors, (4998), 14 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:41,535 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 357.0) internal successors, (4998), 14 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:41,535 INFO L175 Difference]: Start difference. First operand has 240 places, 370 transitions, 4573 flow. Second operand 13 states and 1895 transitions. [2023-08-25 22:23:41,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 620 transitions, 7242 flow [2023-08-25 22:23:42,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 620 transitions, 7140 flow, removed 6 selfloop flow, removed 9 redundant places. [2023-08-25 22:23:42,673 INFO L231 Difference]: Finished difference. Result has 249 places, 398 transitions, 5593 flow [2023-08-25 22:23:42,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=4486, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5593, PETRI_PLACES=249, PETRI_TRANSITIONS=398} [2023-08-25 22:23:42,674 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 101 predicate places. [2023-08-25 22:23:42,674 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 398 transitions, 5593 flow [2023-08-25 22:23:42,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:42,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:23:42,675 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:23:42,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-25 22:23:42,675 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:23:42,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:23:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash 462438659, now seen corresponding path program 7 times [2023-08-25 22:23:42,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:23:42,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665248422] [2023-08-25 22:23:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:23:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:23:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:23:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:23:42,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:23:42,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665248422] [2023-08-25 22:23:42,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665248422] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:23:42,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:23:42,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:23:42,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577812744] [2023-08-25 22:23:42,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:23:42,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:23:42,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:23:42,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:23:42,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:23:42,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:23:42,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 398 transitions, 5593 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:23:42,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:23:42,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:23:42,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:23:59,250 INFO L124 PetriNetUnfolderBase]: 51628/94485 cut-off events. [2023-08-25 22:23:59,250 INFO L125 PetriNetUnfolderBase]: For 521065/521065 co-relation queries the response was YES. [2023-08-25 22:24:00,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362214 conditions, 94485 events. 51628/94485 cut-off events. For 521065/521065 co-relation queries the response was YES. Maximal size of possible extension queue 1858. Compared 944991 event pairs, 9284 based on Foata normal form. 80/91344 useless extension candidates. Maximal degree in co-relation 362155. Up to 48338 conditions per place. [2023-08-25 22:24:00,393 INFO L140 encePairwiseOnDemand]: 338/357 looper letters, 440 selfloop transitions, 174 changer transitions 0/643 dead transitions. [2023-08-25 22:24:00,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 643 transitions, 8277 flow [2023-08-25 22:24:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-25 22:24:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-25 22:24:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1895 transitions. [2023-08-25 22:24:00,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40831717302305537 [2023-08-25 22:24:00,396 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1895 transitions. [2023-08-25 22:24:00,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1895 transitions. [2023-08-25 22:24:00,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:24:00,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1895 transitions. [2023-08-25 22:24:00,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 145.76923076923077) internal successors, (1895), 13 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:00,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 357.0) internal successors, (4998), 14 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:00,402 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 357.0) internal successors, (4998), 14 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:00,402 INFO L175 Difference]: Start difference. First operand has 249 places, 398 transitions, 5593 flow. Second operand 13 states and 1895 transitions. [2023-08-25 22:24:00,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 643 transitions, 8277 flow [2023-08-25 22:24:02,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 643 transitions, 8160 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-08-25 22:24:02,612 INFO L231 Difference]: Finished difference. Result has 263 places, 422 transitions, 6639 flow [2023-08-25 22:24:02,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=5484, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6639, PETRI_PLACES=263, PETRI_TRANSITIONS=422} [2023-08-25 22:24:02,612 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 115 predicate places. [2023-08-25 22:24:02,613 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 422 transitions, 6639 flow [2023-08-25 22:24:02,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:02,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:24:02,613 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:24:02,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-25 22:24:02,613 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:24:02,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:24:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1292548185, now seen corresponding path program 8 times [2023-08-25 22:24:02,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:24:02,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352108013] [2023-08-25 22:24:02,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:24:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:24:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:24:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:24:02,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:24:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352108013] [2023-08-25 22:24:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352108013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:24:02,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:24:02,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:24:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111107113] [2023-08-25 22:24:02,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:24:02,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:24:02,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:24:02,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:24:02,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:24:02,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:24:02,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 422 transitions, 6639 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:02,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:24:02,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:24:02,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:24:20,746 INFO L124 PetriNetUnfolderBase]: 51952/94941 cut-off events. [2023-08-25 22:24:20,746 INFO L125 PetriNetUnfolderBase]: For 652017/652017 co-relation queries the response was YES. [2023-08-25 22:24:21,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377158 conditions, 94941 events. 51952/94941 cut-off events. For 652017/652017 co-relation queries the response was YES. Maximal size of possible extension queue 1863. Compared 946649 event pairs, 11498 based on Foata normal form. 80/91722 useless extension candidates. Maximal degree in co-relation 377094. Up to 47896 conditions per place. [2023-08-25 22:24:21,971 INFO L140 encePairwiseOnDemand]: 338/357 looper letters, 487 selfloop transitions, 176 changer transitions 0/692 dead transitions. [2023-08-25 22:24:21,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 692 transitions, 9191 flow [2023-08-25 22:24:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-25 22:24:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-25 22:24:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2182 transitions. [2023-08-25 22:24:21,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40746965452847805 [2023-08-25 22:24:21,973 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2182 transitions. [2023-08-25 22:24:21,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2182 transitions. [2023-08-25 22:24:21,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:24:21,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2182 transitions. [2023-08-25 22:24:21,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 145.46666666666667) internal successors, (2182), 15 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:21,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 357.0) internal successors, (5712), 16 states have internal predecessors, (5712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:21,978 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 357.0) internal successors, (5712), 16 states have internal predecessors, (5712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:21,979 INFO L175 Difference]: Start difference. First operand has 263 places, 422 transitions, 6639 flow. Second operand 15 states and 2182 transitions. [2023-08-25 22:24:21,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 692 transitions, 9191 flow [2023-08-25 22:24:24,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 692 transitions, 9101 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-25 22:24:24,721 INFO L231 Difference]: Finished difference. Result has 276 places, 427 transitions, 7235 flow [2023-08-25 22:24:24,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=6549, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7235, PETRI_PLACES=276, PETRI_TRANSITIONS=427} [2023-08-25 22:24:24,722 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 128 predicate places. [2023-08-25 22:24:24,722 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 427 transitions, 7235 flow [2023-08-25 22:24:24,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:24,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:24:24,723 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:24:24,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-25 22:24:24,723 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:24:24,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:24:24,723 INFO L85 PathProgramCache]: Analyzing trace with hash -486508597, now seen corresponding path program 9 times [2023-08-25 22:24:24,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:24:24,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274231656] [2023-08-25 22:24:24,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:24:24,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:24:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:24:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:24:25,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:24:25,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274231656] [2023-08-25 22:24:25,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274231656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:24:25,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:24:25,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:24:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490562776] [2023-08-25 22:24:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:24:25,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:24:25,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:24:25,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:24:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:24:25,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:24:25,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 427 transitions, 7235 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:25,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:24:25,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:24:25,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:24:43,886 INFO L124 PetriNetUnfolderBase]: 52398/95669 cut-off events. [2023-08-25 22:24:43,886 INFO L125 PetriNetUnfolderBase]: For 793591/793591 co-relation queries the response was YES. [2023-08-25 22:24:45,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392308 conditions, 95669 events. 52398/95669 cut-off events. For 793591/793591 co-relation queries the response was YES. Maximal size of possible extension queue 1874. Compared 954015 event pairs, 11420 based on Foata normal form. 80/92358 useless extension candidates. Maximal degree in co-relation 392241. Up to 47900 conditions per place. [2023-08-25 22:24:45,432 INFO L140 encePairwiseOnDemand]: 338/357 looper letters, 530 selfloop transitions, 181 changer transitions 0/740 dead transitions. [2023-08-25 22:24:45,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 740 transitions, 10089 flow [2023-08-25 22:24:45,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-25 22:24:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-25 22:24:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2346 transitions. [2023-08-25 22:24:45,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2023-08-25 22:24:45,435 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2346 transitions. [2023-08-25 22:24:45,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2346 transitions. [2023-08-25 22:24:45,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:24:45,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2346 transitions. [2023-08-25 22:24:45,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 146.625) internal successors, (2346), 16 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:45,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 357.0) internal successors, (6069), 17 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:45,442 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 357.0) internal successors, (6069), 17 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:45,443 INFO L175 Difference]: Start difference. First operand has 276 places, 427 transitions, 7235 flow. Second operand 16 states and 2346 transitions. [2023-08-25 22:24:45,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 740 transitions, 10089 flow [2023-08-25 22:24:48,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 740 transitions, 9949 flow, removed 14 selfloop flow, removed 9 redundant places. [2023-08-25 22:24:48,843 INFO L231 Difference]: Finished difference. Result has 286 places, 434 transitions, 7841 flow [2023-08-25 22:24:48,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=7097, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7841, PETRI_PLACES=286, PETRI_TRANSITIONS=434} [2023-08-25 22:24:48,844 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 138 predicate places. [2023-08-25 22:24:48,844 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 434 transitions, 7841 flow [2023-08-25 22:24:48,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:48,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:24:48,844 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:24:48,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-25 22:24:48,844 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:24:48,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:24:48,844 INFO L85 PathProgramCache]: Analyzing trace with hash -603444807, now seen corresponding path program 10 times [2023-08-25 22:24:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:24:48,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301861910] [2023-08-25 22:24:48,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:24:48,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:24:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:24:49,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:24:49,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:24:49,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301861910] [2023-08-25 22:24:49,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301861910] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:24:49,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:24:49,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:24:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955049208] [2023-08-25 22:24:49,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:24:49,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:24:49,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:24:49,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:24:49,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:24:49,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:24:49,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 434 transitions, 7841 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:24:49,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:24:49,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:24:49,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:25:07,590 INFO L124 PetriNetUnfolderBase]: 52722/96351 cut-off events. [2023-08-25 22:25:07,591 INFO L125 PetriNetUnfolderBase]: For 957183/957183 co-relation queries the response was YES. [2023-08-25 22:25:08,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407354 conditions, 96351 events. 52722/96351 cut-off events. For 957183/957183 co-relation queries the response was YES. Maximal size of possible extension queue 1884. Compared 963677 event pairs, 9600 based on Foata normal form. 80/92928 useless extension candidates. Maximal degree in co-relation 407284. Up to 42853 conditions per place. [2023-08-25 22:25:09,169 INFO L140 encePairwiseOnDemand]: 338/357 looper letters, 493 selfloop transitions, 178 changer transitions 0/700 dead transitions. [2023-08-25 22:25:09,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 700 transitions, 10413 flow [2023-08-25 22:25:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-25 22:25:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-25 22:25:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2059 transitions. [2023-08-25 22:25:09,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41196478591436575 [2023-08-25 22:25:09,171 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2059 transitions. [2023-08-25 22:25:09,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2059 transitions. [2023-08-25 22:25:09,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:25:09,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2059 transitions. [2023-08-25 22:25:09,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 147.07142857142858) internal successors, (2059), 14 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:25:09,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 357.0) internal successors, (5355), 15 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:25:09,176 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 357.0) internal successors, (5355), 15 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:25:09,176 INFO L175 Difference]: Start difference. First operand has 286 places, 434 transitions, 7841 flow. Second operand 14 states and 2059 transitions. [2023-08-25 22:25:09,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 700 transitions, 10413 flow [2023-08-25 22:25:12,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 700 transitions, 10226 flow, removed 24 selfloop flow, removed 11 redundant places. [2023-08-25 22:25:12,921 INFO L231 Difference]: Finished difference. Result has 291 places, 439 transitions, 8375 flow [2023-08-25 22:25:12,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=7660, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8375, PETRI_PLACES=291, PETRI_TRANSITIONS=439} [2023-08-25 22:25:12,922 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 143 predicate places. [2023-08-25 22:25:12,922 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 439 transitions, 8375 flow [2023-08-25 22:25:12,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:25:12,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:25:12,922 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:25:12,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-25 22:25:12,922 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:25:12,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:25:12,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1415654015, now seen corresponding path program 11 times [2023-08-25 22:25:12,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:25:12,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205183954] [2023-08-25 22:25:12,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:25:12,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:25:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:25:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:25:13,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:25:13,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205183954] [2023-08-25 22:25:13,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205183954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:25:13,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:25:13,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:25:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779526016] [2023-08-25 22:25:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:25:13,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:25:13,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:25:13,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:25:13,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:25:13,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:25:13,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 439 transitions, 8375 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:25:13,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:25:13,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:25:13,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:25:32,376 INFO L124 PetriNetUnfolderBase]: 53168/96973 cut-off events. [2023-08-25 22:25:32,376 INFO L125 PetriNetUnfolderBase]: For 1118805/1118805 co-relation queries the response was YES. [2023-08-25 22:25:33,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422960 conditions, 96973 events. 53168/96973 cut-off events. For 1118805/1118805 co-relation queries the response was YES. Maximal size of possible extension queue 1892. Compared 966626 event pairs, 11576 based on Foata normal form. 80/93478 useless extension candidates. Maximal degree in co-relation 422887. Up to 44057 conditions per place. [2023-08-25 22:25:34,064 INFO L140 encePairwiseOnDemand]: 338/357 looper letters, 536 selfloop transitions, 189 changer transitions 0/754 dead transitions. [2023-08-25 22:25:34,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 754 transitions, 11289 flow [2023-08-25 22:25:34,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-25 22:25:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-25 22:25:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2471 transitions. [2023-08-25 22:25:34,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4071510957324106 [2023-08-25 22:25:34,067 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2471 transitions. [2023-08-25 22:25:34,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2471 transitions. [2023-08-25 22:25:34,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:25:34,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2471 transitions. [2023-08-25 22:25:34,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 145.35294117647058) internal successors, (2471), 17 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:25:34,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 357.0) internal successors, (6426), 18 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:25:34,074 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 357.0) internal successors, (6426), 18 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:25:34,075 INFO L175 Difference]: Start difference. First operand has 291 places, 439 transitions, 8375 flow. Second operand 17 states and 2471 transitions. [2023-08-25 22:25:34,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 754 transitions, 11289 flow [2023-08-25 22:25:39,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 754 transitions, 11057 flow, removed 11 selfloop flow, removed 10 redundant places. [2023-08-25 22:25:39,369 INFO L231 Difference]: Finished difference. Result has 301 places, 446 transitions, 8940 flow [2023-08-25 22:25:39,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=8145, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8940, PETRI_PLACES=301, PETRI_TRANSITIONS=446} [2023-08-25 22:25:39,370 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 153 predicate places. [2023-08-25 22:25:39,370 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 446 transitions, 8940 flow [2023-08-25 22:25:39,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:25:39,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:25:39,370 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:25:39,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-25 22:25:39,371 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:25:39,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:25:39,371 INFO L85 PathProgramCache]: Analyzing trace with hash -701264997, now seen corresponding path program 12 times [2023-08-25 22:25:39,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:25:39,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473960977] [2023-08-25 22:25:39,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:25:39,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:25:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:25:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:25:39,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:25:39,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473960977] [2023-08-25 22:25:39,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473960977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:25:39,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:25:39,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:25:39,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791359447] [2023-08-25 22:25:39,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:25:39,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:25:39,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:25:39,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:25:39,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:25:39,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:25:39,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 446 transitions, 8940 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:25:39,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:25:39,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:25:39,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:25:59,621 INFO L124 PetriNetUnfolderBase]: 53736/97323 cut-off events. [2023-08-25 22:25:59,622 INFO L125 PetriNetUnfolderBase]: For 1211058/1211058 co-relation queries the response was YES. [2023-08-25 22:26:00,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438562 conditions, 97323 events. 53736/97323 cut-off events. For 1211058/1211058 co-relation queries the response was YES. Maximal size of possible extension queue 1895. Compared 968745 event pairs, 7044 based on Foata normal form. 80/93864 useless extension candidates. Maximal degree in co-relation 438486. Up to 47318 conditions per place. [2023-08-25 22:26:01,305 INFO L140 encePairwiseOnDemand]: 326/357 looper letters, 642 selfloop transitions, 214 changer transitions 0/885 dead transitions. [2023-08-25 22:26:01,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 885 transitions, 12772 flow [2023-08-25 22:26:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-25 22:26:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-25 22:26:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2659 transitions. [2023-08-25 22:26:01,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4137877373171491 [2023-08-25 22:26:01,307 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2659 transitions. [2023-08-25 22:26:01,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2659 transitions. [2023-08-25 22:26:01,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:26:01,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2659 transitions. [2023-08-25 22:26:01,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 147.72222222222223) internal successors, (2659), 18 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:26:01,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 357.0) internal successors, (6783), 19 states have internal predecessors, (6783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:26:01,314 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 357.0) internal successors, (6783), 19 states have internal predecessors, (6783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:26:01,314 INFO L175 Difference]: Start difference. First operand has 301 places, 446 transitions, 8940 flow. Second operand 18 states and 2659 transitions. [2023-08-25 22:26:01,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 885 transitions, 12772 flow [2023-08-25 22:26:08,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 885 transitions, 12482 flow, removed 46 selfloop flow, removed 15 redundant places. [2023-08-25 22:26:08,465 INFO L231 Difference]: Finished difference. Result has 308 places, 467 transitions, 9689 flow [2023-08-25 22:26:08,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=8680, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=9689, PETRI_PLACES=308, PETRI_TRANSITIONS=467} [2023-08-25 22:26:08,467 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 160 predicate places. [2023-08-25 22:26:08,467 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 467 transitions, 9689 flow [2023-08-25 22:26:08,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:26:08,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:26:08,467 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:26:08,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-25 22:26:08,467 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:26:08,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:26:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1620630153, now seen corresponding path program 13 times [2023-08-25 22:26:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:26:08,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366837632] [2023-08-25 22:26:08,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:26:08,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:26:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:26:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:26:08,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:26:08,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366837632] [2023-08-25 22:26:08,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366837632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:26:08,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:26:08,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:26:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828135422] [2023-08-25 22:26:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:26:08,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:26:08,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:26:08,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:26:08,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:26:08,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:26:08,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 467 transitions, 9689 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:26:08,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:26:08,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:26:08,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:26:30,059 INFO L124 PetriNetUnfolderBase]: 54060/98761 cut-off events. [2023-08-25 22:26:30,059 INFO L125 PetriNetUnfolderBase]: For 1403315/1403315 co-relation queries the response was YES. [2023-08-25 22:26:31,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464134 conditions, 98761 events. 54060/98761 cut-off events. For 1403315/1403315 co-relation queries the response was YES. Maximal size of possible extension queue 1917. Compared 987858 event pairs, 10066 based on Foata normal form. 80/95036 useless extension candidates. Maximal degree in co-relation 464057. Up to 58675 conditions per place. [2023-08-25 22:26:32,222 INFO L140 encePairwiseOnDemand]: 337/357 looper letters, 560 selfloop transitions, 187 changer transitions 0/776 dead transitions. [2023-08-25 22:26:32,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 776 transitions, 12630 flow [2023-08-25 22:26:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-25 22:26:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-25 22:26:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2226 transitions. [2023-08-25 22:26:32,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41568627450980394 [2023-08-25 22:26:32,225 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2226 transitions. [2023-08-25 22:26:32,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2226 transitions. [2023-08-25 22:26:32,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:26:32,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2226 transitions. [2023-08-25 22:26:32,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 148.4) internal successors, (2226), 15 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:26:32,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 357.0) internal successors, (5712), 16 states have internal predecessors, (5712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:26:32,233 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 357.0) internal successors, (5712), 16 states have internal predecessors, (5712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:26:32,233 INFO L175 Difference]: Start difference. First operand has 308 places, 467 transitions, 9689 flow. Second operand 15 states and 2226 transitions. [2023-08-25 22:26:32,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 776 transitions, 12630 flow [2023-08-25 22:26:43,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 776 transitions, 12314 flow, removed 29 selfloop flow, removed 14 redundant places. [2023-08-25 22:26:43,214 INFO L231 Difference]: Finished difference. Result has 311 places, 472 transitions, 10134 flow [2023-08-25 22:26:43,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=9381, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=10134, PETRI_PLACES=311, PETRI_TRANSITIONS=472} [2023-08-25 22:26:43,215 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 163 predicate places. [2023-08-25 22:26:43,215 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 472 transitions, 10134 flow [2023-08-25 22:26:43,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:26:43,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:26:43,216 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:26:43,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-25 22:26:43,216 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:26:43,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:26:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash 639814323, now seen corresponding path program 14 times [2023-08-25 22:26:43,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:26:43,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111185622] [2023-08-25 22:26:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:26:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:26:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:26:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:26:43,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:26:43,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111185622] [2023-08-25 22:26:43,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111185622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:26:43,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:26:43,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:26:43,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117319463] [2023-08-25 22:26:43,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:26:43,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:26:43,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:26:43,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:26:43,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:26:43,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:26:43,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 472 transitions, 10134 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:26:43,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:26:43,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:26:43,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:27:05,312 INFO L124 PetriNetUnfolderBase]: 54506/99471 cut-off events. [2023-08-25 22:27:05,312 INFO L125 PetriNetUnfolderBase]: For 1500131/1500131 co-relation queries the response was YES. [2023-08-25 22:27:06,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478762 conditions, 99471 events. 54506/99471 cut-off events. For 1500131/1500131 co-relation queries the response was YES. Maximal size of possible extension queue 1927. Compared 994879 event pairs, 10144 based on Foata normal form. 80/95656 useless extension candidates. Maximal degree in co-relation 478685. Up to 59035 conditions per place. [2023-08-25 22:27:06,734 INFO L140 encePairwiseOnDemand]: 337/357 looper letters, 603 selfloop transitions, 192 changer transitions 0/824 dead transitions. [2023-08-25 22:27:06,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 824 transitions, 13371 flow [2023-08-25 22:27:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-25 22:27:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-25 22:27:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2390 transitions. [2023-08-25 22:27:06,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4184173669467787 [2023-08-25 22:27:06,738 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2390 transitions. [2023-08-25 22:27:06,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2390 transitions. [2023-08-25 22:27:06,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:27:06,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2390 transitions. [2023-08-25 22:27:06,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 149.375) internal successors, (2390), 16 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:27:06,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 357.0) internal successors, (6069), 17 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:27:06,746 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 357.0) internal successors, (6069), 17 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:27:06,746 INFO L175 Difference]: Start difference. First operand has 311 places, 472 transitions, 10134 flow. Second operand 16 states and 2390 transitions. [2023-08-25 22:27:06,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 824 transitions, 13371 flow [2023-08-25 22:27:16,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 824 transitions, 13109 flow, removed 10 selfloop flow, removed 12 redundant places. [2023-08-25 22:27:16,094 INFO L231 Difference]: Finished difference. Result has 318 places, 479 transitions, 10687 flow [2023-08-25 22:27:16,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=9874, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=10687, PETRI_PLACES=318, PETRI_TRANSITIONS=479} [2023-08-25 22:27:16,094 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 170 predicate places. [2023-08-25 22:27:16,094 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 479 transitions, 10687 flow [2023-08-25 22:27:16,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:27:16,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:27:16,095 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:27:16,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-25 22:27:16,095 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:27:16,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:27:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1963032935, now seen corresponding path program 15 times [2023-08-25 22:27:16,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:27:16,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481816482] [2023-08-25 22:27:16,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:27:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:27:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:27:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:27:16,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:27:16,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481816482] [2023-08-25 22:27:16,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481816482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:27:16,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:27:16,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:27:16,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033846050] [2023-08-25 22:27:16,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:27:16,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:27:16,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:27:16,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:27:16,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:27:16,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:27:16,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 479 transitions, 10687 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:27:16,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:27:16,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:27:16,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:27:39,005 INFO L124 PetriNetUnfolderBase]: 55074/99741 cut-off events. [2023-08-25 22:27:39,005 INFO L125 PetriNetUnfolderBase]: For 1596200/1596200 co-relation queries the response was YES. [2023-08-25 22:27:40,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495351 conditions, 99741 events. 55074/99741 cut-off events. For 1596200/1596200 co-relation queries the response was YES. Maximal size of possible extension queue 1927. Compared 993297 event pairs, 8908 based on Foata normal form. 80/95964 useless extension candidates. Maximal degree in co-relation 495271. Up to 62662 conditions per place. [2023-08-25 22:27:40,608 INFO L140 encePairwiseOnDemand]: 325/357 looper letters, 705 selfloop transitions, 230 changer transitions 0/964 dead transitions. [2023-08-25 22:27:40,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 964 transitions, 14905 flow [2023-08-25 22:27:40,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-25 22:27:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-25 22:27:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2951 transitions. [2023-08-25 22:27:40,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4133053221288515 [2023-08-25 22:27:40,611 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2951 transitions. [2023-08-25 22:27:40,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2951 transitions. [2023-08-25 22:27:40,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:27:40,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2951 transitions. [2023-08-25 22:27:40,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 147.55) internal successors, (2951), 20 states have internal predecessors, (2951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:27:40,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 357.0) internal successors, (7497), 21 states have internal predecessors, (7497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:27:40,618 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 357.0) internal successors, (7497), 21 states have internal predecessors, (7497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:27:40,618 INFO L175 Difference]: Start difference. First operand has 318 places, 479 transitions, 10687 flow. Second operand 20 states and 2951 transitions. [2023-08-25 22:27:40,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 964 transitions, 14905 flow [2023-08-25 22:27:51,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 964 transitions, 14708 flow, removed 29 selfloop flow, removed 9 redundant places. [2023-08-25 22:27:51,554 INFO L231 Difference]: Finished difference. Result has 333 places, 500 transitions, 11639 flow [2023-08-25 22:27:51,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=10500, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=11639, PETRI_PLACES=333, PETRI_TRANSITIONS=500} [2023-08-25 22:27:51,555 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 185 predicate places. [2023-08-25 22:27:51,555 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 500 transitions, 11639 flow [2023-08-25 22:27:51,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:27:51,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:27:51,556 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:27:51,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-25 22:27:51,556 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:27:51,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:27:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1117286965, now seen corresponding path program 1 times [2023-08-25 22:27:51,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:27:51,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734890973] [2023-08-25 22:27:51,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:27:51,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:27:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:27:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:27:51,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:27:51,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734890973] [2023-08-25 22:27:51,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734890973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:27:51,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:27:51,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:27:51,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011326007] [2023-08-25 22:27:51,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:27:51,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:27:51,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:27:51,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:27:51,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:27:51,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:27:51,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 500 transitions, 11639 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:27:51,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:27:51,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:27:51,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:28:17,650 INFO L124 PetriNetUnfolderBase]: 60154/110686 cut-off events. [2023-08-25 22:28:17,651 INFO L125 PetriNetUnfolderBase]: For 1880354/1880354 co-relation queries the response was YES. [2023-08-25 22:28:18,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548560 conditions, 110686 events. 60154/110686 cut-off events. For 1880354/1880354 co-relation queries the response was YES. Maximal size of possible extension queue 2126. Compared 1134483 event pairs, 10496 based on Foata normal form. 360/106656 useless extension candidates. Maximal degree in co-relation 548475. Up to 63907 conditions per place. [2023-08-25 22:28:19,791 INFO L140 encePairwiseOnDemand]: 337/357 looper letters, 727 selfloop transitions, 67 changer transitions 0/823 dead transitions. [2023-08-25 22:28:19,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 823 transitions, 18623 flow [2023-08-25 22:28:19,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 22:28:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 22:28:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1610 transitions. [2023-08-25 22:28:19,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40998217468805703 [2023-08-25 22:28:19,793 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1610 transitions. [2023-08-25 22:28:19,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1610 transitions. [2023-08-25 22:28:19,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:28:19,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1610 transitions. [2023-08-25 22:28:19,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 146.36363636363637) internal successors, (1610), 11 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:28:19,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 357.0) internal successors, (4284), 12 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:28:19,796 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 357.0) internal successors, (4284), 12 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:28:19,796 INFO L175 Difference]: Start difference. First operand has 333 places, 500 transitions, 11639 flow. Second operand 11 states and 1610 transitions. [2023-08-25 22:28:19,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 823 transitions, 18623 flow [2023-08-25 22:28:31,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 823 transitions, 18174 flow, removed 50 selfloop flow, removed 17 redundant places. [2023-08-25 22:28:31,025 INFO L231 Difference]: Finished difference. Result has 332 places, 524 transitions, 11810 flow [2023-08-25 22:28:31,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=11245, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11810, PETRI_PLACES=332, PETRI_TRANSITIONS=524} [2023-08-25 22:28:31,026 INFO L281 CegarLoopForPetriNet]: 148 programPoint places, 184 predicate places. [2023-08-25 22:28:31,026 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 524 transitions, 11810 flow [2023-08-25 22:28:31,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:28:31,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:28:31,027 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:28:31,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-25 22:28:31,027 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err17ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2023-08-25 22:28:31,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:28:31,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1926502503, now seen corresponding path program 2 times [2023-08-25 22:28:31,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:28:31,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621004402] [2023-08-25 22:28:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:28:31,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:28:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:28:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:28:31,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:28:31,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621004402] [2023-08-25 22:28:31,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621004402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:28:31,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:28:31,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 22:28:31,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978870824] [2023-08-25 22:28:31,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:28:31,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 22:28:31,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:28:31,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 22:28:31,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-25 22:28:31,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 357 [2023-08-25 22:28:31,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 524 transitions, 11810 flow. Second operand has 11 states, 11 states have (on average 122.45454545454545) internal successors, (1347), 11 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:28:31,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:28:31,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 357 [2023-08-25 22:28:31,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand